From Chessprogramming wiki
Revision as of 00:10, 1 February 2022 by GerdIsenberg (talk | contribs)
Jump to: navigation, search

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