The Relative History Heuristic

  • Mark H. M. Winands
  • Erik C. D. van der Werf
  • H. Jaap van den Herik
  • Jos W. H. M. Uiterwijk
Conference paper

DOI: 10.1007/11674399_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3846)
Cite this paper as:
Winands M.H.M., van der Werf E.C.D., van den Herik H.J., Uiterwijk J.W.H.M. (2006) The Relative History Heuristic. In: van den Herik H.J., Björnsson Y., Netanyahu N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg

Abstract

In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead of only recording moves which are the best move in a node, we also record the moves which are applied in the search tree. Both scores are taken into account in the relative history heuristic. In this way we favour moves which on average are good over moves which are sometimes best. Experiments in LOA show that our method gives a reduction between 10 and 15 per cent of the number of nodes searched. Preliminary experiments in Go confirm this result. The relative history heuristic seems to be a valuable element in move ordering.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mark H. M. Winands
    • 1
  • Erik C. D. van der Werf
    • 1
  • H. Jaap van den Herik
    • 1
  • Jos W. H. M. Uiterwijk
    • 1
  1. 1.Department of Computer Science, Institute for Knowledge and Agent TechnologyUniversiteit MaastrichtMaastrichtThe Netherlands

Personalised recommendations