Professional Documents
Culture Documents
2 Search Uninformed Part2 6up
2 Search Uninformed Part2 6up
A B C
1 5 15
S
A
A B C
1 10 5 15
B G
5 5 S
S G 11
15 5
A B C
C 15
G G
11 10
(a) (b)
Iterative Deepening
Limit = 0
Idea:
Limit = 2
Use an artificial depth cutoff, c.
5 1.5
10 1.2
25 1.08
100 1.02
• Example b = 10, d = 6 then BFS needs 1,111,111 nodes Complete? yes yes no yes yes
and bidirectional search needs only 2,222. ***Note that many of the “yes’s” above have caveats, which
– What does it mean to search backwards from a goal? we discussed when covering each of the algorithms.
– What if there is more than one goal state? (chess).