Documente Academic
Documente Profesional
Documente Cultură
Generate-and-test:
Very simple strategy - just keep guessing.
A 6 B
1 2
5 3
D 4 C
Generate-and-test Example
15
1. A - B - C - D
2. A - B - D - C B C D
3. A - C - B - D
4. A - C - D - B C D B D C B
...
D C D B B C
Characteristics
(c)
3. Ridge: local optimum that is caused by
inability to apply 2 operators at once.
A 8
3
F
6 12
S B G K
14 1
Q
5 5 I
L
7
C 2
H
6 J M
Step Node being Children Available Node
expanded Node chosen
6 I KLM All L
Best First Search Vs Hill Climbing
At each step of the BFS search process, we select the most promising of
the nodes we have generated so far.
This is done by applying an appropriate heuristic function to each of
them.
We then expand the chosen node by using the rules to generate its
successors
Similar to Steepest ascent hill climbing with two exceptions:
In hill climbing, one move is selected and all the others are rejected, never to
be reconsidered. This produces the straightline behavior that is
characteristic of hill climbing.
In BFS, one move is selected, but the others are kept around so that they can
be revisited later if the selected path becomes less promising. Further, the
best available state is selected in the BFS, even if that state has a value that is
lower than the value of the state that was just explored. This contrasts with
hill climbing, which will stop if there are no successor states with better
values than the current state.
OR-graph
B 3 C 5 D 1
B 3 C 5 D 1
Step 4 Step 5
E 4 F
A A 6
B C D B 3 C 5 D 1
3 5 1
E F G H E 4 F
G 6 H 5 4 6 5 6
6
A 2 A 1