Quiescence search is an algorithm typically used to evaluate minimax game trees in game-playing computer programs. It is a remedy for the horizon problem faced by AI engines for various games like chess and Go.
Read more about Quiescence Search: The Horizon Effect
Famous quotes containing the word search:
“I never found even in my juvenile hours that it was necessary to go a thousand miles in search of themes for moralizing.”
—Horace Walpole (1717–1797)