On the misere version of game Euclid and miserable games

DOI10.1016/j.disc.2006.07.042zbMath1108.91019OpenAlexW2050500459MaRDI QIDQ870986

Vladimir A. Gurvich

Publication date: 15 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial gamesWythoff's gameNimimpartial gamesSprague-Grundy functiongame Euclidmisere

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (7)

The Sprague-Grundy function of the real game Euclid ⋮ Further generalizations of the Wythoff game and the minimum excludant ⋮ Variations of the game 3-Euclid ⋮ The game of 3-Euclid ⋮ The switch operators and push-the-button games: a sequential compound over rulesets ⋮ On tame, pet, domestic, and miserable impartial games ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wythoff games, continued fractions, cedar trees and Fibonacci searches
• Misère annihilation games
• The Sprague-Grundy function for Wythoff's game
• On misere Nim-type games
• On sums of graph games with last player losing
• The Sprague-Grundy function of the game Euclid
• A generalization of Wythoff's game
• ON MISERE GAMES
• How to Beat Your Wythoff Games' Opponent on Three Fronts
• A Game Based on the Euclidean Algorithm and A Winning Strategy for it
• Properties of a Game Based on Euclid's Algorithm

This page was built for publication: On the misere version of game Euclid and miserable games