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:
“You will never be happy if you continue to search for what happiness consists of. You will never live if you are looking for the meaning of life.”
—Albert Camus (1913–1960)