Multi-Prob Cut: Difference between revisions

Revision as of 09:28, 3 July 2017

Latest revision as of 06:18, 30 March 2020

(20 intermediate revisions by 11 users not shown)

Line 1:

#REDIRECT [[Computer Othello]]

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

{{Rcat shell|1=

{{stubR from merge}}

}}