Differences

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

--- chess:programming:minimax_algorithm [2021/10/30 22:39] – peter
+++ chess:programming:minimax_algorithm [2021/10/30 22:40] (current) – peter
@@ Line 54: / Line 54: @@
   * Which move you would make as a maximizing player considering that your opponent also plays optimally?
-{{ :chess:programming:minmax.png?600|}}
+{{:chess:programming:minmax.png?400|}}
 Since this is a backtracking based algorithm, it tries all possible moves, then backtracks and makes a decision.
@@ Line 73: / Line 73: @@
 Now the game tree looks like below:
+{{:chess:programming:minmax1.png?400|}}
+The above tree shows two possible scores when maximizer makes left and right moves.
+<WRAP info>
+**NOTE:**  Even though there is a value of 9 on the right subtree, the minimizer will never pick that.
+  * We must always assume that our opponent plays optimally.
+</WRAP>