Computer Science – Computational Complexity
Scientific paper
2012-03-07
Computer Science
Computational Complexity
16 pages, 9 figures
Scientific paper
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.
No associations
LandOfFree
The Complexity of the Puzzles of Final Fantasy XIII-2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Complexity of the Puzzles of Final Fantasy XIII-2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of the Puzzles of Final Fantasy XIII-2 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-15899