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:
“At the ground of all these noble races, the beast of prey, the splendid, blond beast, lustfully roving in search of spoils and victory, cannot be mistaken.”
—Friedrich Nietzsche (1844–1900)