This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
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 algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |