Multi-Prob Cut: Difference between revisions

Revision as of 09:44, 3 July 2017

Revision as of 10:04, 3 July 2017

Line 1:

{{unreferenced|date=July 2017}}

'''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.