It does this by gradually increasing the limit - first 0, then 1, then 2, and so on - until a goal is found. "Iterative deepening search (or iterative deepening depth-first search) is a general strategy, often used in combination with depth-first tree search, that finds the best depth limit. I'm fairly certain that the claim in the introduction – "Unfortunately, current AI texts either fail to mention thisĪlgorithm or refer to it only in the context of two-person game searches" – is no longer true.įrom my current textbook (Artificial Intelligence: A Modern Approach ): The professor remarked that while there have been some optimizations over the last few decades, using them can be quite messy – to the point where the combination of A* and iterative deepening is still commonly used in the field. I recently implemented depth-first iterative deepening in an Artificial Intelligence class project to solve the classic missionaries and cannibals problem.
0 Comments
Leave a Reply.AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |