AI November 2010 Set1

IV B.Tech I Semester Regular Examinations, November 2010
ARTIFICIAL INTELLIGENCE
( ECC )
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. What is 8-puzzle problem? By giving an example explain a stupid move in 8-puzzle
problem. [16]
2. Explain depth first search and breadth first with neat diagrams. [8+8]
3. Explain plateau, ridge, local maximum and global maximum with a suitable dia-
gram. [16]
4. In a chess game assume the average branching factor is 35, and the number of
moves made by each player to win or failure is 50. Estimate size of game tree, with
diagram. What is your conclusion from above game? [16]
5. (a) Give the outline of a knowledge-based agent program
(b) Give rules of inference for propositional logic
(c) Look at the following sentences and decide for each if it is valid, unsatisfiable,
or neither using equivalence rules.
i) (smoke ! fire) ! (¬smoke¬fire)
ii) (smoke ! fire) ! ((smoke ^ heat) ! fire)
[6+6+4]
6. (a) Comment on propositional Vs first-order inference
(b) How can resolution be used to show that a sentence is
i. valid
ii. unsatisfiable
For each of the following pairs of atomic sentences, give the most general uni-
fier if it exists
i. P(A,B,B), P(X,Y,Z)
ii. Q(Y, G(A,B)), Q(G(X,X),Y) [6+6+4]
7. Explain partial-order planning with example. [16]
8. (a) Explain learning with complex data
(b) Explain learning with hidden variables. [8+8]