The Parameterized Complexity of Ricochet Robots

Sliding maze puzzles like Ricochet Robots and Atomix are puzzles in which solvers must maneuver agents around a grid board subject to the constraint that whenever an agent moves in some direction, it must move as far as possible in that direction. In general, finding an optimal solution to these puz...

Full description

Saved in:
Bibliographic Details
Published inJournal of Information Processing Vol. 25; pp. 716 - 723
Main Authors Hesterberg, Adam, Kopinsky, Justin
Format Journal Article
LanguageEnglish
Published Tokyo Information Processing Society of Japan 01.01.2017
Japan Science and Technology Agency
Subjects
Computational Complexity
Parameterized Complexity
Puzzles
Robots
Solvers
Online AccessGet full text

Cover

More Information
Summary:Sliding maze puzzles like Ricochet Robots and Atomix are puzzles in which solvers must maneuver agents around a grid board subject to the constraint that whenever an agent moves in some direction, it must move as far as possible in that direction. In general, finding an optimal solution to these puzzles is known to be PSPACE-complete. This paper further shows that these puzzles are W[SAT]-hard with respect to the number of robots in the puzzle instance (and therefore unlikely to be Fixed Parameter Tractable).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1882-6652
1882-6652
DOI:10.2197/ipsjjip.25.716