|
DFBB does not explore paths that are guaranteed to lead to solutions worse than current best solution
|
səhifə | 8/23 | tarix | 26.12.2016 | ölçüsü | 0,99 Mb. | | #3369 |
|
DFBB does not explore paths that are guaranteed to lead to solutions worse than current best solution. On termination, the current best solution is a globally optimal solution.
Simple backtracking might explore a large space before finding this. Iterative deepening sets a depth bound on the space it searches (using DFS). If no solution is found, the bound is increased and the process repeated.
Iterative Deepening A* (IDA*) Uses a bound on the cost of the path as opposed to the depth.
Dostları ilə paylaş:
|
|
|