Uninformed Search

Question 1

BFS

Answer 1

Use when all actions have same cost
FIFO
Early goal test
Simple binary tree
Time and space complexity: O(b^d)
Exponential complexity - this is bad

Question 2

Dijkstra or Uniform-cost

Answer 2

In computer science it is called Dijkstra
And in AI it is called uniform-cost

Actions have different costs
Time and space complexity b^(d+1)
Same as DFS
Uses priority queue with less cost
cost optimal

Question 3

DFS

Answer 3

not cost-optimal
memory: O(bm)
b- branching factor
m-max depth
Time - proportional to the number of states