Analyzing Computer Game Narratives

  • Clark Verbrugge
  • Peng Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6243)

Abstract

In many computer games narrative is a core component with the game centering on an unfolding, interactive storyline which both motivates and is driven by the game-play. Analyzing narratives to ensure good properties is thus important, but scalability remains a barrier to practical use. Here we develop a formal analysis system for interactive fiction narratives. Our approach is based on a relatively high-level game language, and borrows analysis techniques from compiler optimization to improve performance. We demonstrate our system on a variety of non-trivial narratives analyzing a basic reachability problem, the path to win the game. We are able to analyze narratives orders of magnitude larger than the previous state-of-the-art based on lower-level representations. This level of performance allows for verification of narrative properties at practical scales.

Keywords

game narrative verification optimization performance analysis 

References

  1. 1.
    Nelson, M.J., Mateas, M., Roberts Jr., D.L., Isbell, C.L.: Declarative optimization-based drama management in interactive fiction. IEEE Computer Graphics and Appl. 26(3), 32–41 (2006)CrossRefGoogle Scholar
  2. 2.
    Barros, L.M., Musse, S.R.: Towards consistency in interactive storytelling: Tension arcs and dead-ends. Comput. Entertain. 6(3), 1–17 (2008)CrossRefGoogle Scholar
  3. 3.
    Adams, E.: The designer’s notebook: Bad game designer, no twinkie! parts I–VI (1998-2005), http://www.gamasutra.com
  4. 4.
    Verbrugge, C.: A structure for modern computer narratives. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 308–325. Springer, Heidelberg (2003)Google Scholar
  5. 5.
    Pickett, C.J.F., Verbrugge, C., Martineau, F.: (P)NFG: A language and runtime system for structured computer narratives. In: GameOn’NA: Proceedings of the 1st Annual North American Game-On Conference, EUROSIS, pp. 23–32 (August 2005)Google Scholar
  6. 6.
    Burg, J., Boyle, A., Lang, S.D.: Using constraint logic programming to analyze the chronology in ”A rose for Emily”. Computers and the Humanities 34(4), 377–392 (2000)CrossRefGoogle Scholar
  7. 7.
    Lindley, C.A., Eladhari, M.: Causal normalisation: A methodology for coherent story logic design in computer role-playing games. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 292–307. Springer, Heidelberg (2003)Google Scholar
  8. 8.
    Natkin, S., Vega, L.: A Petri net model for computer games analysis. International Journal of Intelligent Games & Simulation 3(1), 37–44 (2004)Google Scholar
  9. 9.
    Brom, C., Sisler, V., Holan, T.: Story manager in ‘Europe 2045’ uses Petri nets. In: Cavazza, M., Donikian, S. (eds.) ICVS-VirtStory 2007. LNCS, vol. 4871, pp. 38–50. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Araújo, M., Roque, L.: Modeling games with Petri nets. In: DiGRA Conference, London, Brunel University (September 2009)Google Scholar
  11. 11.
    Tessman, K.: The Hugo Book—Hugo: An Interactive Fiction Design System. In: The General Coffee Company Film Productions, 1st edn., Toronto, Canada (2004)Google Scholar
  12. 12.
    Wild, C.: ADRIFT: Adventure Development & Runner—Interactive Fiction Toolkit, version 4.0 manual (2003), http://www.adrift.org.uk
  13. 13.
    Nelson, G., Seebach, P., Firth, R., Plotkin, A., Short, E.: Inform. (1993), http://www.inform-fiction.org/

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Clark Verbrugge
    • 1
  • Peng Zhang
    • 1
  1. 1.School of Computer ScienceMcGill UniversityMontréalCanada

Personalised recommendations