Discrete bidding games
Combinatorics
2010-07-13 v2
Abstract
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.
Keywords
Cite
@article{arxiv.0801.0579,
title = {Discrete bidding games},
author = {Mike Develin and Sam Payne},
journal= {arXiv preprint arXiv:0801.0579},
year = {2010}
}
Comments
41 pages, 22 figures v2: minor changes, final version