Solving 8x8 Hex
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 505-509.
Abstract
Using efficient methods that reduce the search space, we design an algorithm strong enough to solve all 8x8 Hex openings.Philip Henderson, Broderick Arneson, Ryan B Hayward
Philip Henderson, Broderick Arneson, and Ryan B. Hayward. 2009. Solving 8x8 Hex. In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09. IJCAI, 505–509. https://ijcai.org/proceedings/2009/91
Henderson, P., Arneson, B., & Hayward, R. B. (2009). Solving 8x8 Hex. In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 (pp. 505–509). IJCAI. https://ijcai.org/proceedings/2009/91
@inproceedings{ijcai2009p91,
title = {Solving 8x8 Hex},
author = {Henderson, Philip and Arneson, Broderick and Hayward, Ryan B.},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {505--509},
year = {2009},
url = {https://ijcai.org/proceedings/2009/91},
}
TY - CPAPER TI - Solving 8x8 Hex AU - Henderson, Philip AU - Arneson, Broderick AU - Hayward, Ryan B. T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 505 EP - 509 UR - https://ijcai.org/proceedings/2009/91 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: