Hex, braids, the crossing rule, and XH-search

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:
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
Year:
2009

Citing 3
Cited 1

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
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

Solving hex: beyond humans

CG'10 Proceedings of the 7th international conference on Computers and games

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present XH-search, a Hex connection finding algorithm. XH-search extends Anshelevich's H-search by incorporating a new Crossing Rule to find braids, connections built from overlapping subconnections.