Multi-Prob Cut: Difference between revisions

Revision as of 19:56, 28 August 2017

Revision as of 09:37, 1 September 2017

Line 1:

{{Multiple issues|{{technicalcontext|date=August 2017}}{{contexttechnical|date=AugustAugust2017}}{{unreferenced|date=July 2017}}}}

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

[[Category:Game artificial intelligence]]

{{uncatstub|date:july 2017|date=July 2017}}

[[Category:Heuristics]]

[[Category:Search algorithms]]

{{algorithm-stub}}