Multi-Prob Cut is a heuristic used in Alpha–beta pruning search. It is of particular interest in games such as Othello and Draughts in which the null-move heuristic would be problematic as it is quite often an advantage to pass.
This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Multi-Prob Cut" – news · newspapers · books · scholar · JSTOR (July 2017) (Learn how and when to remove this message) |
Multi-Prob Cut is a heuristic used in Alpha–beta pruning search. It is of particular interest in games such as Othello and Draughts in which the null-move heuristic would be problematic as it is quite often an advantage to pass.
This article is a stub. You can help Wikipedia by expanding it. |