Home › Per Red Blob Games, an ADMISSIBLE heuristic h(n)…
Per Red Blob Games, an ADMISSIBLE heuristic h(n) satisfies which property?
AAlways returns zero
BNever underestimates the true cost
CAlways equals the true cost
DNever overestimates the true cost
Answer & Solution
Correct answer: D. Never overestimates the true cost
Red Blob Games + standard CS: admissible h(n) ≤ true cost; this guarantees A* finds the optimal path (sound).
Related questions
Per Red Blob Games (movement costs), if some terrain costs MORE to traverse, Dijkstra's alPer Reynolds' Steering Behaviors (commonly cited in game AI), 'SEEK' behaviour produces whIn game AI, a BEHAVIOR TREE typically uses which TWO compositional node types?In game AI design, a FINITE STATE MACHINE (FSM) is best suited for modelling which?In standard game AI literature, a NavMesh (navigation mesh) represents walkable terrain asPer Red Blob Games (Map Representations), a HEX grid offers which advantage over a square Per Red Blob Games, for an 8-direction grid (with diagonals at √2 cost), the recommended hPer Red Blob Games, for a 4-direction grid (no diagonal), the standard heuristic for A* is