Infinite cyclic impartial games

Simple item page
dc.creatorFraenkel, Aviezri S.
dc.creatorRahat, Ofer
dc.date1998-09-15
dc.date.accessioned2026-07-07T05:26:01Z
dc.date.available2026-07-07T05:26:01Z
dc.descriptionWe define the family of {\it 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.
dc.descriptionTo appear in Proc. Computer Games 1998
dc.identifierhttps://arxiv.org/abs/math/9809077
dc.identifierhttp://arxiv.org/abs/math/9809077
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77398
dc.subjectCombinatorics
dc.titleInfinite cyclic impartial games
dc.typetext

Files

Collections

arXiv