When trying to navigate from your house to the movie theater, which search algorithm would likely explore fewer locations before finding the optimal route?
For a heuristic to be "admissible" in A* search (guaranteeing an optimal solution), it must:
In our school route example, what type of heuristic (h) was used to guide the A* search?