Professional Documents
Culture Documents
Artificial Intelligence UNIT-II Question-Bank Informed Searching Techniques
Artificial Intelligence UNIT-II Question-Bank Informed Searching Techniques
UNIT-II Question-Bank
Informed Searching Techniques
-------------------------------------------------------------------------------1) Differentiate Uninformed Search(Blind search) and Informed Search(Heuristic
Search) strategies.
Uninformed or Blind Search
Informed or Heuristic Search
o No additional information
o Uses problem-specific knowledge
beyond that provided in the
beyond the definition of the problem
problem definition
itself.
o Not effective
o More effective
o No information about
number of steps or path cost
/
k
t
2) Define Best-first-search.
Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH
algorithm in which a node is selected for expansion based on the evaluation function f(n ).
Traditionally,the node with the lowest evaluation function is selected for expansion.
.
e
b
u
t
e
s
c
/
/
:
p
t
t
h
http://csetube.weebly.com/
7) What is A* search?
A* search is the most widely-known form of best-first search. It evaluates the nodes
by combining g(n),the cost to reach the node,and h(n),the cost to get from the node to the
goal:
f(n) = g(n) + h(n)
Where f(n) = estimated cost of the cheapest solution through n.
g(n) is the path cost from the start node to node n.
h(n) = heuristic function
A* search is both complete and optimal.
8) What is Recursive best-first search?
Recursive best-first search is a simple recursive algorithm that attempts to mimic the
operation of standard best-first search,but using only linear space.
9) What are local search algorithms?
Local search algorithms operate using a single current state(rather than multiple
paths) and generally move only to neighbors of that state. The local search algorithms are not
systematic. The key two advantages are (i) they use very little memory usually a constant
amount,and (ii) they can often find reasonable solutions in large or infinite(continuous) state
spaces for which systematic algorithms are unsuitable.
/
k
t
.
e
b
u
t
e
s
c
/
/
:
p
t
t
h
http://csetube.weebly.com/
/
k
t
.
e
b
u
t
e
s
c
/
/
:
p
t
t
h
http://csetube.weebly.com/
/
k
t
.
e
b
each letter in a cryptarithmetic puzzle represent a different digit. For the case ( in Figure given
below), this would be represented as the six-variable constraint Alldiff (F; T; U;W;R;O).
Alternatively, it can be represented by a collection of binary constraints such as
u
t
e
s
c
/
The addition constraints on the four columns of the puzzle also involve several variables and can be
written as
O + O = R + 10 . X1
X1 +W +W = U + 10 . X2
X2 + T + T = O + 10 . X3
X3 = F
whereX1, X2, and X3 are auxiliary variables representing the digit (0 or 1) carried over into
the next column. Higher-order constraints can be represented in a constraint hypergraph, such as
the one shown in Figure (b). The sharp-eyed reader will have noticed that the
/
:
p
t
t
h
(a) A cryptarithmetic problem. Each letter stands for a distinct digit; the aim is
to find a substitution of digits for letters such that the resulting sum is arithmetically correct,
with the added restriction that no leading zeroes are allowed. (b) The constraint hypergraph
for the cryptarithmetic problem, showing the Alldiff constraint as well as the column addition
http://csetube.weebly.com/
/
k
t
.
e
b
u
t
e
s
c
/
/
:
p
t
t
h
Figure 2.19 A two-ply game tree. The nodes are MAX nodes,in which it is MAXs turn to
move,and the
nodes are MIN nodes. The terminal nodes show the utility values for MAX;
the other nodes are labeled with their minimax values. MAXs best move at the root is a1,because it
leads to the successor with the highest minimax value,and MINs best reply is b1,because it leads to
the successor with the lowest minimax value.
http://csetube.weebly.com/
/
k
t
.
e
b
u
t
e
s
c
/
/
:
p
t
t
h
------------------------------------------------------------------------------------------------------------------------
http://csetube.weebly.com/