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 redirect has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar redirects, in addition to a stub category. (July 2017) |
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |