optimal search algorithm (Q7401209)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
an algorithm that finds the solution with the lowest path cost
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | optimal search algorithm |
an algorithm that finds the solution with the lowest path cost |
Statements
1 reference
27 September 2024
The terms locally finite, admissible, and monotonic all aid in the understanding of when A* can be expected to be complete, meaning that it finds a solution, and optimal, meaning that it finds the solution with the lowest path cost. (English)
