Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
2 answers
6k views

Why is the space-complexity of greedy best-first search is $\mathcal{O}(b^m)$?

I am reading through Artificial Intelligence: Modern Approach and it states that the space complexity of the GBFS (tree version) is $\mathcal{O}(b^m)$. While I am reading, at some points, I found ...
iRestMyCaseYourHonor's user avatar