diff --git a/games.ipynb b/games.ipynb index e51a0a2bc..1dc5f5ca9 100644 --- a/games.ipynb +++ b/games.ipynb @@ -197,7 +197,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "" + "" ] }, { diff --git a/images/fig_5_2.png b/images/fig_5_2.png new file mode 100644 index 000000000..872485798 Binary files /dev/null and b/images/fig_5_2.png differ diff --git a/images/fig_5_2.svg b/images/fig_5_2.svg deleted file mode 100644 index 4f53217f1..000000000 --- a/images/fig_5_2.svg +++ /dev/null @@ -1,662 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - MAX - MIN - 3 - - - a1 - a3 - a2 - b1 - b2 - b3 - c1 - c2 - c3 - d1 - d2 - d3 - 3 - 2 - 2 - 2 - 5 - 14 - 6 - 4 - 2 - 8 - 12 - 3 - - Figure 5.2 A two-ply game tree. The Δ nodes are "MAX nodes", in which it is MAX'sturn to move, and the ∇ nodes are "MIN nodes." The terminal nodes show the utility valuesfor MAX; the other nodes are labeled with their minimax values. MAX's best move at the rootis a1, because it leads to the state with the highest minimax value, and MIN's best reply is b1,beacuse it leads to the state with the lowest minimax value. - - - - - - - - - - - - - - - - - - A - B - C - D - - - - - - - -