An extension of the h-search algorithm for artificial hex players

Authors:
Rune Rasmussen;Frederic Maire
Affiliations:
School of SEDC (Information Technology Faculty), Queensland University of Technology, Brisbane, QLD, Australia;School of SEDC (Information Technology Faculty), Queensland University of Technology, Brisbane, QLD, Australia
Venue:
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Year:
2004

Citing 4
Cited 2

A Combinatorial Problem Which Is Complete in Polynomial Space

Journal of the ACM (JACM)
A hierarchical approach to computer Hex

Artificial Intelligence - Chips challenging champions: games, computers and 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
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hex is a classic board game invented in the middle of the twentieth century by Piet Hein and rediscovered later by John Nash The best Hex artificial players analyse the board positions by deducing complex virtual connections from elementary connections using the H-Search algorithm In this paper, we extend the H-search with a new deduction rule This new deduction rule is capable of discovering virtual connections that the H-search cannot prove Thanks to this new deduction rule, the horizon of the artificial Hex players should move further away.