Differences

This shows you the differences between two versions of the page.

--- chess:programming:alpha-beta_pruning [2021/11/10 22:42] – peter
+++ chess:programming:alpha-beta_pruning [2022/01/06 19:22] (current) – peter
@@ Line 11: / Line 11: @@
 **Beta** is the best value that the minimizer currently can guarantee at that level or above.
+----
+Alpha-beta pruning is most effective on strongly-ordered trees, where the best move is searched first, the second-best move is searched second, and so on up to the worst move which is searched last.
+Conversely, on a tree in the exact opposite order, alpha-beta is no better than naive Negamax Search.
+  * We should therefore endeavour to search the best move first.
+  * Move Ordering will make this possible.
 ----