Multi-Prob Cut: Difference between revisions

Revision as of 07:51, 4 July 2017

Latest revision as of 06:18, 30 March 2020

(17 intermediate revisions by 9 users not shown)

Line 1:

#REDIRECT [[Computer Othello]]

{{unreferenced|date=July 2017}}

{{Rcat shell|1=

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

{{R from merge}}

}}

{{uncatstub|date:july 2017}}

{{algorithm-stub}}