Strongly Solving the Royal Game of Ur
ICGA Journal: The Journal of the Computer Games Community · 30.10.2026
DOI: 10.1177/13896911261501817 ↗Kurz gefasst
Fachartikel in der Zeitschrift ICGA Journal: The Journal of the Computer Games Community, online erschienen am 30.10.2026. Verfasst von Jeroen Olieslagers und 1 weiteren Autor:innen. Die Arbeit nennt 44 Literaturangaben.
Abstract (Originalsprache)
We strongly solve three conjectured rule sets for the Royal Game of Ur: Finkel, Blitz, and Masters. For every reachable state, we compute the game-theoretic value, the first player’s probability of winning under optimal play, and an optimal move. From the initial position, these values are 51.54% for Finkel, 50.41% for Blitz, and 50.48% for Masters, implying a small first-player advantage in each variant. We obtain the solution maps using value iteration and the Bellman equations, verify them through convergence analysis and large-scale simulations, and describe practical optimizations that make the computation tractable. The same framework applies to other finite, enumerable variants, and the resulting maps are deployed on RoyalUr.net for optimal play, game review, and player feedback.
Zitieren
APA
Olieslagers, J., & Lamont, P. X. (2026). Strongly Solving the Royal Game of Ur. ICGA Journal: The Journal of the Computer Games Community. https://doi.org/10.1177/13896911261501817
Vancouver
Olieslagers J, Lamont PX. Strongly Solving the Royal Game of Ur. ICGA Journal: The Journal of the Computer Games Community. 2026. doi:10.1177/13896911261501817
BibTeX
@article{Olieslagers2026,
author = {Olieslagers, Jeroen and Lamont, Padraig Xavier},
title = {Strongly Solving the Royal Game of Ur},
journal = {ICGA Journal: The Journal of the Computer Games Community},
year = {2026},
doi = {10.1177/13896911261501817}
}
EUVIMED