25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Search]] * [[Alpha-Beta]] * Fail-High'''
[[File:Red Balloon.JPG|border|right|thumb|[[Arts#:Category:Paul Klee|Paul Klee]] - Red Balloon, 1922 <ref>[[Arts#:Category:Paul Klee|Paul Klee]] - Red Balloon, 1922, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Solomon_R._Guggenheim_Museum Solomon R. Guggenheim Museum]</ref>]]
There are two related semantics, if talking of a '''Fail-High''' - inside the [[Search Tree|search tree]] or if using [[Aspiration Windows|aspiration windows]] at the [[Root|root]].
* [http://www.talkchess.com/forum/viewtopic.php?t=30333 Return eval or upper bound?] by [[John Merlino]], [[CCC]], October 26, 2009
==2010 ...==
* [http://www.open-chess.org/viewtopic.php?f=5&t=2220 Fail High nodes] by [[Christian Daley|CDaley11]], [[Computer Chess Forums|OpenChess Forum]], January 14, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=48274 First post (and FailHigh question!)] by [[Natale Galioto]], [[CCC]], June 14, 2013 » [[Fail-Hard]], [[Fail-Soft]]
* [http://www.open-chess.org/viewtopic.php?f=5&t=2726 Why lower bound in fail-high?] by grandsmaster, [[Computer Chess Forums|OpenChess Forum]], September 20, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=55889 Fail low after fail high] by [[J. Wesley Cleveland]], [[CCC]], April 04, 2015 » [[Fail-Low]], [[Search Instability]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65477 cut nodes] by [[Folkert van Heusden]], [[CCC]], October 18, 2017 » [[Node Types#CUT|Cut-Nodes]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=69927 On failing high and finding mates] by [[Vincent Tang]], [[CCC]], February 16, 2019
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=73250 Searching fail highs shallower..] by [[Tom King]], [[CCC]], March 02, 2020
=External Links=
=References=
<references />
'''[[Alpha-Beta|Up one Level]]'''
[[Category:Paul Klee]]
