Please use this identifier to cite or link to this item:
Title: Interesting games through stage complexity and topology
Authors: Yannakakis, Georgios N.
Hallam, John
Keywords: Computer games -- Design
Artificial neural networks
Pac-Man (Game)
Games of strategy (Mathematics)
Issue Date: 2004
Publisher: MIT Press
Citation: Yannakakis, G. N., & Hallam, J. (2004). Interesting games through stage complexity and topology. 8th International Conference on the Simulation of Adaptive Behavior, Los Angeles. 13-17.
Abstract: In (Yannakakis and Hallam, 2004) we saw that the online learning (OLL) mechanism proposed is a robust approach which manages to emerge opponents (i.e Ghosts) that increase the interest of the prey-predator, multiagent Pac-Man computer game. It also demonstrated high adaptability to changing types of Pac-Man player (i.e. playing strategies) in a relevantly simple playing stage. In the work presented here we attempt to test the OLL mechanism over more complex stages and furthermore to explore the relation between the interest measure and the topology of the stage. In order to distinguish between stages of different complexity, we require an appropriate measure to quantify this feature of the stage. This measure is as follows C = 1/E{L} (1) where C is the complexity measure and E{L} is the average corridor length of the stage. According to (1), complexity is inversely proportional to the average corridor length of the stage. That is, the longer the average corridor length, the easier for the Ghosts to block Pac-Man and, therefore, the less complex the stage.
Appears in Collections:Scholarly Works - InsDG

Files in This Item:
File Description SizeFormat 
Interesting_games_through_stage_complexity_and_topology.pdf265.33 kBAdobe PDFView/Open

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.