The Max-Welter game
From MaRDI portal
Publication:394306
DOI10.1016/J.DISC.2013.11.012zbMATH Open1281.05096arXiv1202.4075OpenAlexW2053188383MaRDI QIDQ394306FDOQ394306
Authors: Nhan Bao Ho
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: On a semi-infinite strip of squares rightward numbered with at most one coin in each square, in Welter's game, two players alternately move a coin to an empty square on its left. Jumping over other coins is legal. The player who first cannot move loses. We examine a variant of Welter's game, that we call Max-Welter, in which players are allowed to move only the coin furthest to the right. We solve the winning strategy and describe the positions of Sprague-Grundy value 1. We propose two theorems classifying some special cases where calculating the Sprague-Grundy value of a position of size becomes easier by considering another position of size . We establish two results on the periodicity of the Sprague-Grundy values. We then show that the game Max-Welter is classified in a proper subclass of tame games that Gurvich calls strongly miserable.
Full work available at URL: https://arxiv.org/abs/1202.4075
Recommendations
Cites Work
- Title not available (Why is that?)
- On tame, pet, domestic, and miserable impartial games
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- k-Welter - a generalization of Welter's game
- Properties of k-Welter's game
- On sums of graph games with last player losing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Misère annihilation games
Cited In (6)
This page was built for publication: The Max-Welter game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394306)