Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation
Ahmed M. Abuzuraiq, Arron Ferguson, Philippe Pasquier · 2019 IEEE Conference on Games (CoG) · 2019
We present Taksim, an Answer Set Programming (ASP) framework for generating content in games through constrained graph partitioning. We illustrate its expressivity by implementing logical constraints that are relevant to generating the spaces of game levels. Furthermore, we present a case study for creating game levels from a given Mission Graph. Finally, we propose key concepts that make constrained graph partitioning, coupled with ASP, an asset for Procedural Content Generation.