admissible heuristic (Q4683807)

From Wikidata
Jump to navigation Jump to search
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
  • admissible heuristics
edit
Language Label Description Also known as
English
admissible heuristic
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
  • admissible heuristics

Statements

0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit