Computational Complexity of Jumping Block Puzzles
نویسندگان
چکیده
In combinatorial reconfiguration, the reconfiguration problems on a vertex subset (e.g., an independent set) are well investigated. these problems, some tokens placed of vertices graph, and there three natural rules called ``token sliding,'' jumping,'' addition removal''. context computational complexity puzzles, sliding block puzzles play important role. Depending set pieces, characterize classes including P, NP, PSPACE. The correspond to token model in reconfiguration. On other hand, relatively new notion jumping is proposed puzzle society. This counterpart puzzles. We investigate several variants determine their complexities.
منابع مشابه
Computational Complexity of Cast Puzzles
A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A cast puzzle is a type of disentanglement puzzle, where each piece is a zinc die-casting alloy. In this paper, we consider the generalized cast puzzle problem whose input is the layout of a finite number of pieces (polyhedrons) in the 3-dimension...
متن کاملComputational Complexity of String Puzzles
A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A string puzzle is a type of disentanglement puzzle, which consists of strings entangled with one or more wooden pieces. In this paper, we consider the generalized string puzzle problem whose input is the layout of strings and a wooden board with ...
متن کاملThe Computational Complexity of Games and Puzzles
The subject of my thesis is studying the algorithmic properties of one and two-player games people enjoy playing, such as chess or Sudoku. This research falls into a wider area known as combinatorial game theory. One of the main questions asked about games in this context is whether they are algorithmically tractable, that is, whether they can be solved with efficient algorithms. So far, more t...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملThe Complexity of Some Combinatorial Puzzles
Two puzzles that repeatedly appeared in the Munich newspaper tz are Knossos and The Hour-Glass (“Das Stundenglas”) [Bul10a, Bul10b, Bul10c, Bul11], see also [Pre]. Knossos asks the reader to insert walls into a grid of cells representing the famous palace of Knossos. Every room is described by a number that indicates the length of its walls in terms of segments enclosing the room (we assume tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4049750