Time complexity of iterative-deepening-\(A^{*}\) (Q5941316)
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: Time complexity of iterative-deepening-A^* |
scientific article; zbMATH DE number 1635481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time complexity of iterative-deepening-\(A^{*}\) |
scientific article; zbMATH DE number 1635481 |
Statements
Time complexity of iterative-deepening-\(A^{*}\) (English)
0 references
20 August 2001
0 references
problem solving
0 references
heuristic search
0 references
iterative-deepening-A
0 references
time complexity
0 references
branching factor
0 references
heuristic branching factor
0 references
sliding-tile puzzles
0 references
eight puzzle
0 references
fifteen puzzle
0 references
Rubik's Cube
0 references
0.8753812909126282
0 references
0.8230934739112854
0 references
0.8161062002182007
0 references
