Multi-Prob Cut

Article
Talk

This is an old revision of this page, as edited by Alvin Seville (talk | contribs) at 09:37, 1 September 2017 (removing and categorizing, including unreferenced tag within multiple issues). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (August 2017) (Learn how and when to remove this message)

This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (August2017) (Learn how and when to remove this message)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Multi-Prob Cut" – news · newspapers · books · scholar · JSTOR (July 2017) (Learn how and when to remove this message)

(Learn how and when to remove this message)

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.

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Multi-Prob_Cut&oldid=798339296"