AKakkartik·Apr 26, 2012
Did you apply to YC? (http://github.com/pcottle/LiquidGraph/commit/8cf735f9a5)
In Show HN: A new A.I. Algorithm for Polygonal Mesh Mazespcottle
LiquidGraph
JavaScript2012–2012
pcottle / LiquidGraph
LiquidGraph
Bidirectional 2D draining of water particles
2Distinct people
2Mentions
1Explicit recommenders
43GitHub stars
What to know before exploring
What it is
Bidirectional 2D draining of water particles
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
If you guys are interested, the source is available here: https://github.com/pcottle/LiquidGraph Along with the emotional roller-coaster of commit messages. The source is…
xxbondsxx used a recommendation phrase. One indexed comment matches. This is a phrase match, not a verdict.
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, 1:49:46 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 hour2 dated mentions
Observed mentions: 2012-04-26 21:58:40 UTC to 2012-04-26 23:57:57 UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| Apr 26, 21:00 | 2012-04-26 21:00:00 UTC | 2012-04-26 22:00:00 UTC | 1 | 0 | 1 |
| Apr 26, 22:00 | 2012-04-26 22:00:00 UTC | 2012-04-26 23:00:00 UTC | 0 | 0 | 0 |
| Apr 26, 23:00 | 2012-04-26 23:00:00 UTC | 2012-04-27 00:00:00 UTC | 1 | 0 | 1 |
What Hacker News says
2 sourcesIf you guys are interested, the source is available here:
https://github.com/pcottle/LiquidGraph
Along with the emotional roller-coaster of commit messages. The source is pretty well commented and filled with ASCII diagrams so I tried to make it digestible.
The actual AI algorithm is a standard uniform cost search, but the state exploration function is where the new work is found. I sent out different gravity transitions from each concave vertex to find where you can get to from each state. All the paths you see are parametric equations as well, so there's no error-prone Euler integration used!
Edit: Also, the class lecture videos from this semester are here:
http://itunes.apple.com/us/itunes-u/computer-science-188-001...
if you would like an introduction to AI. It's a great class, I highly recommend it!
In Show HN: A new A.I. Algorithm for Polygonal Mesh Mazes