Random-Turn Hex and other selection games
| dc.creator | Peres, Yuval | |
| dc.creator | Schramm, Oded | |
| dc.creator | Sheffield, Scott | |
| dc.creator | Wilson, David B. | |
| dc.date | 2005-08-29 | |
| dc.date | 2006-04-26 | |
| dc.date.accessioned | 2026-07-07T12:46:22Z | |
| dc.date.available | 2026-07-07T12:46:22Z | |
| dc.description | The game of Hex has two players who take turns placing stones of their respective colors on the hexagons of a rhombus-shaped hexagonal grid. Black wins by completing a crossing between two opposite edges, while White wins by completing a crossing between the other pair of opposite edges. Although ordinary Hex is famously difficult to analyze, Random-Turn Hex--in which players toss a coin before each turn to decide who gets to place the next stone--has a simple optimal strategy. It belongs to a general class of random-turn games--called selection games--in which the expected payoff when both players play the random-turn game optimally is the same as when both players play randomly. We also describe the optimal strategy and study the expected length of the game under optimal play for Random-Turn Hex and several other selection games. | |
| dc.description | 17 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/math/0508580 | |
| dc.identifier | http://arxiv.org/abs/math/0508580 | |
| dc.identifier | American Mathematical Monthly, 114:373--387, May 2007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/221361 | |
| dc.subject | Probability | |
| dc.subject | 91A15; 82B43; 06E30 | |
| dc.title | Random-Turn Hex and other selection games | |
| dc.type | text |