AAAI Publications, Eleventh Artificial Intelligence and Interactive Digital Entertainment Conference

Font Size: 
Automated Decomposition of Game Maps
Kári Halldórsson, Yngvi Björnsson

Last modified: 2015-09-23


Video game worlds are getting increasingly large and complex. This poses challenges to the game AI for both pathfinding and strategic decisions, not least in real-time strategy games. One way to alleviate the problem is to manually pre-label the game maps with information about regions and critical choke points, which the game AI can then take advantage of. We present a method for automatically decomposing game maps into non-uniform sized regions. The method uses a flooding algorithm at its core and has the benefit, in addition to its effectiveness, to be relatively intuitive both conceptually and in implementing. Empirical evaluation on game maps shows that the automatic decomposition results in intuitive regions of a comparable standard to human-made labeling. Furthermore, we show that our automatic decomposition, when used by a pathfinding algorithm capable of taking advantage of pre-labeled regions, significantly improves search effectiveness.


map decomposition; heuristic search; video games; pathfinding

Full Text: PDF