pith. sign in

arxiv: 0801.0579 · v2 · submitted 2008-01-03 · 🧮 math.CO

Discrete bidding games

classification 🧮 math.CO
keywords gamesbiddingdiscretemovesreal-valuedrichmantic-tac-toevariations
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.