ConceptAdmissible Heuristic
Admissible Heuristic
In shortest-path search, a heuristic function that never overestimates the true remaining cost, thereby guaranteeing the optimality of the search algorithm.
Timeline (last 90 days)
Oct 22
The admissible heuristic decomposes command cost into a compressed core abstraction and residual movement, strengthened by the necessary activation detours and corner-visit conditions.
Unverified50%