Algorithms for games
A Combinatorial Problem Which Is Complete in Polynomial Space
Journal of the ACM (JACM)
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Games solved: now and in the future
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Schema mapping verification: the spicy way
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
CG'10 Proceedings of the 7th international conference on Computers and games
An extension of the h-search algorithm for artificial hex players
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Hex, braids, the crossing rule, and XH-search
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
A move generating algorithm for hex solvers
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Evolutionary learning of policies for MCTS simulations
Proceedings of the International Conference on the Foundations of Digital Games
| Hi-index | 0.00 |
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and successfully used for Checkers and a number of other games, become less useful for games with large branching factors like Hex and Go. In this paper, we describe deduction rules, which are used to calculate values of complex Hex positions recursively starting from the simplest ones. We explain how this approach is implemented in HEXY – the strongest Hex-playing computer program, the Gold medallist of the 5th Computer Olympiad in London, August 2000.