Acyclic Constraint Logic and Games
Computational Complexity
2016-04-20 v1
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 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.
Cite
@article{arxiv.1604.05487,
title = {Acyclic Constraint Logic and Games},
author = {Hendrik Jan Hoogeboom and Walter A. Kosters and Jan N. van Rijn and Jonathan K. Vis},
journal= {arXiv preprint arXiv:1604.05487},
year = {2016}
}
Comments
14 pages, originally published at: ICGA Journal Vol. 37, pp. 3-16, 2014