Acyclic Constraint Logic and Games

@article{Hoogeboom2014AcyclicCL,
  title={Acyclic Constraint Logic and Games},
  author={H. J. Hoogeboom and W. Kosters and J. V. Rijn and J. Vis},
  journal={ArXiv},
  year={2014},
  volume={abs/1604.05487}
}
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… Expand
Fixed-Parameter Algorithms for Graph Constraint Logic
TLDR
It is shown that NCL is fixed-parameter tractable (FPT) for any of these parameters, and that, in a sense, NCL as introduced by Hearn and Demaine is defined in the most economical way for the purpose of capturing \PSPACE. Expand
ENDGAME ANALYSIS OF DOU
Dou Shou Qi is a game in which two players control a number of pieces, each of them aiming to move one of their pieces onto a given square. We implemented an engine for analyzing the game. Moreover,Expand
Endgame Analysis of DOU SHOU QI
TLDR
An engine for analyzing Dou Shou Qi is implemented, and a series of endgame tablebases containing all configurations with up to four pieces are created, the first steps towards theoretically solving the game. Expand
Comparing Strategic Agents for Dominance
Dominance is an area-control board game played on a checkered seven by seven board. Players have to spawn their pieces onto the board while trying to exert dominance over the game board. As the gameExpand
Comparing Strategic Agents for Dominance
Dominance is an area-control board game played on a checkered seven by seven board. Players have to spawn their pieces onto the board while trying to exert dominance over the game board. As the gameExpand
Computing and Predicting Winning Hands in the Trick-Taking Game of Klaverjas
TLDR
Results show that the exact approach typically solves a game within minutes, whereas a relatively small number of instances require up to several days, traversing a space of several billion game states, suggesting that a hybrid approach combining both machine learning and exact search may be the solution to a perfect real-time artificial Klaverjas agent. Expand

References

SHOWING 1-10 OF 26 REFERENCES
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
TLDR
The main result is that classic unrestricted sliding-block puzzles are PSPACE-hard, even if the pieces are restricted to be all dominoes (1 × 2 blocks) and the goal is simply to move a particular piece. Expand
Playing Games: The complexity of Klondike, Mahjong, Nonograms and Animal Chess
TLDR
It is shown that determining whether a Nonogram has a solution and finding a solution is NPcomplete, by reduction from Planar Bounded Nondeterministic Constraint Logic. Expand
Games, puzzles and computation
TLDR
This thesis develops the idea of game as computation to a greater degree than has been done previously, and presents a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games. Expand
Complexity and retrograde analysis of the game Dou Shou Qi
TLDR
A proof showing that this game is PSPACE-hard is presented, and an analyzing engine and endgame tablebase containing all configurations with up to four pieces are created, the first steps towards theoretically solving Dou Shou Qi. Expand
Random debaters and the hardness of approximating stochastic functions
TLDR
Using this new characterization of PSPACE, it is shown that certain stochastic PSPACE-hard functions are as hard to approximate closely as they are to compute exactly. Expand
A Survey of NP-Complete Puzzles
TLDR
This article surveys NP-Complete puzzles in the hope of motivating further research in this fascinating area, particularly for those puzzles which have received little scientific attention to date. Expand
Sokoban is PSPACE-complete
TLDR
It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata and shows that the puzzles are PSPACE-complete, solving the open problem stated in 1. Expand
The Complexity of Solitaire
TLDR
The problem of determining whether an n-card Klondike initial configuration can lead to a win is shown NP-complete, and the problem is solvable by a family of constant-depth unbounded-fan-in { and, or, mod3 } -circuits. Expand
NP-completeness Results for NONOGRAM via Parsimonious Reductions
We introduce a new class of NP problems called ANOTHER SOLUTION PROBLEMs. For a given NP problem X, ANOTHER SOLUTION PROBLEM for X (ASP for X) is to ask, for a given instance I for X and itsExpand
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
TLDR
This paper studies Klondike using several sampling-based planning approaches including UCT, hindsight optimization, and sparse sampling, and establishes empirical lower bounds on their performance and provides a theoretical bound on the sample complexity of a method that naturally combines sparse sampling and UCT. Expand
...
1
2
3
...