Acyclic Constraint Logic and Games
Hendrik Jan Hoogeboom, Walter A. Kosters, Jan N. van Rijn, Jonathan K., Vis
TL;DR
This paper explores the acyclic version of Non-deterministic Constraint Logic, applying it to analyze several classic games like Klondike, Mahjong Solitaire, and Nonogram, and introduces new results for Dou Shou Qi.
Contribution
It provides a uniform framework for analyzing these games using acyclic constraint logic and presents new complexity results for Dou Shou Qi.
Findings
Reobtained known characterizations for Klondike, Mahjong Solitaire, and Nonogram.
Applied acyclic constraint logic to analyze these games uniformly.
Provided new complexity results for Dou Shou Qi.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.