Puzzle and dragons is hard

DOI10.1016/j.tcs.2024.114477MaRDI QIDQ6204537

Po-Chun Yu, Jun-Yi Guo

Publication date: 28 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-hardNP-complete

Mathematics Subject Classification ID

Quantum computation (81P68) Stochastic games, stochastic differential games (91A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• The \((n^ 2-1)\)-puzzle and related relocation problems
• A real-time algorithm for the \((n^{2}-1)\)-puzzle
• A simple proof that the \((n^{2} - 1)\)-puzzle is hard
• Playing Games with Algorithms: Algorithmic Combinatorial Game Theory

This page was built for publication: Puzzle and dragons is hard