Multi-Prob Cut: Difference between revisions

Content deleted Content added
AnomieBOT (talk | contribs)
m Dating maintenance tags: {{Uncatstub}}
Added tags to the page using Page Curation (technical, context)
Line 1:
{{Multiple issues|{{technical|date=August 2017}}{{context|date=August 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.