Content deleted Content added
Nominated for deletion; see Wikipedia:Articles for deletion/Multi-Prob Cut. using TW |
Mark viking (talk | contribs) Add primary ref for the algorithm |
||
Line 4:
<!-- End of AfD message, feel free to edit beyond this point -->
{{Multiple issues|{{context|date=August 2017}}{{technical|date=August 2017}}{{unreferenced|date=July 2017}}}}
'''Multi-Prob Cut''' is a heuristic used in [[alpha–beta pruning]] search.<ref name="Buro1997">{{cite journal |last1=Buro |first1=Michael |title=Experiments with Multi-ProbCut and a New High-Quality Evaluation Function for Othello |journal=Games in AI Research |date=1997 |pages=77-96 |url=http://citeseerx.ist.psu.edu/viewdoc/versions?doi=10.1.1.19.1136 |language=en}}</ref> 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.
==References==
{{Reflist}}
[[Category:Game artificial intelligence]]
| |||