diff --git a/markdown/5-Adversarial-Search/exercises/ex_17/question.md b/markdown/5-Adversarial-Search/exercises/ex_17/question.md index 591029839f..e829ca55ab 100644 --- a/markdown/5-Adversarial-Search/exercises/ex_17/question.md +++ b/markdown/5-Adversarial-Search/exercises/ex_17/question.md @@ -8,9 +8,3 @@ search allocated for one move? How many table lookups can you do in the time it would take to do one evaluation? Now suppose the transposition table is stored on disk. About how many evaluations could you do in the time it takes to do one disk seek with standard disk hardware?
- - -
- trivial-chance-game-figure -
The complete game tree for a trivial game with chance nodes..
-
diff --git a/markdown/5-Adversarial-Search/exercises/ex_18/question.md b/markdown/5-Adversarial-Search/exercises/ex_18/question.md index 97fc6ffe46..89dc5eab98 100644 --- a/markdown/5-Adversarial-Search/exercises/ex_18/question.md +++ b/markdown/5-Adversarial-Search/exercises/ex_18/question.md @@ -1,23 +1,19 @@ This question considers pruning in games with chance nodes. -Figure trivial-chance-game-figure shows the complete -game tree for a trivial game. Assume that the leaf nodes are to be -evaluated in left-to-right order, and that before a leaf node is -evaluated, we know nothing about its value—the range of possible values -is $-\infty$ to $\infty$.
+Figure trivial-chance-game-figure shows the complete game tree for a trivial game. +Assume that the leaf nodes are to be evaluated in left-to-right order, and that before a leaf node is evaluated, we know nothing about its value—the range of possible values is $-\infty$ to $\infty$.
-1. Copy the figure, mark the value of all the internal nodes, and - indicate the best move at the root with an arrow.
+1. Copy the figure, mark the value of all the internal nodes, and indicate the best move at the root with an arrow.
-2. Given the values of the first six leaves, do we need to evaluate the - seventh and eighth leaves? Given the values of the first seven - leaves, do we need to evaluate the eighth leaf? Explain - your answers.
+2. Given the values of the first six leaves, do we need to evaluate the seventh and eighth leaves? Given the values of the first seven leaves, do we need to evaluate the eighth leaf? + Explain your answers.
-3. Suppose the leaf node values are known to lie between –2 and 2 - inclusive. After the first two leaves are evaluated, what is the - value range for the left-hand chance node?
+3. Suppose the leaf node values are known to lie between –2 and 2 inclusive. After the first two leaves are evaluated, what is the value range for the left-hand chance node?
-4. Circle all the leaves that need not be evaluated under the - assumption in (c).
+4. Circle all the leaves that need not be evaluated under the assumption in (3).
+ +
+ trivial-chance-game-figure +
The complete game tree for a trivial game with chance nodes..
+