|
The main advantage of DFS is that its storage requirement is linear in the depth of the state space being searched
|
səhifə | 7/23 | tarix | 26.12.2016 | ölçüsü | 0,99 Mb. | | #3369 |
|
The main advantage of DFS is that its storage requirement is linear in the depth of the state space being searched.
States resulting from the first three steps of depth-first search applied to an instance of the 8-puzzle.
Simple backtracking performs DFS until it finds the first feasible solution and terminates. Not guaranteed to find a minimum-cost solution. Uses no heuristic information to order the successors of an expanded node. Ordered backtracking uses heuristics to order the successors of an expanded node.
Depth-First Branch-and-Bound (DFBB) |
|
|