Computational Complexity of Jumping Block Puzzles

Kanzaki, Masaaki; Otachi, Yota; Uehara, Ryuhei

doi:10.1007/978-3-030-89543-3_54

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As far as the author knows, they were invented independently of the research on theoretical computer science (although Adachi should know the Flying Block when he invented Flip Over). Recently, computational complexity of these puzzles has been investigated from the viewpoint of combinatorial reconfiguration [68]. In the paper, the authors use the constraint logic model to prove PSPACE-completeness.…”

Section: New Trends On Combinatorial Reconfiguration (2010)mentioning

confidence: 99%

Computational Complexity of Puzzles and Related Topics

Uehara

2023

IIS

Self Cite

View full text Add to dashboard Cite

Since the 1930s, mathematicians and computer scientists have been interested in computation. While mathematicians investigate recursion theory, computer scientists investigate computational complexity based on Turing machine model to understand what a computation is. Beside them, there is another approach of research on computation, which is the investigation of puzzles and games. Once we regard the rules used in puzzles and games as the set of basic operations of computation, we can perform some computation by solving puzzles and playing games. In fact, research on puzzles and games from the viewpoint of theoretical computer science has continued without any break in the history of theoretical computer science. Sometimes the research on computational complexity classes has proceeded by understanding the tons of puzzles. The wide collection of complete problems for a specific computational complexity class shares a common property, which gives us a deep understanding of the class. In this survey paper, we give a brief history of research on computational complexities of puzzles and games with related results and trends in theoretical computer science.

show abstract

Section: New Trends On Combinatorial Reconfiguration (2010)mentioning

confidence: 99%