Solving \(7\times 7\) hex with domination, fill-in, and virtual connections

DOI10.1016/j.tcs.2005.09.042zbMath1086.68122OpenAlexW1965935527MaRDI QIDQ817784

Morgan Kan, Michael Johanson, Nathan Po, Yngvi Björnsson, Ryan B. Hayward, Jack van Rijswijck

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.042

zbMATH Keywords

fill-inhexgame-state reductionmove dominationmove orderingpattern setvirtual connection

Mathematics Subject Classification ID

Games involving graphs (91A43) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Hex and combinatorics

Cites Work

• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Hex Strategy
• Dead Cell Analysis in Hex and the Shannon Game
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving \(7\times 7\) hex with domination, fill-in, and virtual connections