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. ==The horizon effect== The horizon effect is a problem in artificial intelligence where, in many games, the number of possible states or p...