G5 AIAI Introduction to AI. Blind Searching. Graham Kendall. Problem Definition - 1. Initial State The initial state of the problem, defined in some suitable manner Operator A set of actions that moves the problem from one state to another. Problem Definition - 1.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
G5AIAIIntroduction to AI
Blind Searching
Graham Kendall
5
4
1
2
3
6
1
8
8
4
7
3
2
7
6
5
1
1
2
4
3
7
4
2
5
5
6
8
7
3
8
6
Initial State
Goal State
x
x
x
x
x
x
x
x
x
………..
o
o
x
x
x
x
o
Blind Searches
Function BREADTH-FIRST-SEARCH(problem) returns a solution or failure
Return GENERAL-SEARCH(problem,ENQUEUE-AT-END)
C
B
C
E
D
G
D
F
E
A
B
C
D
E
F
D
G
E
A
Time and memory requirements for breadth-first search, assuming a branching factor of 10, 100 bytes per node and searching 1000 nodes/second
A
B
G
S
C
10
1
5
5
15
5
Neamt
Odarea
Iasi
Zerind
Vaslui
Fararas
Sibiu
Arad
Timisoara
Rimnicu Vilcea
Urziceni
Hirsova
Lugoj
Pitesti
Bucharest
Mehadia
Eforie
Dobreta
Giurgui
Craiova
On the Romania map there are 20 towns so any town is reachable in 19 steps
In fact, any town is reachable in 9 steps
B = Branching factor
D = Depth of solution
M = Maximum depth of the search tree
L = Depth Limit
G5AIAIIntroduction to AI
End of Blind Searches
Graham Kendall