The horizon effect is a problem in artificial intelligence where, in many games, the number of possible states or positions is immense and computers can only feasibly search a small portion of it, typically a few ply down the game tree. Thus, for a computer searching only five ply, there is a possibility that it will make a move which is detrimental, but the detrimental effect is not visible because it does not search to the depth of the error (i.e. beyond its horizon).
When evaluating a large game tree using techniques such as minimax or alpha-beta pruning, search depth is limited for feasibility reasons. However, evaluating a partial tree may give a misleading result. When a significant change exists just over the 'horizon' of the search depth, the computational device falls victim to the horizon effect.
The horizon effect can be mitigated by extending the search algorithm with a quiescence search. This gives the search algorithm ability to look beyond its horizon for a certain class of moves of major importance to the game state, such as captures.
Rewriting the evaluation function for leaf nodes and/or analyzing sufficiently more nodes will solve many horizon effect problems.
Read more about Horizon Effect: Example
Famous quotes containing the words horizon and/or effect:
“The eye is the first circle; the horizon which it forms is the second; and throughout nature this primary figure is repeated without end. It is the highest emblem in the cipher of the world.”
—Ralph Waldo Emerson (1803–1882)
“To say that a man is vain means merely that he is pleased with the effect he produces on other people. A conceited man is satisfied with the effect he produces on himself.”
—Max Beerbohm (1872–1956)