25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Search]] * [[Alpha-Beta]] * Aspiration Windows'''
[[FILE:TheNon-EuclideanWindow.JPG|border|right|thumb|The Non-Euclidean Window <ref>[[Arts#GerhardHoehme:Category:Gerhard Hoehme|Gerhard Hoehme]] - The Non-Euclidean Window (1964), mixed technique / wood on canvas, [[Arts#ArtMuseumBochum:Category:Art Museum Bochum|Art Museum]], [https://en.wikipedia.org/wiki/Bochum Bochum], [https://en.wikipedia.org/wiki/North_Rhine-Westphalia North Rhine-Westphalia], [https://en.wikipedia.org/wiki/Germany Germany], part of [[:Category:Industrial Heritag Heritage Trail|The Industrial Heritage Trail]] of the [https://en.wikipedia.org/wiki/Ruhr Ruhr area], Photo by [[Gerd Isenberg]], October 30, 2016</ref> ]]
'''Aspiration windows''' are a way to reduce the [[Search Space|search space]] in an alpha-beta search. The technique is to use a guess of the expected value (usually from the last iteration in [[Iterative Deepening|iterative deepening]]), and use a [[Window|window]] around this as the alpha-beta [[Bound|bounds]]. Because the window is narrower, more beta cutoffs are achieved, and the search takes a shorter time. The drawback is that if the true score is outside this window, then a costly re-search must be made. Typical window sizes are 1/2 to 1/4 of a pawn on either side of the guess.
'''[[Alpha-Beta|Up one level]]'''
[[Category:Industrial Heritag Heritage Trail]]
