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•8mo ago

Comments

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

The Analog Manifesto – For digital people who crave the analog era

https://theanalogmanifesto.com/
1•heshiebee•2m ago•0 comments

Do you know why your users are churning?

1•j_mao•3m ago•0 comments

Using LLMs to compare 500 Pages of Macro Research (with citations)

https://2026macro.vercel.app/about.html
1•OxfordOutlander•3m ago•0 comments

Show HN: CryDecoder – On-device ML for classifying baby cries (Swift, Core ML)

https://apps.apple.com/us/app/crydecoder-baby-translator/id6756557492
1•evanjusttrying•5m ago•0 comments

The rsync algorithm (1996) [pdf]

https://www.andrew.cmu.edu/course/15-749/READINGS/required/cas/tridgell96.pdf
2•vortex_ape•6m ago•0 comments

Memos – An open-source, self-hosted note-taking service

https://github.com/usememos/memos
1•the-mitr•6m ago•0 comments

Homeworld

https://www.filfre.net/2026/01/homeworld/
3•doppp•7m ago•0 comments

The CRQC Quantum Capability Framework (2018)

https://postquantum.com/post-quantum/crqc-quantum-capability-framework/
1•speckx•7m ago•0 comments

GR-Dexter Technical Report

https://byte-dexter.github.io/gr-dexter/
1•gmays•7m ago•0 comments

Why Big Tech Turns Everything into a Knife Fight

https://www.cloudrift.ai/blog/why-big-tech-turns-everything-into-a-knife-fight
1•PretzelFisch•8m ago•0 comments

Tui4j: Terminal User Interface Library for Java

https://github.com/WilliamAGH/tui4j
1•simonpure•8m ago•0 comments

Releasing Fjall 3.0

https://fjall-rs.github.io/post/fjall-3/
1•emschwartz•10m ago•0 comments

Show HN: Podtoc – LLM generated 10-minute podcast clips as a YouTube alternative

https://podtoc.com/app/
1•conradbez•11m ago•0 comments

Brief: ChatGPT in your terminal: slash commands, any OpenAI model, local tools

https://github.com/WilliamAGH/brief
1•simonpure•15m ago•0 comments

Public Domain 2026 Speed Library

https://speed-read-bay.vercel.app
1•ladidahh•15m ago•1 comments

Goals for 2026

1•ClaudeGustav2•19m ago•0 comments

Low-Overhead Parallelism for Large-Scale Data Scans Using Unix Pipes

https://world.hey.com/apetrov/low-overhead-parallelism-for-large-scale-data-scans-using-unix-pipe...
1•apetrov•20m ago•0 comments

Bfs: A breadth-first version of the Unix find command

https://github.com/tavianator/bfs
1•PaulHoule•21m ago•0 comments

Show HN: FounderBooster – expose local apps via Cloudflare Tunnel

https://github.com/founderbooster/founderbooster
2•founderbooster•21m ago•1 comments

Show HN: A1 – cost-optimizing JIT for CRUD AI agent translation to code

https://github.com/stanford-mast/a1
1•calebhwin•21m ago•0 comments

An uncomfortable discussion about the Debian bug tracker

https://nibblestew.blogspot.com/2025/12/an-uncomfortable-but-necessary.html
1•dboon•22m ago•0 comments

Ralph Wiggum as a "Software Engineer"

https://ghuntley.com/ralph/
1•ghuntley•23m ago•0 comments

Blood Alcohol Content (BAC) Drink Driving Limits Across Europe

https://etsc.eu/issues/drink-driving/blood-alcohol-content-bac-drink-driving-limits-across-europe/
1•bookofjoe•23m ago•0 comments

How the AI 'Bubble' Compares to History

https://www.ft.com/content/41e9d03a-e5c1-4862-9836-b3c80b3f9be4
2•karakoram•23m ago•1 comments

Lessons from 14 Years at Google

https://addyo.substack.com/p/21-lessons-from-14-years-at-google
1•simonpure•25m ago•0 comments

Building an OS from scratch, need your opinion on volume names

1•C_IsTheGOAT•25m ago•1 comments

Apple File System Reference (2020) [pdf]

https://developer.apple.com/support/downloads/Apple-File-System-Reference.pdf
1•birdculture•26m ago•0 comments

What were books like in ancient Greece and Rome?

https://theconversation.com/what-were-books-like-in-ancient-greece-and-rome-267872
3•bikenaga•29m ago•0 comments

China’s BYD Overtakes Tesla As World’s Top EV Seller For The First Time

https://www.theguardian.com/business/2026/jan/02/china-byd-tesla-worlds-biggest-electric-car-sell...
1•karakoram•29m ago•0 comments

Tools for Conviviality (Ivan Illich, 1973)

https://en.wikipedia.org/wiki/Tools_for_Conviviality
1•pauldelany•31m ago•0 comments