Solving 8×8 Hex

Authors:
Philip Henderson;Broderick Arneson;Ryan B. Hayward
Affiliations:
Dept. of Computing Science, University of Alberta;Dept. of Computing Science, University of Alberta;Dept. of Computing Science, University of Alberta
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

A hierarchical approach to computer Hex

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Games solved: now and in the future

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Solving 7×7 Hex with domination, fill-in, and virtual connections

Theoretical Computer Science - Advances in computer games
A template matching table for speeding-up game-tree searches for hex

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence

Solving hex: beyond humans

CG'10 Proceedings of the 7th international conference on Computers and games
Evolutionary learning of policies for MCTS simulations

Proceedings of the International Conference on the Foundations of Digital Games
UCD: Upper confidence bound for rooted directed acyclic graphs

Knowledge-Based Systems

Hi-index	0.00

Using efficient methods that reduce the search space, we design an algorithm strong enough to solve all 8×8 Hex openings.