I like this author's work on fast game structures for Lisp, shows what you can do if you're willing to do a bit of work on explicit types and so on. It's not obvious from the readme but the trivial-benchmark code includes details like time spent in the garbage collector (0 for this) and memory allocated, not just wall clock time. If he wants to do more interesting benchmarks, a standard set to use includes <a href="https://movingai.com/benchmarks/grids.html" rel="nofollow">https://movingai.com/benchmarks/grids.html</a> which includes some maps from real games.<p>It's quite a bit faster than my Lisp version, at least, though mine's an unoptimized (lots of lists) incompletely ported C++ version. Tempted to dig out the C++ version and compare since it was pretty fast... I originally ported it to make a joke about a vtuber's long neck: <a href="https://pbs.twimg.com/media/FAJQkskVQAoiGlT?format=png&name=orig" rel="nofollow">https://pbs.twimg.com/media/FAJQkskVQAoiGlT?format=png&name=...</a> (Edit: screenshot from C++ version: <a href="https://www.thejach.com/imgs/visibility_with_astar.png" rel="nofollow">https://www.thejach.com/imgs/visibility_with_astar.png</a> Note how the shorter path would be going through the central chamber, but visibility is high there, so it goes down the corridors. Original had lots of extra features like fog of war, visibility tests/terrain analysis, smoothing and rubber-banding, a Floyd-Warshall implementation...)
I love seeing highly optimized Common Lisp code like this.<p>I implemented A* in Common Lisp for my Springer Verlag AI book (1998), so a bit of nostalgia for me.<p>SBCL is really an amazing ecosystem and I argue that it is a great example of the power of open source.