Home * Search * Alpha-Beta * Fail-Soft

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 [1], John Philip Fishburn introduced Fail-Soft Alpha-Beta as an improvement of Fail-Hard without any extra work [2]. 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 [3], 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


References

  1. ^ John Philip Fishburn (1983). Another optimization of alpha-beta search. SIGART Bulletin, Issue 84, pdf
  2. ^ Jean-Christophe Weill (1991). Experiments With the NegaC* Search - An Alternative for Othello Endgame Search. Heuristic Programming in AI 2
  3. ^ Chrilly Donninger (1993). Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal, Vol. 16, No. 3

What links here?


Up one Level