Hacker News: 1xtrm0https://news.ycombinator.com/user?id=1xtrm0Hacker News RSShttps://hnrss.org/hnrss v2.1.1Wed, 29 Apr 2026 21:41:04 +0000<![CDATA[New comment by 1xtrm0 in "A* search: optimized implementation in Lisp"]]>The "c++ implementations" are two stack overflow answers. I don't think the comparisons are representative of the performance of implementing A*:

1 - Is an innefficient and obfuscated BFS. It has no heuristics. (The lisp benchmark is using Manhattan distance. You can think of it as comparing walking blindfolded on a maze vs having a GPS that tells you how far you are from the exit)

2 - Is a person claiming numbers on a specific instance of a problem that was tested, without showing any code or details on what heuristics were used

]]>Sat, 03 Aug 2024 13:36:44 +0000https://news.ycombinator.com/item?id=411465461xtrm0https://news.ycombinator.com/item?id=41146546https://news.ycombinator.com/item?id=41146546<![CDATA[ZEHST]]>Article URL: https://en.m.wikipedia.org/wiki/Concord_2.0

Comments URL: https://news.ycombinator.com/item?id=10013299

Points: 1

# Comments: 0

]]>Wed, 05 Aug 2015 22:22:59 +0000https://en.m.wikipedia.org/wiki/Concord_2.01xtrm0https://news.ycombinator.com/item?id=10013299https://news.ycombinator.com/item?id=10013299