Acyclic Constraint Logic and Games

Article type: Research Article

Authors: Hoogeboom, Hendrik Jan¹ | Kosters, Walter A.² | van Rijn, Jan N.³ | Vis, Jonathan K.⁴

Affiliations: Leiden Institute of Advanced Computer Science, Universiteit Leiden, The Netherlands

Note: [1] [email protected]

Note: [2] [email protected]

Note: [3] [email protected]

Note: [4] [email protected]

Abstract: Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construction of complexity proofs. It is very convenient for the analysis of games, providing a uniform view. We focus on the acyclic version, apply this to Klondike, Mahjong Solitaire and Nonogram (that requires planarity), and discuss the more complicated game of Dou Shou Qi. While for the first three games we reobtain known characterizations in a simple and uniform manner, the result for Dou Shou Qi is new.

DOI: 10.3233/ICG-2014-37102

Journal: ICGA Journal, vol. 37, no. 1, pp. 3-16, 2014