Government Engineering College, Bhavnagar
Department of Computer Engineering
Assignment-I
Semester: 7 Academic Year: 2022-23
Subject: Artificial Intelligence Subject Code: 3170716
Part 1: 20 Marks [3170716.2]
1. Consider the following facts:•Raghu likes all kinds of food.•Mangoes are fruit.•Cabbage
is not fruit.•All fruits are food.
Represent the above facts using Predicate Logic and use Resolution to prove that
“Raghu likes Mangoes”.
2. Consider the following sentences:
•Raj likes all kinds of food.•Apples are food.•Anything anyone eats and isn’t killed by is
food.•Sachin eats peanuts and is still alive.•Vinod eats everything Sachin eats.
Now, attempt following:
i.Translate these sentences into formulas in predicate logic
ii.Use resolution to answer the question, “What food does Vinod eat?
3. Consider the following sentences:
•Tennis is a game. Chess is a game.•John and Steve are students.•John plays
Tennis.•Steve plays everything that John plays.•Students who play Tennis, do not play
Chess.
i.Translate the above sentences into formulas in Predicate logic
ii.Prove using resolution that “Steve does not play Chess”
Part 2: 20 Marks [3170716.1, 3170716.3, 3170716.4]
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:
(i) 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.
(ii) Solve the same example with the use of alpha-beta pruning.
4. Solve the following crypt arithmetic problem
(i) ABCDE*4=EDCBA
(ii) NOON+MOON+SOON=JUNE
(iii) BASE + BALL =GAMES
5. Apply the A* algorithm for the following graphs:
1.
H(n): S:7, A:6, B:2, C:1, D:0
2.
6. 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.)
Initial state: Goal State:
1 2 3
1 2 3
8 4
7 8 4
6 5 7 6 5
Date of submission: 09/11/2022
Subject Incharge:
Ashish V. Nimavat
Assistant Professor
GEC, Bhavnagar