INTRO TO ARTIFICIAL INTELLIGENCE

SEARCH
AHMED EZZAT LABIB
HELWAN UNIVERSITY
 SEARCH BROAD CATEGORIES
• UNINFORMED SEARCH (BLIND SEARCH):
➢ THE TERM MEANS THAT THE STRATEGIES HAVE NO ADDITIONAL INFORMATION ABOUT
STATES BEYOND THAT PROVIDED IN THE PROBLEM DEFINITION.
➢ ALL THEY CAN DO IS GENERATE SUCCESSORS AND DISTINGUISH A GOAL STATE FROM A
NON-GOAL STATE.

• INFORMED SEARCH:
➢ STRATEGIES THAT KNOW WHETHER ONE NON-GOAL STATE IS “MORE PROMISING” THAN
ANOTHER ARE CALLED INFORMED SEARCH OR HEURISTIC.
HEURISTIC SEARCH.

2
 UNINFORMED SEARCH STRATEGIES

• UNINFORMED STRATEGIES USE ONLY THE INFORMATION AVAILABLE IN THE

PROBLEM DEFINITION.
➢ BREADTH-FIRST SEARCH

➢ UNIFORM-COST SEARCH

➢ DEPTH-FIRST SEARCH

➢ DEPTH-LIMITED SEARCH

➢ ITERATIVE DEEPENING SEARCH

3
 UNIFORM COST SEARCH
ANOTHER EXAMPLE
• UNIFORM COST SEARCH IS THE BEST ALGORITHM FOR A SEARCH PROBLEM, WHICH
DOES NOT INVOLVE THE USE OF HEURISTICS.
• UNIFORM COST SEARCH AGAIN DEMANDS THE USE OF A PRIORITY QUEUE. RECALL
THAT DEPTH FIRST SEARCH USED A PRIORITY QUEUE WITH THE DEPTH UPTO A
PARTICULAR NODE BEING THE PRIORITY AND THE PATH FROM THE ROOT TO THE
NODE BEING THE ELEMENT STORED.
• THE PRIORITY QUEUE USED HERE IS SIMILAR WITH THE PRIORITY BEING THE
CUMULATIVE COST UPTO THE NODE.
• UNLIKE DEPTH FIRST SEARCH WHERE THE MAXIMUM DEPTH HAD THE MAXIMUM
PRIORITY, UNIFORM COST SEARCH GIVES THE MINIMUM CUMULATIVE COST THE
MAXIMUM PRIORITY.
 UCS EXAMPLE

C is the initial State

The Goal is to find Z
or L with the lowest
cost 8

Open list: C
 UCS EXAMPLE

Open list: B(2) T(1) O(3) E(2) P(5)

 UCS EXAMPLE

Open list: T(1) B(2) E(2) O(3) P(5)

 UCS EXAMPLE

Open list: B(2) E(2) O(3) P(5)

 UCS EXAMPLE

Open list: E(2) O(3) P(5)

 UCS EXAMPLE

Open list: E(2) O(3) A(3) S(5) P(5) R(6)

 UCS EXAMPLE

Open list: O(3) A(3) S(5) P(5) R(6)

 UCS EXAMPLE

Open list: O(3) A(3) S(5) P(5) R(6) G(10)

 UCS EXAMPLE

Open list: A(3) S(5) P(5) R(6) G(10)

 UCS EXAMPLE

Open list: A(3) I(4) S(5) N(5) P(5) R(6) G(10)

 UCS EXAMPLE

Open list: I(4) P(5) S(5) N(5) R(6) G(10)

 UCS EXAMPLE

Open list: P(5) S(5) N(5) R(6) Z(6) G(10)

 UCS EXAMPLE

Open list: S(5) N(5) R(6) Z(6) F(6) D(8) G(10) L(10)
 UCS EXAMPLE

Open list: N(5) R(6) Z(6) F(6) D(8) G(10) L(10)

 UCS EXAMPLE

Open list: Z(6) F(6) D(8) G(10) L(10)

 UCS EXAMPLE

Open list: F(6) D(8) G(10) L(10)

UCS EXAMPLE

8
 UNIFORM COST SEARCH
ANOTHER EXAMPLE
• FOR MORE INFORMATION ABOUT UC SEARCH YOU CAN WATCH THIS VIDEO.
HTTPS://YOUTU.BE/DRMVK76XQJI
 DEPTH-LIMITED SEARCH

➢ PERFORM DEPTH FIRST SEARCH BUT ONLY TO A PRE‐SPECIFIED DEPTH LIMIT D.

