(a) This is solvable by computers. A robot arm can be fitted with a ping pong paddle
and motion sensors to move to wherever the ball is.
(a) All of these searches will find a goal
(b) All of the search methods except depth-first search because if its infinite it will
keep going down.
(c) Breadth-first search will always expand first the shallowest paths, the shortest
Yes (if branching factor b is finite)
Yes if cost = 1 per step
Number of nodes in a b-ary tree of depth d: O(bd)
(d is the depth of the optimal solution)
Space is the bigger problem (more than time)