HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
beefsack
go-astar
Go2014–2014
beefsack / go-astar

go-astar

Go implementation of the A* search algorithm

Libraries & SDKs
Explore on GitHubRead Hacker News discussions
2Distinct people
2Mentions
0Explicit recommenders
629GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Go implementation of the A* search algorithm

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by week2 dated mentions

Observed mentions: 2014-05-30 20:26:42 UTC to 2014-07-20 09:53:07 UTC. Weeks start Monday, UTC.

012014-05-26 00:00:00 UTC to 2014-06-02 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsMay 262014-06-02 00:00:00 UTC to 2014-06-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2014-06-09 00:00:00 UTC to 2014-06-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2014-06-16 00:00:00 UTC to 2014-06-23 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsJun 162014-06-23 00:00:00 UTC to 2014-06-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2014-06-30 00:00:00 UTC to 2014-07-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2014-07-07 00:00:00 UTC to 2014-07-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2014-07-14 00:00:00 UTC to 2014-07-21 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJul 14

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
May 262014-05-26 00:00:00 UTC2014-06-02 00:00:00 UTC110
Jun 22014-06-02 00:00:00 UTC2014-06-09 00:00:00 UTC000
Jun 92014-06-09 00:00:00 UTC2014-06-16 00:00:00 UTC000
Jun 162014-06-16 00:00:00 UTC2014-06-23 00:00:00 UTC000
Jun 232014-06-23 00:00:00 UTC2014-06-30 00:00:00 UTC000
Jun 302014-06-30 00:00:00 UTC2014-07-07 00:00:00 UTC000
Jul 72014-07-07 00:00:00 UTC2014-07-14 00:00:00 UTC000
Jul 142014-07-14 00:00:00 UTC2014-07-21 00:00:00 UTC101

What Hacker News says

2 sources
beefsack·Jul 20, 2014
For those who haven't implemented A* before it can be quite an enlightening experience, and actually isn't too difficult once you dive in. It's a good introduction to priority queues too if you haven't played with them before. I threw together an implentation of A* as a library in Go [1] for a game I've been doing, it has automated tests which mock up a game world and check the length of paths with visual output. [1] https://github.com/beefsack/go-astar
In Introduction to A*

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.