Differences

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

--- chess:programming:search:minimax [2021/10/11 22:44] – created peter
+++ chess:programming:search:minimax [2021/10/11 23:33] (current) – peter
@@ Line 1: / Line 1: @@
 ====== Chess - Programming - Search - Minimax ======
+**Minimax** is an algorithm used to determine the score in a zero-sum game after a certain number of moves, with best play according to an evaluation function.
+  * The score of each move is the score of the worst that the opponent can do.
+----
+<code>
+int maxi( int depth ) {
+    if ( depth == 0 ) return evaluate();
+    int max = -oo;
+    for ( all moves) {
+        score = mini( depth - 1 );
+        if( score > max )
+            max = score;
+    }
+    return max;
+}
+int mini( int depth ) {
+    if ( depth == 0 ) return -evaluate();
+    int min = +oo;
+    for ( all moves) {
+        score = maxi( depth - 1 );
+        if( score < min )
+            min = score;
+    }
+    return min;
+}
+</code>
+----
+===== References =====
+http://web.archive.org/web/20120209041607/http://chessprogramming.wikispaces.com/Minimax