Angel A. Cantu, Arturo Gonzalez, Cesar Lozano, Austin Luchsinger, Eduardo Medina, Fernando Martinez, Arnoldo Ramirez, and Tim Wylie.
The 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3’18), 2018.
Abstract: In this paper, we investigate a certain class of tile-based pattern games through a simplified version of a recent game titled Nonads. We prove that Nonads is PSPACE-complete with a reduction from bounded 2-player constraint logic (Bounded 2CL) even when both players share the same target and there is only one type of playable tile. This has application to any grid-based pattern building game.