Random-Turn Hex and Other Selection Games

DOI10.1080/00029890.2007.11920428zbMath1153.91012arXivmath/0508580OpenAlexW1620767973WikidataQ58121652 ScholiaQ58121652MaRDI QIDQ3529170

Scott Sheffield, Oded Schramm, Yuval Peres, David Bruce Wilson

Publication date: 20 October 2008

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0508580

zbMATH Keywords

optimal strategyhexrandom-turn hexrandom-turn selection gameswin or lose selection games

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial games (91A46) Recreational mathematics (00A08)

Related Items

Random-player maker-breaker games ⋮ The expected time to end the tug-of-war in a wedge ⋮ Oded Schramm's contributions to noise sensitivity ⋮ Minimizing the time to a decision ⋮ Tug-of-war with noise: a game-theoretic view of the \(p\)-Laplacian ⋮ Remarks on History and Presence of Game Tree Search and Research ⋮ Bidding games and efficient allocations ⋮ Quantitative noise sensitivity and exceptional times for percolation ⋮ Bidding chess ⋮ Non-convex Hamilton-Jacobi equations with gradient constraints ⋮ Tug-of-war and the infinity Laplacian ⋮ Efficient Winning Strategies in Random‐Turn Maker–Breaker Games

This page was built for publication: Random-Turn Hex and Other Selection Games