I was thinking of a case where an IDS (Iterative Deepening Tree) always performs worse than a DFS (Depth-First Search). I have seen on numerous sources the example of a linked list(i.e. each node has 1 child), but I had a different solution that I think works, but am not too sure about, so I am here to ask for confirmation.

My idea is to have a tree like this: [enter image description here](https://i.stack.imgur.com/VLvW7.png) (Excuse me for my poor drawing skills). Essentially my thought process was that since an IDA goes through depth 1 -> 2 -> 3 to get the answer, it will iterate through all nodes multiple times, while an DFS finds the answer on its first try.

Would this work as an example where IDS performs worse than a DFS?

Thanks a lot! :)



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.