Scribd
Upload
49 views2 pages

AI Assignment-I 1

This document contains 11 questions related to artificial intelligence concepts. The questions cover topics like game trees, minimax algorithm, alpha-beta pruning, missionaries and cannibals problem, cryptarithmetic problems, 8-puzzle problem, A* search, goal stack planning, hill climbing search method, problem characteristics, depth first search, and state space representation using the water jug problem.

Uploaded by

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

AI Assignment-I 1

This document contains 11 questions related to artificial intelligence concepts. The questions cover topics like game trees, minimax algorithm, alpha-beta pruning, missionaries and cannibals problem, cryptarithmetic problems, 8-puzzle problem, A* search, goal stack planning, hill climbing search method, problem characteristics, depth first search, and state space representation using the water jug problem.

Uploaded by

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

AI

Assignment-I
1. Consider the game tree given in Fig. 1, in which the evaluation function values are shown below
each leaf node for the max player. Assume that the root node corresponds to the minimizing player.
Assume that the search always visits children left-to-right.

Compute the backed-up values computed by the minimax algorithm by writing values at the
appropriate nodes in the tree given. For the game tree given in Fig. 1, which nodes will not be
examined by the alpha-beta pruning algorithm? Show the process of alpha-beta pruning to justify
your answer

2. In the Missionaries and Cannibals Problem, three missionaries and three cannibals must cross a
river using a boat which can carry at most two people, under the constraint that, Number of
cannibals should be lesser than the missionaries on either side. The boat cannot cross the river by
itself with no people on board. For the above mentioned problem, describe state space
representation, actions, start and end state.
3. Solve the Crypt – arithmetic problem with the following constraints. Give solution steps.
Constraints :-
(i) Use decimal arithmetic
(ii) No two letters possess same digit.
CROSS
+ROADS
-------------------------
DANGER
4. Consider the following initial and goal configuration for 8-puzzle problem. Draw the search tree. Apply
A* algorithm to reach from initial state to goal state and show the solution. Consider Manhattan distance
as a heuristic function (i.e. sum of the distance that the tiles are out of place.).

5. Explain goal stack planning in detail


6. Discuss limitations of Hill climbing search method.
7. Analyze following problems with respect to the 7 problem characteristics of AI.
i. 8-puzzle ii. Traveling salesman
8. We have two players: MIN who plays first and can make 4 moves, MAX who plays second and
can make 2 moves. Suppose that after 1 turn, the values of the leaves are as in the figure :

Compute (with the algorithm minimax) the value of the root of the tree, than say which is the
most convenient move for MIN. Then tell with the reason, which parts of the tree are not
generated if we perform an alpha-beta pruning.
9. Discuss hill climbing search method. Also discuss limitations and ways to overcome these
limitations.
10. Explain Depth first search algorithm.
11. Explain state space representation using water jug problem.

You might also like