A restriction of Euclid

DOI10.1017/S0004972712000391MaRDI QIDQ3143909zbMATH OpenFDO

Authors Grant Cairns, Nhan Bao Ho

Publication date 6 December 2012

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1202.4597

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Abstract: Euclid is a well known two-player impartial combinatorial game. A position in Euclid is a pair of positive integers and the players move alternately by subtracting a positive integer multiple of one of the integers from the other integer without making the result negative. The player who makes the last move wins. There is a variation of Euclid due to Grossman in which the game stops when the two entrees are equal. We examine a further variation that we called M-Euclid in which the game stops when one of the entrees is a positive integer multiple of the other. We solve the Sprague-Grundy function for M-Euclid and compare the Sprague-Grundy functions of the three games.

Recommendations

• The Sprague-Grundy function of the real game Euclid
• scientific article; zbMATH DE number 2214424
• The game of 3-Euclid
• Variations of the game 3-Euclid
• Euclid and Wythoff games

Cites work

• A Game Based on the Euclidean Algorithm and A Winning Strategy for it
• Min, a combinatorial game having a connection with prime numbers
• The Sprague-Grundy function of the game Euclid
• The Sprague-Grundy function of the real game Euclid

Cited in

(6)

• On tame, pet, domestic, and miserable impartial games
• The game of 3-Euclid
• scientific article; zbMATH DE number 2214424 (Why is no real title available?)
• The Sprague-Grundy function of the real game Euclid
• Variations of the game 3-Euclid
• On the misere version of game Euclid and miserable games

This page was built for publication: A restriction of Euclid

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