A hierarchical approach to computer Hex

DOI10.1016/S0004-3702(01)00154-0zbMath0982.68115MaRDI QIDQ5958203

Vadim V. Anshelevich

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

theorem provinggame programmingHex

Mathematics Subject Classification ID

Game theory (91A99)

Related Items

On the complexity of connection games, Conspiracy number search with relative sibling scores, MoHex 2.0: A Pattern-Based MCTS Hex Player, Havannah and TwixT are PSPACE-complete, Hex and combinatorics, QUANTUM COMPUTER: AN APPLIANCE FOR PLAYING MARKET GAMES, Games solved: Now and in the future

Cites Work

• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Hex Strategy
• The Game of Hex and the Brouwer Fixed-Point Theorem
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Deep Blue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item