The Complexity of the Puzzles of Final Fantasy XIII-2
Nathaniel Johnston
TL;DR
This paper investigates the computational complexity of three puzzles from Final Fantasy XIII-2, proving some are NP-hard and providing an efficient solution for one.
Contribution
It establishes the NP-hardness of certain puzzles and offers an efficient algorithm for solving the Crystal Bonds puzzle.
Findings
Tile Trial puzzle is NP-hard.
Efficient algorithm developed for Crystal Bonds.
Generalizations of puzzles are NP-hard.
Abstract
We analyze the computational complexity of solving the three "temporal rift" puzzles in the recent popular video game Final Fantasy XIII-2. We show that the Tile Trial puzzle is NP-hard and we provide an efficient algorithm for solving the Crystal Bonds puzzle. We also show that slight generalizations of the Crystal Bonds and Hands of Time puzzles are NP-hard.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Digital Games and Media · Teaching and Learning Programming