Telecharger Cours

Depth-First Iterative-Deepening: An Optimal Admissible Tree Search

An ?intelligent? brute-force search algorithm. Assume S is the set of all possible states ? Use a systematic way to examine each state in S one by one so that .



Download