Multi-Prob Cut: Difference between revisions

Content deleted Content added

Revision as of 09:37, 1 September 2017 edit Alvin Seville (talk \| contribs) Extended confirmed users, Pending changes reviewers 33,089 edits removing and categorizing, including unreferenced tag within multiple issues ← Previous edit		Latest revision as of 06:18, 30 March 2020 edit undo WikiCleanerBot (talk \| contribs) Bots 1,007,823 edits m v2.02b - Bot T5 CW#16 - WP:WCW project (Unicode control characters) Tag: WPCleaner
(14 intermediate revisions by 7 users not shown)
Line 1: #REDIRECT [[Computer Othello]] ~~{{Multiple issues\|{{context\|date=August 2017}}{{technical\|date=August2017}}{{unreferenced\|date=July 2017}}}}~~ {{Rcat shell\|1= '''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. {{R from merge}} }} ~~[[Category:Game artificial intelligence]]~~ ~~[[Category:Heuristics]]~~ ~~[[Category:Search algorithms]]~~ ~~{{algorithm-stub}}~~