Changes

Jump to: navigation, search

Fail-Hard

1,546 bytes added, 09:41, 3 May 2018
Created page with "'''Home * Search * Alpha-Beta * Fail-Hard''' '''Fail-Hard''' is a term related to an Alpha-Beta like search, to make Alpha and Beta..."
'''[[Main Page|Home]] * [[Search]] * [[Alpha-Beta]] * Fail-Hard'''

'''Fail-Hard''' is a term related to an [[Alpha-Beta]] like [[Search|search]], to make [[Alpha]] and [[Beta]] '''hard''' [[Bound|bounds]] of the returned value of the search. Even [[Terminal Node|terminal nodes]] which indicate draw or mate scores are supposed to be adjusted on the hard alpha-beta bounds.

=Fail-Hard Condition=
[[Alpha]] <= [[Score]] <= [[Beta]]

=See also=
* [[Fail-Soft]]
* [[Fail-High]]
* [[Fail-Low]]
* [[Principal Variation Search]]

=Forum Posts=
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=136488 Fail-soft or Fail-hard ?] by [[Teerapong Tovirat]], [[CCC]], November 04, 2000 » [[Fail-Soft]]
* [https://www.stmintz.com/ccc/index.php?id=363710 Fail-hard, fail-soft question] by [[Dan Honeycutt]], [[CCC]], May 06, 2004
==2005 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=24954 fail soft vs fail hard] by [[Matthew Lai|cyberfish]], [[CCC]], November 19, 2008
* [http://www.talkchess.com/forum/viewtopic.php?t=30333 Return eval or upper bound?] by [[John Merlino]], [[CCC]], October 26, 2009
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=48274 First post (and FailHigh question!)] by [[Natale Galioto]], [[CCC]], June 14, 2013 » [[Fail-High]], [[Fail-Soft]]
* [http://www.talkchess.com/forum/viewtopic.php?t=51284 Fail soft vs fail hard] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], February 15, 2014 » [[Fail-Soft]], [[Fail-Low]], [[Internal Iterative Deepening]]

'''[[Alpha-Beta|Up one Level]]'''

Navigation menu