Hex and combinatorics

DOI10.1016/J.DISC.2006.01.029zbMATH Open1201.91019OpenAlexW2046062574WikidataQ56212882 ScholiaQ56212882MaRDI QIDQ2433713FDOQ2433713

Authors: Ryan 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)

Cites Work

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

Cited In (8)

• MoHex 2.0: A Pattern-Based MCTS Hex Player
• Title not available (Why is that?)
• On the complexity of connection games
• Game edge-connectivity of graphs
• A hierarchical approach to computer Hex
• Maker–Breaker percolation games I: crossing grids
• How to play Reverse Hex
• Probing the 4-3-2 Edge Template in Hex

This page was built for publication: Hex and combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433713)