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
Class type of: heuristic Q4683807

Facts

1 property
Subclass of
heuristic[1]
🏷️ Also known as
en admissible heuristic en admissible heuristics ar إرشادية مقبولة es heuristica admisible es heurística admisible fa اکتشاف قابل قبول he היוריסטיקה קבילה it euristica ammissibile ko 허용적 휴리스틱 uk прийнятна евристика
🔖 Identifiers · 2
Freebase ID
/m/02r86bg
Microsoft Academic ID (discontinued)
2778540635

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Belongs to 1
Subclass of 1
Press Enter · cited answer in seconds

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [1] ↑ . wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). admissible heuristic. Retrieved November 4, 2026, from https://4ort.xyz/entity/admissible-heuristic
MLA “admissible heuristic.” 4ort.xyz Knowledge Graph, 4ort.xyz, 4 Nov. 2026, https://4ort.xyz/entity/admissible-heuristic.
BibTeX @misc{4ortxyz_admissible-heuristic_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{admissible heuristic}}, year = {2026}, url = {https://4ort.xyz/entity/admissible-heuristic}, note = {Accessed: 2026-11-04}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): admissible heuristic — https://4ort.xyz/entity/admissible-heuristic (retrieved 2026-11-04)

Canonical URL: https://4ort.xyz/entity/admissible-heuristic · Last refreshed: