Multi-Prob Cut: Difference between revisions

Content deleted Content added

Revision as of 19:56, 28 August 2017 edit El cid, el campeador (talk \| contribs) Extended confirmed users, New page reviewers, Pending changes reviewers, Rollbackers 27,983 edits Added tags to the page using Page Curation (technical, context) ← 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
(15 intermediate revisions by 7 users not shown)
Line 1: #REDIRECT [[Computer Othello]] ~~{{Multiple issues\|{{technical\|date=August 2017}}{{context\|date=August 2017}}}}~~ {{Rcat shell\|1= {{R from merge}} ~~{{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. ~~{{uncatstub\|date:july 2017\|date=July 2017}}~~ ~~{{algorithm-stub}}~~