Multi-Prob Cut

From HandWiki
Revision as of 05:49, 7 February 2021 by imported>LinuxGuru (change)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.