Using graph transformation for puzzle game level generation and validation

Abstract

As part of a student’s project, computer science student David Priemer and former graphics design student Daniel Goffin started to develop a nice puzzle based computer game called Perlinoid. In his Bachelor thesis, David developed a level generator for Perlinoid. The challenge was to generate interesting puzzles with a reasonably small number of elements and reasonably complex series of steps required for the solution. Being educated in graph transformations, David modeled the possible puzzles as graphs and possible user steps as graph transformations. First a random level is generated, for which the level generator computes a reachabilty graph by applying all graph transformations in all possible combinations on all possible matches. Next, the reachability graph is analyzed for distances between start graph and end graph, number of possible choices, number of different solution paths, etc. and a number of metrics are applied. Finally, the result gets evaluated. In case the level is considered insufficient, it will be discarded and the process starts from the beginning. This is done within the Perlinoid application on demand at user side. To minimize the footprint of the level generator, a new dedicated graph transformation engine has been built and incorporated into the Perlinoid game. This paper reports about the concepts and experiences with this approach.