Hex and combinatorics
From MaRDI portal
Publication:2433713
Cites work
- scientific article; zbMATH DE number 1696545 (Why is no real title available?)
- scientific article; zbMATH DE number 3532767 (Why is no real title available?)
- scientific article; zbMATH DE number 1209711 (Why is no real title available?)
- scientific article; zbMATH DE number 1944396 (Why is no real title available?)
- scientific article; zbMATH DE number 1404463 (Why is no real title available?)
- scientific article; zbMATH DE number 3334121 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A Combinatorial Problem Which Is Complete in Polynomial Space
- A Nobel prize for John Nash
- A Solution of the Shannon Switching Game
- A hierarchical approach to computer Hex
- Dead Cell Analysis in Hex and the Shannon Game
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Hex strategy: making the right connections
- Solving \(7\times 7\) hex with domination, fill-in, and virtual connections
- The Game of Hex and the Brouwer Fixed-Point Theorem
Cited in
(8)- Maker–Breaker percolation games I: crossing grids
- scientific article; zbMATH DE number 5046720 (Why is no real title available?)
- A hierarchical approach to computer Hex
- MoHex 2.0: a pattern-based MCTS hex player
- Game edge-connectivity of graphs
- Probing the 4-3-2 Edge Template in Hex
- On the complexity of connection games
- How to play Reverse 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)