AIAug 29, 2018
Victory Probability in the Fire Emblem Arena
arXiv:1808.10750v1Has Code
Originality Synthesis-oriented
AI Analysis
This addresses a specific gaming challenge for Fire Emblem players, but it is incremental as it applies known computational methods to a new domain.
The paper tackles the problem of computing victory probabilities in Fire Emblem arena battles by expressing it as a multivariate recurrence relation and solving it with dynamic programming, resulting in an efficient implementation.
We demonstrate how to efficiently compute the probability of victory in Fire Emblem arena battles. The probability can be expressed in terms of a multivariate recurrence relation which lends itself to a straightforward dynamic programming solution. Some implementation issues are addressed, and a full implementation is provided in code.