K.

RAMAKRISHNAN COLLEGE OF ENGINEERING (AUTONOMOUS)

SAMAYAPURAM, TRICHY - 621 112.

Course Code : UAD1401

Course Name : Artificial Intelligence - I
Year / Semester/Branch : II / IV / AIML
Department : Artificial Intelligence and Data Science
Faculty Name : S. Jagadeeswari
Regulation : R2020
Academic Year : 2022-2023- Even Semester
K. RAMAKRISHNAN COLLEGE OF ENGINEERING (AUTONOMOUS)
SAMAYAPURAM, TRICHY - 621 112.

UNIT - 2
PART A

1 How much knowledge would be required by a perfect program for the problem
of playing chess? Assume the unlimited computing power is available.
Answer
The rules for determining legal moves and some simple control mechanism that
implements an appropriate search procedure. Additional knowledge about such
things as good strategy and tactics could of course help considerably to constrain
the search and speed up the execution of the program.
2 List the criteria to measure the performance of different search strategies.
Answer
o Completeness : Is the algorithm guaranteed to find a solution when there is
one?
o Optimality : Does the strategy find the optimal solution?
o Time complexity : How long does it take to find a solution?
o Space complexity : How much memory is needed to perform the search?
3 What is the significance of Admissible Heuristic?
Admissible heuristic is a scenario where heuristic value is less than or equal to
the actual value
4 Compare A* algorithm with Uniform Cost Search algorithm
1) Both A* algorithm and Uniform Cost search are greedy algoithms
2) Both are optimal algorithms
3) A* algorithm uses heuristic, for example Straight line distance between
Two places in map is a heuristic value for Shortest distance finding, whereas
Uniform cost search algorithm does not use heuristic value
4) Usage of heuristic value makes the A* algorithm to come to the answer
quickly.
5 What is local search in continuous spaces?
Local Search in Artificial Intelligence is an optimizing algorithm to find the
optimal solution more quickly. Local search algorithms are used when we care
only about a solution but not the path to a solution.
6 List the criteria to measure the performance of different search strategies.
Completeness. Completeness is a guarantee of finding a solution whenever one
exists.
Time Complexity. Time complexity is how long does it take to find a solution
and this is usually measured in terms of the number of nodes that the searching
technique expands.
Space Complexity.
Optimality.
7 What is simulated annealing?
Simulated annealing is a method for solving unconstrained and bound-
constrained optimization problems. The method models the physical process of
heating a material and then slowly lowering the temperature to decrease defects,
thus minimizing the system energy.
 K. RAMAKRISHNAN COLLEGE OF ENGINEERING (AUTONOMOUS)
SAMAYAPURAM, TRICHY - 621 112.

8 Differentiate informed search and uninformed search.

Basis of Informed search Uninformed search
comparison

Basic Uses knowledge to find the No use of knowledge

knowledge steps to the solution.

Efficiency Highly efficient as Efficiency is mediatory

consumes less time and
cost.

Cost Low Comparatively high

Performance Finds the solution more Speed is slower than the

quickly. informed search.

Algorithms Heuristic depth-first and Depth-first search,

breadth-first search, and breadth-first search, and
A* search lowest cost first search
9 Identify the conditions for optimality.
i) Admissible
ii) Consistency
10 Define Belief state with an example.
A belief state encapsulates the beliefs an agent has about its current state: that
is, probability distributions for each variable within the state.
Example, an outside delivery robot could learn general knowledge about a
particular city.
11 What is the difference between Simple Hill Generate and Test
algorithm Climbing [ MAY / JUNE 2016 ]
The key difference between Simple Hill Climbing and Generate and Test
algorithm is the use of an evaluation function as a way to inject
task-specific knowledge into the control process.
12 What is Local Maxima?
local maxima is a state that is better than all its neighbor but is not better than
some other states father away. At local maxima all the moves appear to make
things worse. Local maxima are particularly frustrating because they often
occur almost within sight of a solution. In this case they are called foothills.
13 What is a plateau?
It is a flat area of the search space in which a whole set of neighboring states
have the same value. On a plateau it is not possible to determine the best
direction in which to move by making local comparisons.
14 What is a Ridge? [ M
A ridge is a special kind of local maximum. It is an area of the search space
that is higher than surrounding area and that itself has a slope.
 K. RAMAKRISHNAN COLLEGE OF ENGINEERING (AUTONOMOUS)
SAMAYAPURAM, TRICHY - 621 112.

Part B

1 Identify the possible solution for nondeterministic Vacuum cleaner problem and
Construct AND - OR search tree, TRY, TRY again tree for it.
2 Solve the following problem using
i) Best First search
ii) Greedy Best First Search

3 Calculate the shortest path from Arad to Bucharest using Memory bound
Heuristic search.

4 Construct the state space diagram for the given 8 – puzzle problem and also
calculate the admissible heuristic value for it.
 K. RAMAKRISHNAN COLLEGE OF ENGINEERING (AUTONOMOUS)
SAMAYAPURAM, TRICHY - 621 112.

5 Apply Uniform Cost Search algorithm in the above graph and find the Shortest
distance from Node A to H and path.
Show steps while solving the problems.

6 Goal state and initial state of sliding tile puzzle is given.

Apply an algorithm to find the path that takes you to Goal state. Propose two
heuristic functions for solving the puzzle and compare the performance of both
of them in achieving the goal state. Show the steps.

7 In the below graph, if an Agent’s initial State is A and Goal state is Z, then find
the path an agent finds, if it applies the following. Show steps clearly with
diagram. The edge cost is given near the edges and heuristic cost is given near
the nodes. Apply A* algorithm to find the path from A to Z