Table of Contents

Fail-Hard Condition

What links here?

Home * Search * Alpha-Beta * Fail-Hard

Fail-Hard is a term related to an Alpha-Beta like search, to make Alpha and Beta hard bounds of the returned value of the search. Even 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

Forum Posts

2000 ...

Fail-soft or Fail-hard ? by Teerapong Tovirat, CCC, November 04, 2000 » Fail-Soft
Fail-hard, fail-soft question by Dan Honeycutt, CCC, May 06, 2004

2005 ...

fail soft vs fail hard by cyberfish, CCC, November 19, 2008
Return eval or upper bound? by John Merlino, CCC, October 26, 2009

2010 ...

First post (and FailHigh question!) by Natale Galioto, CCC, June 14, 2013 » Fail-High, Fail-Soft
Fail soft vs fail hard by Sergei S. Markoff, CCC, February 15, 2014 » Fail-Soft, Fail-Low, Internal Iterative Deepening

What links here?

Page	Date Edited
Alpha-Beta	Jan 28, 2018
Bound	Jan 25, 2017
Dan Honeycutt	Mar 13, 2014
Dictionary	Aug 24, 2017
Fail-Hard	Dec 2, 2014
Fail-High	Oct 22, 2017
Fail-Low	Jun 23, 2017
Fail-Soft	Jun 2, 2017
Futility Pruning	Aug 30, 2017
Horizon Node	Sep 13, 2016
iCE	Jan 4, 2016
Insomniac	Jan 27, 2016
Internal Iterative Deepening	Feb 5, 2018
John Merlino	Feb 26, 2015
Laser	Dec 27, 2017
Matthew Lai	Dec 6, 2017
Multi-Cut	Jul 4, 2016
Null Move Pruning	Dec 2, 2017
Principal Variation Search	Oct 22, 2017
Quiescence Search	Aug 19, 2017
Quiescent Node	Feb 10, 2017
Sergei Markoff	Mar 12, 2018
Teerapong Tovirat	Oct 21, 2014
Winter	Jan 23, 2018

Up one Level