what is uniform cost search
- Strategy: expand a cheapest node first
- Implementation: fringe is a priority queue (priority: cumulative cost)
- Properties: (if the solution cost C* and arc costs at least πΊ β effective depth is roughly C*/πΊ
- Time complexity: \\(O(b^{C*/πΊ})\\)
- Space complexity: \\(O(b^{C*/πΊ})\\)
- Complete: yes (if C* and πΊ are finite and positive)
- Optimal: yes
- pic
- Good?
- complete & optimal
- Bad?
- explore options in every direction
- no info about goal location