chess:programming:horizon_effect
Differences
This shows you the differences between two versions of the page.
| chess:programming:horizon_effect [2022/01/06 22:01] – created peter | chess:programming:horizon_effect [2022/01/06 22:02] (current) – peter | ||
|---|---|---|---|
| Line 10: | Line 10: | ||
| * However, evaluating a partial tree may give a misleading result. | * 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. | * When a significant change exists just over the horizon of the search depth, the computational device falls victim to the horizon effect. | ||
| + | |||
| + | ---- | ||
| + | |||
| + | Greedy algorithms tend to suffer from 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 in chess. | ||
| + | |||
| + | Rewriting the evaluation function for leaf nodes and/or analyzing more nodes will solve many horizon effect problems. | ||
| ---- | ---- | ||
| [[Chess: | [[Chess: | ||
chess/programming/horizon_effect.1641506504.txt.gz · Last modified: 2022/01/06 22:01 by peter