Multi-Prob Cut: Difference between revisions

Revision as of 03:49, 14 February 2020

Latest revision as of 06:18, 30 March 2020

(10 intermediate revisions by 5 users not shown)

Line 1:

#REDIRECT [[Computer Othello]]

<!-- Please do not remove or change this AfD message until the discussion has been closed. -->

{{Rcat shell|1=

{{Article for deletion/dated|page=Multi-Prob Cut|timestamp=20200214022511|year=2020|month=February|day=14|substed=yes|help=off}}

{{R from merge}}

<!-- Once discussion is closed, please place on talk page: {{Old AfD multi|page=Multi-Prob Cut|date=14 February 2020|result='''keep'''}} -->

}}

<!-- 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]]

[[Category:Heuristics]]

[[Category:Search algorithms]]

{{algorithm-stub}}