The Complexity of the Puzzles of Final Fantasy XIII-2
classification
💻 cs.CC
keywords
puzzlesbondscomplexitycrystalfantasyfinalnp-hardpuzzle
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.