Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ahoka
5 months ago
|
parent
|
context
|
favorite
| on:
A* search: optimized implementation in Lisp
I was curious too, so I have ran the included benchmark for a 500x500 matrix and my naive Kotlin A* implementation runs faster on the same input. So what are we missing here?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
