frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Open in hackernews

Generating Mazes with Inductive Graphs (2017)

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

Comments

tomfly•9mo ago
where is the entrance and exit?
Jaxan•9mo ago
Doesn’t matter, because all positions are reachable. So just pick any two positions at the border and remove a wall.
kazinator•9mo 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•9mo 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•9mo 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•9mo 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.

How I use Claude Code: Separation of planning and execution

https://boristane.com/blog/how-i-use-claude-code/
453•vinhnx•8h ago•271 comments

Japanese Woodblock Print Search

https://ukiyo-e.org/
74•curmudgeon22•5h ago•12 comments

How Taalas "prints" LLM onto a chip?

https://www.anuragk.com/blog/posts/Taalas.html
92•beAroundHere•13h ago•42 comments

A Botnet Accidentally Destroyed I2P

https://www.sambent.com/a-botnet-accidentally-destroyed-i2p-the-full-story/
94•Cider9986•7h ago•51 comments

Show HN: Llama 3.1 70B on a single RTX 3090 via NVMe-to-GPU bypassing the CPU

https://github.com/xaskasdf/ntransformer
229•xaskasdf•11h ago•54 comments

Two Bits Are Better Than One: making bloom filters 2x more accurate

https://floedb.ai/blog/two-bits-are-better-than-one-making-bloom-filters-2x-more-accurate
83•matheusalmeida•4d ago•15 comments

How far back in time can you understand English?

https://www.deadlanguagesociety.com/p/how-far-back-in-time-understand-english
513•spzb•3d ago•274 comments

Gamedate – A site to revive dead multiplayer games

https://gamedate.org/
82•msuniverse2026•1d ago•9 comments

Evidence of the bouba-kiki effect in naïve baby chicks

https://www.science.org/doi/10.1126/science.adq7188
123•suddenlybananas•10h ago•33 comments

Parse, Don't Validate and Type-Driven Design in Rust

https://www.harudagondi.space/blog/parse-dont-validate-and-type-driven-design-in-rust/
183•todsacerdoti•13h ago•44 comments

zclaw: personal AI assistant in under 888 KB, running on an ESP32

https://github.com/tnm/zclaw
160•tosh•20h ago•84 comments

Claws are now a new layer on top of LLM agents

https://twitter.com/karpathy/status/2024987174077432126
279•Cyphase•1d ago•723 comments

Scientists discover recent tectonic activity on the moon

https://phys.org/news/2026-02-scientists-tectonic-moon.html
47•bookmtn•4d ago•3 comments

CXMT has been offering DDR4 chips at about half the prevailing market rate

https://www.koreaherald.com/article/10679206
196•phront•18h ago•181 comments

Toyota Mirai hydrogen car depreciation: 65% value loss in a year

https://carbuzz.com/toyota-mirai-massive-depreciation-one-year/
137•iancmceachern•14h ago•311 comments

Coccinelle: Source-to-source transformation tool

https://github.com/coccinelle/coccinelle
93•anon111332142•1d ago•28 comments

Carelessness versus Craftsmanship in Cryptography

https://blog.trailofbits.com/2026/02/18/carelessness-versus-craftsmanship-in-cryptography/
17•ingve•3d ago•0 comments

The Human Root of Trust – public domain framework for agent accountability

https://humanrootoftrust.org/
12•3du4rd0v3g4•18h ago•4 comments

Show HN: Minimalist Glitch Art Maker (100% client-side)

https://yuyz0112.github.io/glitch-art-maker/
3•yz-yu•5d ago•0 comments

Canvas_ity: A tiny, single-header <canvas>-like 2D rasterizer for C++

https://github.com/a-e-k/canvas_ity
90•PaulHoule•13h ago•33 comments

I verified my LinkedIn identity. Here's what I handed over

https://thelocalstack.eu/posts/linkedin-identity-verification-privacy/
1252•ColinWright•1d ago•432 comments

Forward propagation of errors through time

https://nicolaszucchet.github.io/Forward-propagation-errors-through-time/
24•iNic•2d ago•0 comments

A16z partner says that the theory that we’ll vibe code everything is wrong

https://www.aol.com/articles/a16z-partner-says-theory-well-050150534.html
129•paulpauper•1d ago•190 comments

Keep Android Open

https://f-droid.org/2026/02/20/twif.html
2057•LorenDB•1d ago•694 comments

EDuke32 – Duke Nukem 3D (Open-Source)

https://www.eduke32.com/
182•reconnecting•12h ago•65 comments

A New Perspective on Drawing Venn Diagrams for Data Visualization

https://arxiv.org/abs/2601.06980
9•IdealeZahlen•3d ago•3 comments

What not to write on your security clearance form (1988)

https://milk.com/wall-o-shame/security_clearance.html
438•wizardforhire•15h ago•193 comments

Inputlag.science – Repository of knowledge about input lag in gaming

https://inputlag.science
83•akyuu•12h ago•14 comments

Finding forall-exists Hyperbugs using Symbolic Execution

https://dl.acm.org/doi/full/10.1145/3689761
36•todsacerdoti•5d ago•2 comments

Permacomputing

https://wiki.xxiivv.com/site/permacomputing.html
134•tosh•4d ago•35 comments