As we covered in the lecture, the A* search algorithm is optimal given an admissible heuristic, while the GBFS is not, which means A* will find a solution with a lower cost. In which of the following scenarios would it still make sense to use GBFS? Why?, To solve a small maze with many obstacles, To solve a very big maze in real-time, As we covered in the lecture, the A* search algorithm is optimal given an admissible heuristic, while the GBFS is not, which means A* will find a solution with a lower cost. In which of the following scenarios would it still make sense to use GBFS? Why?, To solve a small maze with many obstacles, To solve a very big maze in real-time

Leaderboard

Visual style

Options

Switch template

Continue editing: ?