Discrete bidding games
The electronic journal of combinatorics, Tome 17 (2010)
We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences between discrete bidding games and Richman games, which allow real-valued bidding. Unlike Richman games, discrete bidding game variations of many familiar games, such as chess, Connect Four, and even Tic-Tac-Toe, are suitable for recreational play. We also present an analysis of Tic-Tac-Toe for both discrete and real-valued bidding.
DOI :
10.37236/357
Classification :
91A46, 91B26, 91A60
Mots-clés : discrete bidding games, Richman games, tie-breaking
Mots-clés : discrete bidding games, Richman games, tie-breaking
@article{10_37236_357,
author = {Mike Develin and Sam Payne},
title = {Discrete bidding games},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/357},
zbl = {1188.91048},
url = {http://geodesic.mathdoc.fr/articles/10.37236/357/}
}
Mike Develin; Sam Payne. Discrete bidding games. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/357
Cité par Sources :