Question: Given a problem of navigating through a 2 D grid to reach a goal and assuming no obstacles, which of the following heuristics is admissible?
Given a problem of navigating through a D grid to reach a goal and assuming no obstacles, which of the following heuristics is admissible?
The number of turns made so far in the path.
The number of squares in the entirety of the grid.
The number of squares left to reach the goal regardless of direction.
Twice the straightline distance from the current node to the goal.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
