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