The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games

09/16/2019

∙

by   Jiawei Gao, et al.

∙

36

∙

share

Fire Emblem (FE) is a popular turn-based tactical role-playing game (TRPG) series on the Nintendo gaming consoles. This paper studies the computational complexity of FE, and proves that: 1. General FE is PSPACE-complete. 2. Poly-round FE is NP-complete, even when the map is cycle-free. Poly-round FE is to decide whether the player can win the game in a certain number of rounds that is polynomial to the map size. A map is called cycle-free if its corresponding planar graph is cycle-free. These hardness results also hold for other similar TRPG series, such as Final Fantasy Tactics, Tactics Ogre and Disgaea.