The Butterfly Heuristic is a dynamic move ordering method based on the number of trials of a given move inside the search, irrespectively from the position in which the move has been made, and in opposition to the History Heuristic, irrespectively whether a move fails high or not.
The Butterfly Heuristic was proposed by Dap Hartmann in conjunction with so called Butterfly Boards as a pure thought experiment [2] :
No experiments with real game trees in an actual chess-playing programs have been carried out. The main reason for not doing so lies in the author's notion that this method will be far less effective than the History Heuristic[3]. Still, the main idea of this thought experiment is worth presenting.
Dap Hartmann (1987). How to Extract Relevant Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.ICCA Journal, Vol. 10, No. 1
^Dap Hartmann (1987). How to Extract Relevant Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.ICCA Journal, Vol. 10, No. 1
Table of Contents
Thought Experiment
The Butterfly Heuristic was proposed by Dap Hartmann in conjunction with so called Butterfly Boards as a pure thought experiment [2] :Persistence
Another utilization of Butterfly Boards, as proposed by Hartmann, was to make them persistent, initialized by moves from many Grandmaster and/or Correspondent chess games [4] [5] . Mark Winands at al. assimilated both, Schaeffer's History Heuristic combined with Hartmann's Butterfly Heuristic, and introduced the Relative History Heuristic [6]See also
Publications
External Links
Joe Henderson, George Duke, David Amaro, Ernie Hood, Stanley Clarke, Airto Moreira
References
What links here?
Up one Level