frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

You Know GDPR Is Good Based on Who Hates It

https://matduggan.com/you-know-gdpr-is-good-based-on-who-hates-it/
1•latexr•2m ago•0 comments

Making $2.7M a Year Selling Ice in NYC [video]

https://www.youtube.com/watch?v=iGejCONYVjA
1•binyu•2m ago•0 comments

I ran a little experiment: could I make agent memory deterministic

https://www.lorekit.io/blog/agent-memory-data-model
1•mthines•3m ago•0 comments

Adversarial Interoperability

https://www.eff.org/deeplinks/2019/10/adversarial-interoperability
1•orphereus•8m ago•0 comments

"Lead through code" – engineering managers getting squeezed

https://www.youtube.com/watch?v=MPVmV-6O5to
1•lifeisstillgood•9m ago•0 comments

Show HN: Player vs. Computer

https://github.com/Rubinoslaw/Player-vs-Computer/
1•PolishDevelop22•12m ago•0 comments

LuaDB: Lightweight, embeddable, zero-dependency RDBMS written 100% in pure Lua

https://github.com/jncastilho/luadb
1•thunderbong•13m ago•0 comments

How bicycle coaster brakes work (2018)

https://www.dougbarnesauthor.com/2018/06/how-bicycle-coaster-brakes-work.html
1•Vedor•15m ago•0 comments

Rhine Group: Draghi, Collison unite experts for EU competitiveness

https://en.ilsole24ore.com/art/draghi-and-collison-stripe-set-to-boost-growth-in-europe-the-rhine...
2•Lucasoato•21m ago•0 comments

InferenceFS: Never worry about data again (Again)

https://github.com/philipl/inferencefs/
1•linkdd•22m ago•0 comments

Breakscale: Distributed Systems Design Simulator

https://github.com/xevrion/breakscale
1•handfuloflight•24m ago•0 comments

Muraqib, free nightly QA that lets Claude open a fix PR when tests fail

https://github.com/holistis/muraqib
1•Bugintelligence•37m ago•0 comments

Show HN: AgentBridge – Let one AI think while another AI writes the code

https://github.com/IndexFlowing/AgentBridge
2•mandarinclips•46m ago•1 comments

Nepal's flood damage may cost up to a tenth of economy to rebuild

https://www.reuters.com/world/china/nepal-needs-least-4-billion-rebuilding-finance-minister-says-...
2•geox•48m ago•0 comments

Pentagon's blacklisting of Anthropic was unlawful, US judge rules

https://www.theguardian.com/technology/2026/aug/28/us-court-rules-pentagon-anthropic-ban-illegal-...
2•vinni2•48m ago•0 comments

Walkable Cities

https://nartier.itch.io/walkable-cities
2•tehsauce•52m ago•0 comments

Some GitHub bounty repos are honeypots that farm free work from AI agents

https://oactodev.github.io/ninety-quid/report/
1•ninetyquid•53m ago•0 comments

Five ways 3D printing is improving lab work

https://www.nature.com/articles/d41586-026-02535-z
2•zeristor•54m ago•0 comments

Books Turned into Podcast Series

https://bookdialogues.com/home
1•jasmeet0817•56m ago•1 comments

Researcher Tricked Claude, Codex and Hermes into Running Malware

https://startupfortune.com/researcher-alon-hertz-tricked-claude-codex-and-hermes-into-running-mal...
12•CuriousLLM•57m ago•0 comments

SynapticChain: Single-wallet concurrency record (5,307 TPS from 1 key in Rust)

https://explorer.synapticchain.xyz
1•abdulshabazz•1h ago•0 comments

I built a financial visibility layer for multi-model AI applications

https://credlier.com/
1•dcriglerd•1h ago•0 comments

Show HN: Kith – AI clinical notes for therapists from ambient session audio

https://www.kith.space
1•kithmedai•1h ago•0 comments

Is this the DeepSeek moment for Local Models?

https://vijaykodam.substack.com/p/is-this-the-deepseek-moment-for-local
2•vijaykodam•1h ago•0 comments

What GLM-5.3 Flash running on Chinese hardware means

https://martinalderson.com/posts/glm-5-3-flash-chinese-hardware/
1•ymolodtsov•1h ago•0 comments

Lean Explained with TypeScript

https://gruhn.me/blog/2026-08-29/
1•ngruhn•1h ago•0 comments

Changes in MySQL 26.7.0

https://dev.mysql.com/doc/relnotes/mysql/26.7/en/news-26-7-0.html
1•ksec•1h ago•0 comments

Pennpaper – visual, step-by-step explanations for math

https://www.pennpaper.app/
1•brnmwas•1h ago•0 comments

Show HN: Bora Praia – weather and tide forecasts turned into a time to leave

https://borapraia.com/
1•63labs•1h ago•0 comments

Grassmann's Law (Linguistics)

