Difference between revisions of "Fail-Hard"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 27: Line 27:
 
=External Links=
 
=External Links=
 
* [https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning#Pseudocode Alpha–beta pruning from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning#Pseudocode Alpha–beta pruning from Wikipedia]
* [https://www.ics.uci.edu/~eppstein/180a/990202b.html Lecture notes for February 2, 1999  Variants of Alpha-Beta Search] by [[David Eppstein]
+
* [https://www.ics.uci.edu/~eppstein/180a/990202b.html Lecture notes for February 2, 1999  Variants of Alpha-Beta Search] by [[David Eppstein]]
  
 
'''[[Alpha-Beta|Up one Level]]'''
 
'''[[Alpha-Beta|Up one Level]]'''

Latest revision as of 23:11, 31 January 2022

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 ...

2005 ...

2010 ...

2020 ...

External Links

Up one Level