The mathematics of Spinpossible
Alex Sutherland, Andrew Sutherland
TL;DR
This paper provides a mathematical analysis of the Spinpossible puzzle game, including bounds on solution lengths, variations with move restrictions, and open questions for future research.
Contribution
It offers a formal mathematical description of Spinpossible, establishes bounds on optimal solutions, and explores game variations with restricted moves.
Findings
Elementary bounds on solution lengths established
Analysis of game variations with move restrictions
List of open questions for further research
Abstract
Notes on the Spinpossible puzzle game. We give a mathematical description of the game, prove some elementary bounds on the length of optimal solutions, and consider variations of the game which place restrictions on the set of permitted moves. We conclude with a list of open questions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computability, Logic, AI Algorithms · Mathematical Dynamics and Fractals