CS827: Adv. Artificial Intelligence

Unit 2: Search and Games (Assignment 2, answers by: A.Aziz Altowayan)


Search Homework 1

Problem 1

Question:

Answer:

Problem 2

Question:

Answer:


Search Homework 2

Solution see fifteen-puzzle.


Games Homework 1

Question:

Answer:

  1. The game tree:

Where,

  1. Yes, from the game tree above we see that she can force a win by picking up 2 coins when she starts the game.

  2. First to guarantee winning, she has to starts by picking 2 coins at the beginning. Then depending on what Bob picks, Alice can win either 3 or 4 coins at max.


Exercise 5.9

Question:

Answer:

a ) factorial(number of possible states), so in this case it would be 9! = 362,880 possible games.

For b), c), d), and e) see the tree below:

For an interactive (clickable) Game Tree, try this, if that does not work. Download this zip file and open game-tree.html locally.