The complexity of change.
J van den Heuvel - Surveys in combinatorics, 2013 - books.google.com
Many combinatorial problems can be formulated as “Can I transform configuration 1 into
configuration 2, if only certain transformations are allowed?”. An example of such a question …
configuration 2, if only certain transformations are allowed?”. An example of such a question …
Complexity and completeness of finding another solution and its application to puzzles
T Yato, T Seta - IEICE transactions on fundamentals of electronics …, 2003 - search.ieice.org
The Another Solution Problem (ASP) of a problem< cd02d36. gif> is the following problem:
for a given instance x of< cd02d36. gif> and a solution s to it, find a solution to x other than s …
for a given instance x of< cd02d36. gif> and a solution s to it, find a solution to x other than s …
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
We present a nondeterministic model of computation based on reversing edge directions in
weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether …
weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether …
[LIVRE][B] Games, puzzles, and computation
RA Hearn, ED Demaine - 2009 - books.google.com
This book explores the underlying mathematical reasons for why games and puzzles are
challenging and so much fun. It shows how games and puzzles can serve as powerful …
challenging and so much fun. It shows how games and puzzles can serve as powerful …
A survey of NP-complete puzzles
Single-player games (often called puzzles) have received considerable attention from the
scientific community. Consequently, interesting insights into some puzzles, and into the …
scientific community. Consequently, interesting insights into some puzzles, and into the …
Tetris is hard, even to approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces
and must pack them into a rectangular gameboard initially occupied by a given configuration …
and must pack them into a rectangular gameboard initially occupied by a given configuration …
Magic: The gathering is Turing complete
A Churchill, S Biderman, A Herrick - arxiv preprint arxiv:1904.09828, 2019 - arxiv.org
$\textit {Magic: The Gathering} $ is a popular and famously complicated trading card game
about magical combat. In this paper we show that optimal play in real-world $\textit {Magic} …
about magical combat. In this paper we show that optimal play in real-world $\textit {Magic} …
Massive uniform manipulation: Controlling large populations of simple robots with a common input signal
Roboticists, biologists, and chemists are now producing large populations of simple robots,
but controlling large populations of robots with limited capabilities is difficult, due to …
but controlling large populations of robots with limited capabilities is difficult, due to …
Combinatorial games: selected bibliography with a succinct gourmet introduction
A Fraenkel - The Electronic Journal of Combinatorics, 2012 - combinatorics.org
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …
perfect information (no hidden information as in some card games), no chance moves (no …
Physical zero-knowledge proof for Makaro
Makaro is a logic game similar to Sudoku. In Makaro, a grid has to be filled with numbers
such that: given areas contain all the numbers up to the number of cells in the area, no …
such that: given areas contain all the numbers up to the number of cells in the area, no …