An Extension of the H-Search Algorithm for Artificial Hex Players
Rasmussen, Rune K. & Maire, Frederic D. (2004) An Extension of the H-Search Algorithm for Artificial Hex Players. In AI'2004 ; The 17th Australian Computer Society (ACS) Australian Joint Conference on Artificial Intelligence, 6-10 December, 2004, Cairns, Australia.
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.
Impact and interest:
Citation countsare sourced monthly fromand citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Keywords:||Connection game, hex, automatic theorem proving, connection deduction|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > ARTIFICIAL INTELLIGENCE AND IMAGE PROCESSING (080100)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2004 Springer|
|Copyright Statement:||This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via SpringerLink: http://www.springer.de/comp/lncs/ Lecture Notes in Computer Science|
|Deposited On:||23 Jun 2005|
|Last Modified:||29 Feb 2012 23:05|
Repository Staff Only: item control page