English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Fire Emblem (FE) is a popular turn-based tactical role-playing game (TRPG)series on the Nintendo gaming consoles. This paper studies the computationalcomplexity of a simplified version of FE (only floor tiles and wall tiles, theHP and other attributes of characters are constants at most 8, the movementdistance per character each turn is fixed to 6 tiles), and proves that: 1.Simplified FE is PSPACE-complete (Thus actual FE is at least as hard). 2.Poly-round FE is NP-complete, even when the map is cycle-free, without healingunits, and the weapon durability is a small constant. Poly-round FE is todecide whether the player can win the game in a certain number of rounds thatis polynomial to the map size. A map is called cycle-free if its correspondingplanar graph is cycle-free. These hardness results also hold for other similarTRPG series, such as Final Fantasy Tactics, Tactics Ogre and Disgaea.

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