Random-Turn Hex and Other Selection Games

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.

[1]  Stanislav Smirnov,et al.  Critical percolation in the plane : I. Conformal invariance and Cardy's formula. II. Continuum scaling limit , 2001 .

[2]  Y. Peres,et al.  Tug-of-war and the infinity Laplacian , 2006, math/0605002.

[3]  Yvan Saint-Aubin,et al.  Conformal invariance in two-dimensional percolation , 1994 .

[4]  Rocco A. Servedio,et al.  On Decision Trees, Influences, and Learning Monotone Decision Trees , 2004 .

[5]  David B. Wilson,et al.  SLE coordinate changes , 2005 .

[6]  J. Propp,et al.  Combinatorial Games under Auction Play , 1999 .

[7]  Coniglio Fractal structure of Ising and Potts clusters: Exact results. , 1989, Physical review letters.

[8]  Stanislav Smirnov Critical percolation in the plane , 2009 .

[9]  Paul Scott The Game of Hex. , 2007 .

[10]  John F. Nash,et al.  The Essential John Nash , 2001 .

[11]  Sarah Simpson Escape and Survival , 2000 .

[12]  O. Schramm,et al.  Quantitative noise sensitivity and exceptional times for percolation , 2005, math/0504586.

[13]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[14]  D. Gale The Game of Hex and the Brouwer Fixed-Point Theorem , 1979 .

[15]  Vadim V. Anshelevich,et al.  The Game of Hex: An Automatic Theorem Proving Approach to Game Programming , 2000, AAAI/IAAI.

[16]  Wendelin Werner,et al.  CRITICAL EXPONENTS FOR TWO-DIMENSIONAL PERCOLATION , 2001 .

[17]  Stefan Reisch,et al.  Hex ist PSPACE-vollständig , 1981, Acta Informatica.

[18]  Ryan O'Donnell,et al.  Every decision tree has an influential variable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[19]  P. Grassberger Pair Connectedness and Shortest Path Scaling in Critical Percolation , 1999 .

[20]  John Cardy Critical percolation in finite geometries , 1992 .

[21]  Ian Stewart Hex Marks the Spot. , 2000 .

[22]  Cameron Browne,et al.  Hex strategy - making the right connections , 2000 .

[23]  Richard Mansfield,et al.  Strategies for the Shannon Switching Game , 1996 .