Abstract
Traditionally, chess has been called the “fruitfly of Artificial Intelligence”. In recent years, however, the focus of game playing research has gradually shifted away from chess towards games that offer new challenges. These challenges include large branching factors and imperfect information. The game of Hex offers some interesting properties that make it an attractive research subject. This paper presents the key ideas behind Queenbee, the first Hex playing program to play at the level of strong human players.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Björnsson. Learning Search Control. Advances in Computer Chess 9, to appear, 2000.
M. S. Campbell, A. J. Hoane, and F. Hsu. Search Control Methods in Deep Blue. AAAI Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, pages 19–23. AAAI Press, 1999.
C. Donninger. Null Move and Deep Search: Selective Search Heuristics for Obtuse Chess Programs. Journal of the International Computer Chess Association, 16(3):137–143, 1993.
S. Even and R. E. Tarjan. A combinatorial problem which is complete in polynomial space. Journal of the Association for Computing Machinery, 23:710–719, 1976.
D. Gale. The Game of Hex and the Brouwer Fixed Point Theorem. American Mathematical Monthly, pages 818–827, 1986.
D. Levy, D. Broughton, and M. Taylor. The Sex Algorithm in Computer Chess. Journal of the International Computer Chess Association, 12(1):10–21, 1989.
T. Marsland. A Review of Game-Tree Pruning. Journal of the International Computer Chess Association, 9(1):3–19, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Rijswijck, J. (2000). Are Bees Better than Fruitflies?. In: Hamilton, H.J. (eds) Advances in Artificial Intelligence. Canadian AI 2000. Lecture Notes in Computer Science(), vol 1822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45486-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-45486-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67557-0
Online ISBN: 978-3-540-45486-1
eBook Packages: Springer Book Archive