Content deleted Content added
(11 intermediate revisions by 5 users not shown)
#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. 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]]
[[Category:Heuristics]]
[[Category:Search algorithms]]
{{algorithm-stub}}
