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

Philip Henderson; Broderick Arneson; Ryan B. Hayward

Conference Proceedings

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

Henderson P
Arneson B
Hayward R

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6048 LNCS 88-98

DOI: 10.1007/978-3-642-12993-3_9

5Citations

10Readers

Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Henderson, P., Arneson, B., & Hayward, R. B. (2010). Hex, braids, the crossing rule, and XH-search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6048 LNCS, pp. 88–98). https://doi.org/10.1007/978-3-642-12993-3_9

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

Abstract

Cite

Register to see more suggestions