The generalized Sprague-Grundy function and its invariance under certain mappings

DOI10.1016/0097-3165(86)90058-0zbMath0622.05030OpenAlexW2089828539MaRDI QIDQ1090685

Aviezri S. Fraenkel, Yaacov Yesha

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90058-0

zbMATH Keywords

digraphspolynomial algorithmgeneralized Sprague-Grundy function

Mathematics Subject Classification ID

2-person games (91A05) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Complexity, appeal and challenges of combinatorial games ⋮ Epidemiography. II: Games with a dozing yet winning player ⋮ Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees ⋮ Towards an algebraic combinatoric description of closed systems ⋮ The particles and antiparticles game ⋮ Two-player tower of Hanoi ⋮ Geometrical extensions of Wythoff's game ⋮ Recent results and questions in combinatorial game complexities ⋮ Infinite cyclic impartial games

Cites Work

• Theory of annihilation games. I
• Strategy for a class of games with dynamic ties
• Graphs and composite games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The generalized Sprague-Grundy function and its invariance under certain mappings