admissible heuristic
(Q4683807)
heuristic that never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path
heuristic that never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path
Language:
Current Data About
admissible heuristic
other details
| aliases |
admissible heuristics |
| description | heuristic that never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path |
External Links
| (P646) |
/m/02r86bg
|
| (P6366) |
2778540635
|