➢ THE ROOT IS AT DEPTH 0. ROOT IS A PATH OF LENGTH 1.
➢ NO NODE REPRESENTING A PATH OF LENGTH MORE THAN D+1 IS PLACED ON
OPEN.
➢ WE “TRUNCATE” THE SEARCH BY LOOKING ONLY AT PATHS OF LENGTH D+1 OR
LESS.
➢ NOW INFINITE LENGTH PATHS ARE NOT A PROBLEM.
➢ BUT WILL ONLY FIND A SOLUTION IF A SOLUTION OF DEPTH ≤ D EXISTS.
DEPTH-LIMITED SEARCH
 ITERATIVE DEEPENING SEARCH
➢ DFS WITH DEPTH BOUND
➢ DEPTH LIMITED SEARCH WITH A SMALL DEPTH LIMIT, IF NO SOLUTION IS
FOUND, INCREMENT THRESHOLD AND REPEAT
➢ FIRST THRESHOLD IS 1
ITERATIVE DEEPENING SEARCH
ITERATIVE DEEPENING SEARCH
ITERATIVE DEEPENING SEARCH
COMPARISON OF SEARCH TECHNIQUES

DFS BFS UCS IDS

Complete N Y Y Y
Optimal N N Y N
Heuristic N N N N
Time bm bd+1 bm bd
Space bm bd+1 bm bd
 INFORMED SEARCHES
➢ BEST-FIRST SEARCH, HILL CLIMBING, BEAM SEARCH, A*, IDA*, RBFS, SMA*
➢ NEW TERMS
➢ HEURISTICS
➢ OPTIMAL SOLUTION
➢ HILL CLIMBING PROBLEMS
➢ NEW PARAMETERS
➢ F(N) = ESTIMATED COST FROM INITIAL STATE TO STATE N
➢ H(N) = ESTIMATED COST (DISTANCE) FROM STATE N TO CLOSEST GOAL
➢ H(N) IS OUR HEURISTIC
➢ ROBOT PATH PLANNING, H(N) COULD BE EUCLIDEAN DISTANCE
➢ 8 PUZZLE, H(N) COULD BE #TILES OUT OF PLACE

➢ SEARCH ALGORITHMS WHICH USE H(N) TO GUIDE SEARCH ARE HEURISTIC SEARCH
ALGORITHMS.
 HEURISTIC

➢ HEURISTIC MEANS A WAY TO EMBED THE KNOWLEDGE WE HAVE IN

OUR PROBLEM-SOLVING SYSTEM
 32 BEST-FIRST SEARCH
INFORMED
➢ A NODE IS SELECTED FOR EXPANSION SEARCH
BASED ON AN EVALUATION FUNCTION, F(N).
➢ THE EVALUATION FUNCTION IS CONSTRUED AS A COST ESTIMATE, SO THE NODE WITH
THE LOWEST EVALUATION IS EXPANDED FIRST.
➢ THE IMPLEMENTATION OF BEST-FIRST GRAPH SEARCH IS IDENTICAL TO THAT FOR
UNIFORM-COST SEARCH EXCEPT FOR THE USE OF F INSTEAD OF G TO ORDER THE
PRIORITY QUEUE.
➢ GIVEN A HEURISTIC FUNCTION, WE CAN USE IT TO SELECT THE MOST PROMISING
PARTIALS ROUTES TO THE GOAL.
➢ MOST BEST-FIRST ALGORITHMS INCLUDE AS A COMPONENT OF F A HEURISTIC FUNCTION,
DENOTED H(N)
 BEST-FIRST SEARCH

➢ IDEA: USE AN EVALUATION FUNCTION F(N) FOR EACH NODE

➢ F(N) PROVIDES AN ESTIMATE FOR THE TOTAL COST.
➢ EXPAND THE NODE N WITH SMALLEST F(N).

➢ IMPLEMENTATION
➢ ORDER THE NODES IN INCREASING ORDER OF COST.

33
 BEST-FIRST SEARCH

➢ COST CAN BE REPRESENTED AS: STRAIGHT LINE DISTANCE TO

DESTINATION

34
EXAMPLE
EXAMPLE
EXAMPLE
EXAMPLE
EXAMPLE
EXAMPLE
EXAMPLE
EXAMPLE
EXAMPLE
COMPARISON OF SEARCH TECHNIQUES

DFS BFS UCS IDS Best

Complete N Y Y Y N
Optimal N N Y N N
Heuristic N N N N Y
Time bm bd+1 bm bd bm
Space bm bd+1 bm bd bm
 BEST-FIRST SEARCH
• REPORT: APPLY THE BEST-FIRST SEARCH ON THE ARAD-BUCHAREST
EXAMPLE IN SLIDE NO. 34 (WRITE THE OPEN LIST TO REACH THE
GOAL AND DRAW A TREE THAT REPRESENT YOUR SOLUTION)

• DEADLINE: 27/10/2023
• THE REPORT MUST BE IN A HAND WRITTEN FORMAT