A* search algorithm: Difference between revisions
Content added Content deleted
(My solution in Common Lisp) |
|||
| Line 657: | Line 657: | ||
{{out}} |
{{out}} |
||
<pre>A*-SEARCH> (search-path) |
<pre>A*-SEARCH> (search-path) |
||
Found the shortest path in 323 steps with cost: 11 |
Found the shortest path from Start (●) to Goal (◆) in 323 steps with cost: 11 |
||
██████████ |
██████████ |
||
█ ▪▪▪▪◆█ |
█ ▪▪▪▪◆█ |
||