Geometry and Generation of a New Graph Planarity Game

Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publication2018 IEEE Conference on Computational Intelligence and Games, CIG 2018, Maastricht, The Netherlands, August 14-17, 2018
PublisherIEEE
Pages1-8
Number of pages8
DOIs
Publication statusPublished - 2018

Fingerprint

Dive into the research topics of 'Geometry and Generation of a New Graph Planarity Game'. Together they form a unique fingerprint.

Cite this