Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Backtrack programming techniques
Communications of the ACM
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Predicting the performance of IDA* using conditional distributions
Journal of Artificial Intelligence Research
The expected value of hierarchical problem-solving
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
An average-case analysis of branch-and-bound with applications: summary of results
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Depth-first vs. best-first search: new results
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Forward estimation for game-tree search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Flexible and approximate computation through state-space reduction
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
Consider an infinite binary search tree in which the branches have independent random costs. Suppose that we must find an optimal (cheapest) or nearly optimal path from the root to a node at depth n. Karp and Pearl [1983] show that a bounded-lookahead backtracking algorithm A2 usually finds a nearly optimal path in linear expected time (when the costs take only the values 0 or 1). From this successful performance one might conclude that similar heuristics should be of more general use. But we find here equal success for a simpler non-backtracking bounded-lookahead algorithm, so the search model cannot support this conclusion. If, however, the search tree is generated by a branching process so that there is a possibility of nodes having no sons (or branches having prohibitive costs), then the non-backtracking algorithm is hopeless while the backtracking algorithm still performs very well. These results suggest the general guideline that backtracking becomes attractive when there is the possibility of "dead-ends" or prohibitively costly outcomes.