A* search algorithm: Difference between revisions
=={{header|Racket}}== →stub added
m (→{{header|zkl}}: damn tabs) |
(=={{header|Racket}}== →stub added) |
||
Line 11:
Note: using a heuristic score of zero is equivalent to Dijkstra's algorithm and that's kind of cheating/not really A*!
=={{header|Racket}}==
This code is lifted from: https://jeapostrophe.github.io/2013-04-15-astar-post.html Read that, it's very good.
<lang racket>
</lang>
{{out}}
<pre></pre>
A diagram is also output, but you'll need to run this in DrRacket to see it.
=={{header|Python}}==
| |||