Skip to content

Chapter 5: Move figure to the correct question 18 and fix sub-exercise reference #519

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Chapter 5: Move figure to the correct question 18 and fix sub-exercise reference #519

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
35bab98
Move figure from question 17 to 18
FlorianMittag Jun 21, 2022
91efd8a
Move figure from question 17 to 18
FlorianMittag Jun 21, 2022
1bcbe1c
Fixed reference to sub-exercise
FlorianMittag Jun 21, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 0 additions & 6 deletions markdown/5-Adversarial-Search/exercises/ex_17/question.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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?<br>


<figure>
<img src="https://aimacode.github.io/aima-exercises/figures/pruning.svg" alt="trivial-chance-game-figure" id="trivial-chance-game-figure" style="width:100%">
<figcaption><center><b>The complete game tree for a trivial game with chance nodes..</b></center></figcaption>
</figure>
28 changes: 12 additions & 16 deletions markdown/5-Adversarial-Search/exercises/ex_18/question.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,23 +1,19 @@


This question considers pruning in games with chance nodes.
Figure <a class="insideExerciseFigRef" href="#trivial-chance-game-figure">trivial-chance-game-figure</a> 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$.<br>
Figure <a class="insideExerciseFigRef" href="#trivial-chance-game-figure">trivial-chance-game-figure</a> 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$.<br>

1. Copy the figure, mark the value of all the internal nodes, and
indicate the best move at the root with an arrow.<br>
1. Copy the figure, mark the value of all the internal nodes, and indicate the best move at the root with an arrow.<br>

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.<br>
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.<br>

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?<br>
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?<br>

4. Circle all the leaves that need not be evaluated under the
assumption in (c).<br>
4. Circle all the leaves that need not be evaluated under the assumption in (3).<br>

<figure>
<img src="https://aimacode.github.io/aima-exercises/figures/pruning.svg" alt="trivial-chance-game-figure" id="trivial-chance-game-figure" style="width:100%">
<figcaption><center><b>The complete game tree for a trivial game with chance nodes..</b></center></figcaption>
</figure>