25,161
edits
Changes
Created page with "'''Home * Search * Move Ordering * Butterfly Heuristic''' FILE:Xvxi1.jpg|border|right|thumb|240px|Butterfly and Chinese [https://en.wikipedia.org/wiki..."
'''[[Main Page|Home]] * [[Search]] * [[Move Ordering]] * Butterfly Heuristic'''
[[FILE:Xvxi1.jpg|border|right|thumb|240px|Butterfly and Chinese [https://en.wikipedia.org/wiki/Wisteria wisteriaflowers] <ref>by [https://en.wikipedia.org/wiki/Xu_Xi_%28painter%29 Xü Xi] (c.886–c.975), painted around 970 during the early [https://en.wikipedia.org/wiki/Song_Dynasty Song Dynasty], [https://en.wikipedia.org/wiki/Butterfly Butterfly from Wikipedia]</ref> ]]
'''Butterfly Heuristic''',<br/>
a dynamic move ordering method based on the number of trials of a given move inside the [[Search|search]], irrespectively from the position in which the move has been made, and in opposition to the [[History Heuristic]], irrespectively whether a move [[Fail-High|fails high]] or not.
=Thought Experiment=
The Butterfly Heuristic was proposed by [[Dap Hartmann]] in conjunction with so called [[Butterfly Boards]] as a pure thought experiment <ref>[[Dap Hartmann]] ('''1988'''). ''Butterfly Boards''. [[ICGA Journal#11_23|ICCA Journal, Vol. 11, Nos. 2/3]]</ref> :
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]] <ref>[[Jonathan Schaeffer]] ('''1983'''). ''The History Heuristic''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]</ref>. Still, the main idea of this thought experiment is worth presenting.
=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 <ref>[[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.'' [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]</ref> <ref>[[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 2: the Notion of Mobility, and the Work of [[Adriaan de Groot|De Groot]] and [[Eliot Slater|Slater]]''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]</ref> . [[Mark Winands]] at al. assimilated both, [[Jonathan Schaeffer|Schaeffer's]] [[History Heuristic]] combined with Hartmann's Butterfly Heuristic, and introduced the [[Relative History Heuristic]] <ref>[[Mark Winands]], [[Erik van der Werf]], [[Jaap van den Herik]], and [[Jos Uiterwijk]] ('''2006'''). ''The Relative History Heuristic''. [[CG 2006]], [http://www.cs.unimaas.nl/m.winands/documents/relhis.pdf pdf]</ref>
=See also=
* [[Butterfly Boards]]
* [[Countermove Heuristic]]
* [[History Heuristic]]
* [[Late Move Reductions]]
* [[Relative History Heuristic]]
=Publications=
* [[Jonathan Schaeffer]] ('''1983'''). ''The History Heuristic''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[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.'' [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 2: the Notion of Mobility, and the Work of [[Adriaan de Groot|De Groot]] and [[Eliot Slater|Slater]]''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Dap Hartmann]] ('''1988'''). ''Butterfly Boards''. [[ICGA Journal#11_23|ICCA Journal, Vol. 11, Nos. 2/3]]
* [[Dap Hartmann]], [[Peter Kouwenhoven]] ('''1991'''). ''Sundry Computer Chess Topics''. [[Advances in Computer Chess 6]]
* [[Jos Uiterwijk]] ('''1992'''). ''The Countermove Heuristic''. [[ICGA Journal#15_1|ICCA Journal, Vol. 15, No. 1]]
* [[Mark Winands]], [[Erik van der Werf]], [[Jaap van den Herik]], [[Jos Uiterwijk]] ('''2006'''). ''The Relative History Heuristic''. [[CG 2006]], [http://www.cs.unimaas.nl/m.winands/documents/relhis.pdf pdf]
=External Links=
* [https://en.wikipedia.org/wiki/Butterfly Butterfly from Wikipedia]
* [https://en.wikipedia.org/wiki/Heuristic Heuristic from Wikipedia]
* [[Videos#FloraPurim|Flora Purim]] - [https://en.wikipedia.org/wiki/Butterfly_Dreams Butterfly Dreams] (1973), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[Videos#JoeHenderson|Joe Henderson]], [[Videos#GeorgeDuke|George Duke]], [http://davidamaro.com/ David Amaro], [http://oxfordindex.oup.com/view/10.1093/gmo/9781561592630.article.J206900 Ernie Hood], [[Videos#StanleyClarke|Stanley Clarke]], [[Videos#AirtoMoreira|Airto Moreira]]
: {{#evu:https://www.youtube.com/watch?v=0zsb5rMncYU|alignment=left|valignment=top}}
=References=
<references />
'''[[Move ordering|Up one Level]]'''
[[FILE:Xvxi1.jpg|border|right|thumb|240px|Butterfly and Chinese [https://en.wikipedia.org/wiki/Wisteria wisteriaflowers] <ref>by [https://en.wikipedia.org/wiki/Xu_Xi_%28painter%29 Xü Xi] (c.886–c.975), painted around 970 during the early [https://en.wikipedia.org/wiki/Song_Dynasty Song Dynasty], [https://en.wikipedia.org/wiki/Butterfly Butterfly from Wikipedia]</ref> ]]
'''Butterfly Heuristic''',<br/>
a dynamic move ordering method based on the number of trials of a given move inside the [[Search|search]], irrespectively from the position in which the move has been made, and in opposition to the [[History Heuristic]], irrespectively whether a move [[Fail-High|fails high]] or not.
=Thought Experiment=
The Butterfly Heuristic was proposed by [[Dap Hartmann]] in conjunction with so called [[Butterfly Boards]] as a pure thought experiment <ref>[[Dap Hartmann]] ('''1988'''). ''Butterfly Boards''. [[ICGA Journal#11_23|ICCA Journal, Vol. 11, Nos. 2/3]]</ref> :
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]] <ref>[[Jonathan Schaeffer]] ('''1983'''). ''The History Heuristic''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]</ref>. Still, the main idea of this thought experiment is worth presenting.
=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 <ref>[[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.'' [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]</ref> <ref>[[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 2: the Notion of Mobility, and the Work of [[Adriaan de Groot|De Groot]] and [[Eliot Slater|Slater]]''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]</ref> . [[Mark Winands]] at al. assimilated both, [[Jonathan Schaeffer|Schaeffer's]] [[History Heuristic]] combined with Hartmann's Butterfly Heuristic, and introduced the [[Relative History Heuristic]] <ref>[[Mark Winands]], [[Erik van der Werf]], [[Jaap van den Herik]], and [[Jos Uiterwijk]] ('''2006'''). ''The Relative History Heuristic''. [[CG 2006]], [http://www.cs.unimaas.nl/m.winands/documents/relhis.pdf pdf]</ref>
=See also=
* [[Butterfly Boards]]
* [[Countermove Heuristic]]
* [[History Heuristic]]
* [[Late Move Reductions]]
* [[Relative History Heuristic]]
=Publications=
* [[Jonathan Schaeffer]] ('''1983'''). ''The History Heuristic''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[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.'' [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 2: the Notion of Mobility, and the Work of [[Adriaan de Groot|De Groot]] and [[Eliot Slater|Slater]]''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Dap Hartmann]] ('''1988'''). ''Butterfly Boards''. [[ICGA Journal#11_23|ICCA Journal, Vol. 11, Nos. 2/3]]
* [[Dap Hartmann]], [[Peter Kouwenhoven]] ('''1991'''). ''Sundry Computer Chess Topics''. [[Advances in Computer Chess 6]]
* [[Jos Uiterwijk]] ('''1992'''). ''The Countermove Heuristic''. [[ICGA Journal#15_1|ICCA Journal, Vol. 15, No. 1]]
* [[Mark Winands]], [[Erik van der Werf]], [[Jaap van den Herik]], [[Jos Uiterwijk]] ('''2006'''). ''The Relative History Heuristic''. [[CG 2006]], [http://www.cs.unimaas.nl/m.winands/documents/relhis.pdf pdf]
=External Links=
* [https://en.wikipedia.org/wiki/Butterfly Butterfly from Wikipedia]
* [https://en.wikipedia.org/wiki/Heuristic Heuristic from Wikipedia]
* [[Videos#FloraPurim|Flora Purim]] - [https://en.wikipedia.org/wiki/Butterfly_Dreams Butterfly Dreams] (1973), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[Videos#JoeHenderson|Joe Henderson]], [[Videos#GeorgeDuke|George Duke]], [http://davidamaro.com/ David Amaro], [http://oxfordindex.oup.com/view/10.1093/gmo/9781561592630.article.J206900 Ernie Hood], [[Videos#StanleyClarke|Stanley Clarke]], [[Videos#AirtoMoreira|Airto Moreira]]
: {{#evu:https://www.youtube.com/watch?v=0zsb5rMncYU|alignment=left|valignment=top}}
=References=
<references />
'''[[Move ordering|Up one Level]]'''
