The relative history heuristic

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

Volumn 3846 LNCS, Issue , 2006, Pages 262-272

  Winands, Mark H M ^a   Van Der Werf, Erik C D ^a   Van Den Herik, H Jaap ^a   Uiterwijk, Jos W H M ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS; SEARCH ENGINES; TREES (MATHEMATICS);

BUTTERFLY HEURISTIC; RELATIVE HISTORY HEURISTIC; SEARCH TREE;

HEURISTIC METHODS;

EID: 33745198206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11674399_18     Document Type: Conference Paper

References (22)

1. S.G. Akl and M.M. Newborn. The principal continuation and the killer heuristic. In 1977 ACM Annual Conference Proceedings, pages 466-473. ACM, Seattle, USA, 1977.
2. Y. Björnsson and T.A. Marsland. Multi-cut alpha-beta pruning. In H.J. van den Herik and H. Iida, editors, Computers and Games, Lecture Notes in Computing Science 1558, pages 15-24. Springer-Verlag, Berlin, Germany, 1999.
3. D.M. Breuker, J.W.H.M. Uiterwijk, and H.J. van den Herik. Replacement schemes and two-level tables. ICCA Journal, 19(3):175-180, 1996.
4. M. Campbell, A.J. Hoane Jr., and F.-h. Hsu. Deep Blue. Artificial Intelligence, 134(1-2):57-83, 2002.
5. J. Davies. Small-board problems. Go World, 14-16:55-56, 1979.
6. J. Davies. Go in lilliput. Go World, 17:55-56, 1980.
7. C. Donninger. Null move and deep search: Selective-search heuristics for obtuse chess programs. ICCA Journal, 16(3):137-143, 1993.
8. D. Hartmann. Butterfly boards. ICCA Journal, 11(2-3):64-71, 1988.
9. E.A. Heinz. Adaptive null-move pruning. ICCA Journal, 22(3):123-132, 1999.
10. D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293-326, 1975.
11. L. Kocsis. Learning Search Decisions. PhD thesis, Universiteit Maastricht, Maastricht, The Netherlands, 2003.
12. L. Kocsis, J.W.H.M. Uiterwijk, and H.J. van den Herik. Move ordering using neural networks. In L. Montosori, J. Váncza, and M. Ali, editors, Engineering of Intelligent Systems, Lecture Notes in Artificial Intelligence 2070, pages 45-50. Springer-Verlag, Berlin, Germany, 2001.
13. T.A. Marsland and M. Campbell. Parallel search of strongly ordered game trees. Computing Surveys, 14(4):533-551, 1982.
14. S. Sackson. A Gamut of Games. Random House, New York, NY, USA, 1969.
15. J. Schaeffer. The history heuristic. ICCA Journal, 6(3):16-19, 1983.
16. J. Schaeffer. Experiments in Search and Knowledge. PhD thesis, Department of Computing Science, University of Waterloo, Canada, 1986.
17. J. Schaeffer. The history heuristic and the performance of alpha-beta enhancements. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(11):1203-1212, 1989.
18. J. Schaeffer and A. Plaat. New advances in alpha-beta searching. In Proceedings of the 1996 ACM 24th Annual Conference on Computer Science, pages 124-130. ACM Press, New York, NY, USA, 1996.
19. Y. Tsuruoka, D. Yokoyama, and T. Chikayama. Game-tree search algorithm based on realization probability. ICGA Journal, 25(3):132-144, 2002.
20. E.C.D. van der Werf, H.J. van den Herik, and J.W.H.M. Uiterwijk. Solving Go on small boards. ICGA Journal, 26(2):92-107, 2003.
21. M.H.M. Winands, J.W.H.M. Uiterwijk, and H.J. van den Herik. The quad heuristic in Lines of Action. ICGA Journal, 24(1):3-15, 2001.
22. M.H.M. Winands, H.J. van den Herik, J.W.H.M. Uiterwijk, and E.C.D. van der Werf. Enhanced forward pruning. Information Sciences, 175(4):258-272, 2005.