Difference between revisions of "Fail-Soft"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 43: Line 43:
 
* [https://www.stmintz.com/ccc/index.php?id=487414 Fail Soft question] by [[David B. Weller]], [[CCC]], February 17, 2006
 
* [https://www.stmintz.com/ccc/index.php?id=487414 Fail Soft question] by [[David B. Weller]], [[CCC]], February 17, 2006
 
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6665 Search questions] by [[Sven Schüle]], [[Computer Chess Forums|Winboard Forum]], July 17, 2007 » [[Mate Distance Pruning]], [[Principal Variation Search]]
 
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6665 Search questions] by [[Sven Schüle]], [[Computer Chess Forums|Winboard Forum]], July 17, 2007 » [[Mate Distance Pruning]], [[Principal Variation Search]]
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=21627 Returning score] by [[Fermin Serrano]], [[CCC]], June 05, 2008
 
* [http://www.talkchess.com/forum/viewtopic.php?t=24560 mate detetion issue] by [[Mike Adams]], [[CCC]], October 24, 2008 » [[Checkmate]], [[Connect Four]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=24560 mate detetion issue] by [[Mike Adams]], [[CCC]], October 24, 2008 » [[Checkmate]], [[Connect Four]]
 
* [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=24954 fail soft vs fail hard] by [[Matthew Lai|cyberfish]], [[CCC]], November 19, 2008

Latest revision as of 14:32, 16 January 2020

Home * Search * Alpha-Beta * Fail-Soft

Window of Perception [1]

Fail-Soft is a term related to an Alpha-Beta like search. Returned scores might be outside the bounds:

History

In his 1983 paper Another optimization of alpha-beta search [2], John Philip Fishburn introduced Fail-Soft Alpha-Beta as an improvement of Fail-Hard without any extra work [3]. Fail-Soft has the reputation for searching less nodes than Fail-Hard, but might also require some care regarding to search instability issues in conjunction with transposition tables and various pruning-, reduction- and extension techniques.

Mate Scores

In Chrilly Donninger's initial null move pruning implementation there was a deep search extension [4], if the null move was refuted by a mate attack, thus relying on Fail-Soft of a null window search, where many "random" moves may refute the null-move with or without score in the mate range.

See also

Publications

Forum Posts

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

External Links

Lineup: Mike Ratledge, John Marshall, Karl Jenkins, Roy Babbington, Allan Holdsworth
Lineup: Ray Russell, Ian Carr, Brian Smith, Karl Jenkins, John Marshall, Roy Babbington

References

  1. Window of Perception (Jump Start Century 21 and move on) by Dominic01, May 19, 2013, Wikimedia Commons
  2. John Philip Fishburn (1983). Another optimization of alpha-beta search. SIGART Bulletin, Issue 84, pdf
  3. Jean-Christophe Weill (1991). Experiments With the NegaC* Search - An Alternative for Othello Endgame Search. Heuristic Programming in AI 2
  4. Chrilly Donninger (1993). Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal, Vol. 16, No. 3

Up one Level