Hex and combinatorics

DOI10.1016/j.disc.2006.01.029zbMath1201.91019OpenAlexW2046062574WikidataQ56212882 ScholiaQ56212882MaRDI QIDQ2433713

Ryan B. Hayward, Jack van Rijswijck

Publication date: 30 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.01.029

zbMATH Keywords

game of hex

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items

On the complexity of connection games ⋮ MoHex 2.0: A Pattern-Based MCTS Hex Player ⋮ How to play Reverse Hex ⋮ Probing the 4-3-2 Edge Template in Hex ⋮ Game edge-connectivity of graphs ⋮ Maker–Breaker percolation games I: crossing grids

Cites Work

• Solving \(7\times 7\) hex with domination, fill-in, and virtual connections
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• A Nobel prize for John Nash
• Hex Strategy
• Dead Cell Analysis in Hex and the Shannon Game
• The Game of Hex and the Brouwer Fixed-Point Theorem
• A Combinatorial Problem Which Is Complete in Polynomial Space
• A Solution of the Shannon Switching Game
• A hierarchical approach to computer Hex
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item