Heuristique admissible

Domaine

Vocabulary
Coulombe

Français

heuristique admissible

heuristique recevable

heuristique conservatrice

Source: https://fr.wikipedia.org/wiki/Algorithme_A*

Anglais

Admissible heuristic

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. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.[1]