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.

Authors:

• Nathaniel Johnston

Download:

• Preprint from arXiv:1203.1633 [cs.CC]
• Local preprint [pdf]

Cite as:

• N. Johnston. The Complexity of the Puzzles of Final Fantasy XIII-2. E-print: arXiv:1203.1633 [cs.CC], 2012

Supplementary Material:

• Counting and Solving Final Fantasy XIII-2’s Clock Puzzles – a blog post about one of the three puzzles considered in this paper