Abstract
We define the family of locally path-bounded digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible, in a finite number of moves. This is done by proving that the Generalized Sprague-Grundy function exists uniquely and has finite values on this class.
Author supplied keywords
Cite
CITATION STYLE
APA
Fraenkel, A. S., & Rahat, O. (1999). Infinite cyclic impartial games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1558, pp. 212–221). Springer Verlag. https://doi.org/10.1007/3-540-48957-6_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free