sol7 - CS121 Introduction to Artificial Intelligence Winter...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS121 Introduction to Artificial Intelligence Winter 2004 Homework #7 (Adversarial Search, Decision Making under Uncertainty) Out: 2/25/04 — Due: 3/3/04 How to complete this HW: First copy this file; then insert your answers in the file immediately below each question; finally submit the completed file to the submission webpage https://www.stanford.edu/class/cs121/hwsub/hw7.fft before 3/3 at midnight. Note on Honor Code: You must NOT look at previously published solutions of any of these problems in preparing your answers. You may discuss these problems with other students in the class (in fact, you are encouraged to do so) and/or look into other documents (books, web sites), with the exception of published solutions, without taking any written or electronic notes. If you have discussed any of the problems with other students, indicate their name(s) here: ……………………………………………………………………………………………… Any intentional transgression of these rules will be considered an honor code violation. General information: In the following, whenever an explanation is required (“Why?”), there will not be full-credit without an explanation. Keep explanations short and to the point. Excessive verbosity will be penalized. If you have any doubt on how to interpret a question, either tell us in advance, so that we can help you understand the question, or tell us how you understand it in your returned solution. Grading: Problem # Max. grade Your grade I 5 II 5 III 5 IV 5 Total 20 I. (5 points) Consider a two-player game with observable states and no randomness, like tic-tac-toe. The two players are MAX and MIN. MIN chooses his moves with a classical
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
minimax algorithm that constructs a game tree at fixed depth d and uses the evaluation function e min . MAX knows this, i.e., he knows both d and e min , but he does not know how MIN breaks ties, if any. He also has greater computational power than MIN; so, when it is his turn to play, he constructs a game tree of depth d +1. MAX has an evaluation function e max that he believes is better than e min . Propose a modification of the minimax algorithm that MAX could use to exploit both his greater computational power and his knowledge of how MIN chooses his own moves. Briefly justify the modification. Answer:
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/23/2011 for the course ENCS ENCS5 taught by Professor Abdelsalam during the Spring '10 term at Birzeit University.

Page1 / 5

sol7 - CS121 Introduction to Artificial Intelligence Winter...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online