frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Like Netflix for Hacker News stories

https://hndocs.org/
1•recuerdala•2m ago•0 comments

Neil the Seal Management Plan November 2026 [pdf]

https://nre.tas.gov.au/Documents/Neil%20the%20Seal%20Management%20Plan.pdf
1•susiecambria•3m ago•0 comments

Indian mathematician cracks 70-year-old maths problem earns spot on TIME100 Next

https://indianexpress.com/article/trending/trending-in-india/indian-mathematician-neena-gupta-cra...
1•fork-bomber•4m ago•0 comments

Show HN: Coma – Bilingual ES/EN language with LLVM back end and C runtime

1•Agmine•5m ago•0 comments

Boomers Are Rewriting the Playbook for Old Age. It Doesn't Involve Winding Down

https://www.wsj.com/personal-finance/retirement/baby-boomers-aging-eec29458
1•pretext•8m ago•0 comments

Taxi Driver scriptwriter Paul Schrader on unleashing AI at 80

https://www.theguardian.com/film/2026/nov/21/taxi-driver-scriptwriter-paul-schrader-ai-film-makin...
1•Michelangelo11•10m ago•0 comments

Connecting the tools is becoming the work

https://karlkoch.me/writing/connecting-the-tools-is-becoming-the-work/
1•meetpateltech•12m ago•0 comments

Eureka: Cambridge University student mathematical publication running since 1939

https://archim.org.uk/publications/
2•vismit2000•13m ago•0 comments

Show HN: A Lichess client for playing chess and puzzles on Kobo e-readers

https://github.com/BandarLabs/Cobalt/tree/main/apps/lichess
3•thepoet•13m ago•0 comments

Hacking Muse: Stealing Private Chats Through Browser Use

https://nebusec.ai/research/meta-muse-credential-exposure/
1•ersinesen•15m ago•0 comments

A Cruel Knife for Chu-A Warring States Story: 张仪欺楚

http://dragonsarmory.blogspot.com/2024/02/betraying-world-tongue-of-zhang-yi.html
1•joebig•15m ago•0 comments

EU rejects deal as longest climate summit ever faces collapse

https://www.theguardian.com/environment/live/2026/nov/22/cop31-climate-crisis-talks-turkey-latest...
2•roryirvine•15m ago•1 comments

Banks Have Had It Up to Here With Your AI Agent

https://www.wired.com/story/banks-are-cracking-down-on-ai-agents/
1•Brajeshwar•16m ago•0 comments

By attacking Chinese Al industry, the US has burst its own Al bubble

https://www.china-translated.com/p/by-attacking-chinese-ai-industry
3•puelocesar•19m ago•0 comments

Del Casher–guitarist who was driving force behind the wah-wah pedal–dies at 88

https://www.nytimes.com/2026/11/17/obituaries/del-casher-dead.html
1•bookofjoe•19m ago•1 comments

Watching Hacker News: turning top threads into 6-minute short films

https://lusob.github.io/hn-docs/
2•lusob•23m ago•0 comments

Linux Kernel Modules in Go

https://jespino.github.io/gokm/
1•bigwhite•24m ago•0 comments

The Great Automatic Grammatizator (By Roald Dahl), 1954 [pdf]

https://gwern.net/doc/fiction/science-fiction/1953-dahl-thegreatautomaticgrammatizator.pdf
1•Michelangelo11•24m ago•0 comments

Reverse-Spec-Flow

https://github.com/aws-samples/sample-reverse-spec-flow
2•YY-EN40P•27m ago•0 comments

Owl OS Is a New Kali Linux Competitor

https://itsfoss.com/news/owl-os-launch/
4•giuliomagnifico•28m ago•0 comments

AutoCraft: Harness for maintaining GitHub repositories with a large backlog

https://github.com/storytold/autocraft
2•SweetSoftPillow•32m ago•0 comments

Show HN: The Yang–Mills Mass Gap on Pure R^4 as a Zugzwang (Lean 4, 224 Checks)

https://github.com/Dr-Logvinovich/round-square
4•DRLogvinovich•34m ago•0 comments

Wayfinder: Frontier-Level Code Search at a Fraction of the Cost

https://blog.voyageai.com/2026/11/18/wayfinder-code-search/
2•fzliu•34m ago•0 comments

OcLTL: LTL Realizability and Synthesis Modulo ω-Categorical Structures

https://arxiv.org/abs/2605.12539
2•birdculture•35m ago•0 comments

Mechanical Pencil: Spray Bottle

https://mechanical-pencil.com/products/spray-bottle
3•vinhnx•37m ago•0 comments

Show HN: Building 1M+ RPS Distributed Engines in Go and Rust

https://github.com/grfdsasdvef/awesome-highload-architecture
2•snowdensay•38m ago•0 comments

Zero Trust for AI Agents

https://claude.com/resources/articles/zero-trust-for-ai-agents
3•7777777phil•41m ago•0 comments

Building a Speech Recognizer from Scratch in Rust with No Dependencies

https://github.com/Ghvstcode/speech-recognizer-from-scratch
3•flyingsky•41m ago•0 comments

Can a Model Be Differentially Private and Fair? – Pair Explorables with Google

https://pair.withgoogle.com/explorables/private-and-fair/
3•vismit2000•43m ago•0 comments

Know what bitrate your audio is

https://whatsmybitrate.com/
2•RedShift1•50m 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.