Are bees better than fruitflies?: Experiments with a hex playing program

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1822, Issue , 2000, Pages 13-25

  Van Rijswijck, Jack ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Alpha beta; Game playing; Heuristic search; Hex

Indexed keywords

HEURISTIC ALGORITHMS;

ALPHA-BETA; BRANCHING FACTORS; FRUIT FLIES; GAME PLAYING; HEURISTIC SEARCH; HUMAN PLAYERS; IMPERFECT INFORMATION; RESEARCH SUBJECTS;

ARTIFICIAL INTELLIGENCE;

EID: 54949150122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45486-1_2     Document Type: Conference Paper

References (7)

1. Y. Bjornsson. Learning Search Control. Advances in Computer Chess 9, to appear, 2000.
2. 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.
3. C. Donninger. Null Move and Deep Search: Selective Search Heuristics for Obtuse Chess Programs. Journal of the International Computer Chess As-sociation, 16(3):137-143, 1993.
4. 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.
5. D. Gale. The Game of Hex and the Brouwer Fixed Point Theorem. American Mathematical Monthly, pages 818-827, 1986.
6. 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.
7. T. Marsland. A Review of Game-Tree Pruning. Journal of the International Computer Chess Association, 9(1):3-19, 1986.