Before revision: In computer science, specifically in algorithms related to pathfinding , a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e.
After revision: In computer science, specifically in algorithms zArelated to PATHFINDING , a heuristic function is said to be admissible if it znever overestimates the cost of reaching the goal, i.e.