Geometry and Generation of a New Graph Planarity Game
Publication date
2018
Authors
Kraaijer, Rutger
van Kreveld, Marc
Meulemans, Wouter
Renssen, André van
Editors
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
taverne
Abstract
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without edge intersections and a move consists of swapping the locations of two vertices connected by an edge. We analyze this puzzle game using concepts from graph theory and graph drawing, computational geometry, and complexity. Furthermore, we specify what good levels look like and we show how they can be generated. We also report on experiments that show how well the generation works.
Keywords
Taverne
Citation
Kraaijer, R, Kreveld, M J V, Meulemans, W & Renssen, A V 2018, Geometry and Generation of a New Graph Planarity Game. in 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018, Maastricht, The Netherlands, August 14-17, 2018. IEEE, pp. 1-8. https://doi.org/10.1109/CIG.2018.8490404