Algorithms

Which search algorithms that we have learned so far would successfully Success" here is defined as finding any solution Assume that greedy best-first search and A* search both use the straight-line distance to the goal as the heuristic function (we'll talk about some more realistic heuristic functions later). Select one or more Uniform-cost search A* search Depth-first search Breadth-first search Greedy hest-first search