Scribd
Upload
144 views8 pages

AI - AI417DE01 Lab - Week 09-22102363

This document discusses a game involving Kirby choosing doors and juice bottles. Kirby must choose a door, then King Dedede chooses a box for Kirby. Kirby then chooses a juice bottle. The document asks how Kirby and King Dedede should play to maximize or minimize Kirby's expected juice. It also discusses alpha-beta pruning for this game tree.

Uploaded by

thinhbui1907
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
144 views8 pages

AI - AI417DE01 Lab - Week 09-22102363

This document discusses a game involving Kirby choosing doors and juice bottles. Kirby must choose a door, then King Dedede chooses a box for Kirby. Kirby then chooses a juice bottle. The document asks how Kirby and King Dedede should play to maximize or minimize Kirby's expected juice. It also discusses alpha-beta pruning for this game tree.

Uploaded by

thinhbui1907
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Artificial Intelligence_AI417DE01 – Week 09 – Individual Work

Name:Bùi Tiến Thịnh


Student ID:22102363
Deadline: 11:59pm 27/05/2024 – by submitting into dropbox on E-Learning system
File name format: AI_AI417DE01 Lab – Week 09 – StudentID.docx (or .pdf or .zip)

Questions:
A. Kirby is participating on a game show with his enemy, King Dedede! First, Kirby chooses one of three
doors, behind each of which sit two boxes. King Dedede chooses one of the two boxes to give to Kirby.
Each box contains two transparent juice bottles, of which Kirby chooses one to enjoy for himself.
The bottles are filled up to different amounts, ranging from 0 (completely empty) to 10 (completely full),
inclusive.

1. For this subpart, we assume that Kirby is fully aware of the juice in each bottle, the bottles in each
box, and the boxes behind each door. Shown below is the resulting game tree:

a. Fill out the values on the game tree. Which door should Kirby choose?

AB(7) EF(6) IJ(6)


CD(9) GH(7.5) KL(8)
Door1(7) Door2(6) Door3(6)
==> choose 7

b. Which terminal nodes are never explored as a consequence of pruning?


2. King Dedede changes the rules, and now Kirby must be blindfolded immediately after choosing a
door. As a result, Kirby chooses a bottle randomly from any box with uniform probability. The
resulting game tree is almost exactly the same as before, except that the bottom-most layer of
maximizer nodes are now replaced with chance nodes.

a. Fill out the values on the game tree. Which door should Kirby choose?
AB(5) EF(4) IJ(5.5)
CD(6.5) GH(4.25) KL(4)
Door1(5) Door2(4) Door3(4)
==> choose 5
b. Which terminal nodes are never explored as a consequence of pruning?
Đi từ trái sang phải, từ trên xuống dưới
Note>=5
Door 2 max là 4 => cắt 1, 7.5
Door 3 max là 5.5 , nhánh phải tối đa là 5 nên bỏ nhánh 8

3. King Dedede wants to guarantee that, assuming Kirby plays the game optimally, his expected juice
utility is minimized. How might King Dedede rearrange the juice bottles in the boxes to ensure this?
Indicate your answer by filling in the terminal nodes of the empty game tree below (for your
convenience, a couple nodes have already been filled out for you).
Leaf node values (copied from previous question’s leaf nodes): 7, 3, 9, 4, 6, 2, 1, 7.5, 5, 6, 0, 8
B. GAME:
1. Consider the following game tree where all leaf nodes are between 0 and 10 (inclusive) and both
expectation nodes choose the left branch with chance 0.8.

a. Determine the values of𝑀,𝑁, and the root node.


M=3*0.8 + 9*0.2=4.2
N=0*0.8+5*0.2=1
==> root = 4.2
b. Given the above expectimax problem, which node(s) can be pruned in alpha-beta pruning?
Max= 4.2
Có thể thấy EF là 0 nên không cần xét GH vì sẽ không thể nào vượt qua 4.2
Lưu ý: câu c, d phía dưới là hỏi điểm cộng. Sinh viên có thể chọn không làm
c. Now consider the general case where leaf values can take on any real value between 0 and 10
(inclusive). Do not prune on equality.
What is the maximum number of nodes that can be pruned?

Min(A,B)=x
Min (C,D)=y
Cho M =(x+y)/2

Min(E,F)=u
Min(G,H)= v
Cho N = (u+v)/2
Nếu u <x => cắt G,H

d. Now, let 𝑝 be the probability that each expectation node chooses the left branch, and assume 𝑝
cannot be 0 or 1. For the following game tree shown below (note this is different from the tree
in part 1.), determine the bounds on 𝑝 such that the maximum number of leaf nodes can be
pruned. Recall that probabilities must be between 0 and 1.
?<p<?

You might also like