Changes

Jump to: navigation, search

Relative History Heuristic

332 bytes added, 17:48, 19 December 2018
no edit summary
=History Heuristic=
The disadvantage of the history heuristic is that it is biased towards moves that occur more often in a game than others. However, the history heuristic has as implicit assumption that all the legal moves occur roughly with the same frequency in the game (tree). For instance, assume we have a move which is quite successful when applicable (e.g., it then causes a cut-off) but it does not occur so often as a legal move in the game tree. This move will not obtain a high history score and is therefore ranked quite low in the move ordering.
=The Idea=
The idea is to make the history scores (<span style="background-color: #d2d2d2">hhScore</span>) relative to the scores of the [[Butterfly Heuristic|butterfly heuristic]] (<span style="background-color: #d2d2d2">bfScore</span>).
We believe that we can considerably improve the performance of the history heuristic in some games by making it relative instead of absolute: The score used to order the moves (movescore) is given by the following formula:
<pre>
moveScore = hhScore / bfScore;
=Publications=
* [[Mark Winands]], [[Erik van der Werf]], [[Jaap van den Herik]], [[Jos Uiterwijk]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_18 The Relative History Heuristic]''. [[CG 2004]], [http://erikvanderwerf.tengen.nl/pubdown/relhis.pdf pdf]
* [[Jeff Rollason]] ('''2007'''). ''[http://www.aifactory.co.uk/newsletter/2007_01_neg_plausibility.htm Negative Plausibility]''. [[AI Factory]], Spring 2007 <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=7&t=28873 Negative Plausibility Move Ordering] by [[Alessandro Damiani]], [[CCC]], July 09, 2009</ref>
=External Links=
'''[[Move Ordering|Up one Level]]'''
[[Category:Music]]

Navigation menu