https://en.wikipedia.org/wiki/Grassmann%27s_law
1•ogogmad•1h ago•0 comments
Open in hackernews

Generating Mazes with Inductive Graphs (2017)

https://jelv.is/blog/Generating-Mazes-with-Inductive-Graphs/
20•todsacerdoti•1y ago

Comments

tomfly•1y ago
where is the entrance and exit?
Jaxan•1y ago
Doesn’t matter, because all positions are reachable. So just pick any two positions at the border and remove a wall.
kazinator•1y ago
Here is a maze that was generated recursively starting at the upper left cell.

  +    +----+----+----+----+----+----+----+----+----+
  |    |                        |                   |
  |    |                        |                   |
  +    +----+----+    +----+    +----+    +----+    +
  |              |         |                   |    |
  |              |         |                   |    |
  +----+----+    +    +----+----+----+----+----+    +
  |              |    |                        |    |
  |              |    |                        |    |
  +    +----+----+    +    +----+----+----+    +    +
  |         |              |              |    |    |
  |         |              |              |    |    |
  +    +----+    +    +----+----+----+    +    +----+
  |              |    |                   |    |    |
  |              |    |                   |    |    |
  +----+----+----+    +    +----+----+----+    +    +
  |                        |                   |    |
  |                        |                   |    |
  +    +----+----+----+    +    +----+----+----+    +
  |    |    |              |    |              |    |
  |    |    |              |    |              |    |
  +    +    +    +    +----+    +    +----+    +    +
  |    |    |    |    |         |    |         |    |
  |    |    |    |    |         |    |         |    |
  +    +    +    +    +----+----+----+    +    +    +
  |    |    |    |    |                   |         |
  |    |    |    |    |                   |         |
  +    +    +----+    +    +----+----+    +----+----+
  |              |         |                        |
  |              |         |                        |
  +----+----+----+----+----+----+----+----+----+    +

It matters to start there because it will be easier if you go backwards.

The maze has 100 cells. For each cell, we can calculate which exit goes back toward the entrance, assigning the letters U, D, L, R:

  U R R D L L R D L L
  U L L D L U L L L U
  R R U D D L L L L U
  U L D L L R R D U U
  U L L U D L L L U D
  R R R U L R R R U D
  U D R R U U R R D D
  U D U U R U U D L D
  U D U U D L L L U L
  U L L U L R R U L L
Stats:

  L - 33
  U - 29
  R - 20
  D - 18
Left and Up are more frequent back-to-entrance escapes than Right or Down. This is because of the way the maze was generated.

To check the hypothesis, we should analyze it in the other direction. For each cell, determine the exit which heads in the direction of the exit:

  D R R D L L R D L L
  D R D D L U L L L U
  D L L D D L L L L U
  D L R D L R R D D U
  R R U D D L L L U D
  R R R R D R R R U D
  U D R D L U R R D D
  U D U D R U U D L D
  U D U D R R R D U L
  U L L R U R R R R D
Stats:

  D - 30
  R - 28
  L - 24
  U - 18
There is a weaker bias for the D-R axis toward the exit, compared to the L-U axis toward the entrance. I suspect if we study larger numbers of larger mazes, we will find similar findings.

So that is to say, it is easier to navigate the maze in the reverse direction: the heuristic to try left/up exits will work more often than the right/down in the proper direction.

smartmic•1y ago
From the book "Mazes for Programmers" by Jamis Buck, 2015, The Pragmatic Programmers (a must-read for any maze/programming enthusiast!):

> Aren't mazes supposed to have starting points and end points? […] honestly, […] it's entirely up to you. […] The maze […] is a perfect maze, and one of the attributes of a perfect maze is that there exists exactly one path between any two cells in it. […] You pick them, and there's guaranteed to be a path between them.

You do not need to choose an entrance or exit only on the sides, but you can also choose "Pacman-style" where the goal is to reach points inside the maze.

"Perfect" refers to the mathematical/logical properties of a maze (i.e. no loops), not the aesthetical aspect. I have not checked though if the mazes in the source here are all perfect.

kazinator•1y ago
While you can put the entrance and exit wherever you want, if you know that the maze was generated by a recursive branching process which had a starting point somewhere, it probably behooves you to put the start at that point corresponding to the root of the tree, so that the maze wanderer faces the most branching choices.

Laying out the abstract maze tree into the rectilinear grid of cells obfuscates the tree somewhat, but not entirely. A process that generates from upper left to lower right, for instance, will tend to generate cells whose parent-headed exits going left and up more often than not, making the reverse direction a bit easier.

(Again, it depends on the maze generation process.)

kazinator•1y ago
Making random mazes in a rectilinear grid is a good exercise for one big reason: mazes are not all the same. Mazes have style can be very knotty and twisty, or have long passages. You can add hacks into a given algorithm to vary the style, but there are certain things it won't necessarily do.