Generalized best-first search strategies and the optimality of A* (Q3768428)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized best-first search strategies and the optimality of A* |
scientific article; zbMATH DE number 4026861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized best-first search strategies and the optimality of A* |
scientific article; zbMATH DE number 4026861 |
Statements
Generalized best-first search strategies and the optimality of A* (English)
0 references
1985
0 references
best-first strategies
0 references
branch and bound
0 references
heuristic search
0 references
shortest path algorithms
0 references
0.8396554589271545
0 references
0.8288564085960388
0 references
0.8235488533973694
0 references
0.819625198841095
0 references
