Multi-Prob Cut: Difference between revisions

Revision as of 03:49, 14 February 2020

Revision as of 09:32, 14 February 2020

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> The Prob Cut heuristic estimates evaluation scores at deeper levels of the search tree using a [[linear regression]] between deeper and shallower scores. Min Prob Cut extends this approach to multiple levels of the search tree. It is of particular interest in games such as [[Othello]] andwhere [[draughts]]there inis whicha thea [[null-movestrong heuristic]]correlation wouldbetween beevaluations problematicscores asat itdeeper isand quiteshallower oftenlevels.<ref anname="Fürnkranz2001">{{cite advantagebook |last1=Fürnkranz |first1=Johannes |title=Machines that learn to passplay games {{!}} Guide books |date=2001 |publisher=Nova Science Publishers, Inc. |___location=Nova Science Publishers, Inc.6080 Jericho Tpke. Suite 207 Commack, NYUnited States |isbn=978-1-59033-021-0 |pages=11-59 |url=https://dl.acm.org/doi/book/10.5555/644391}}</ref>

==References==