A new result on the complexity of heuristic estimates for the \(A^*\) algorithm (Q1193486)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 64747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new result on the complexity of heuristic estimates for the \(A^*\) algorithm |
scientific article; zbMATH DE number 64747 |
Statements
A new result on the complexity of heuristic estimates for the \(A^*\) algorithm (English)
0 references
27 September 1992
0 references
state-space model of problem solving
0 references
problem relaxation
0 references
\(A^*\) search
0 references
0.8453371524810791
0 references
0.78509521484375
0 references
0.7788087725639343
0 references
0.7773467302322388
0 references
