The Sprague-Grundy function of the game Euclid

DOI10.1016/J.DISC.2006.04.020MaRDI QIDQ2433738zbMATH OpenOpenAlexFDO

Authors Gabriel Nivasch

Publication date 30 October 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.04.020

zbMATH Keywords

combinatorial gameEuclidimpartial gameSprague--Grundy function

Mathematics Subject Classification ID

Combinatorial games (91A46)

Cites work

• A Game Based on the Euclidean Algorithm and A Winning Strategy for it
• scientific article; zbMATH DE number 2077508 (Why is no real title available?)
• Properties of a Game Based on Euclid's Algorithm
• Winning ways for your mathematical plays. Vol. 1.

Cited in

(11)

• On tame, pet, domestic, and miserable impartial games
• On pruning search trees of impartial games
• The game of 3-Euclid
• Euclid and Wythoff games
• A restriction of Euclid
• The self-referential impartial game Minnie
• The Sprague-Grundy function of the real game Euclid
• Self-similar structure of \(\mathcal{P}\)-positions of the game Euclid
• Variations of the game 3-Euclid
• Computing remoteness functions of Moore, Wythoff, and Euclid's games
• On the misere version of game Euclid and miserable games

This page was built for publication: The Sprague-Grundy function of the game Euclid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433738)