frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

The Fermi Paradox, Percolation, and Inbreeding

https://reactormag.com/the-fermi-paradox-percolation-and-inbreeding/
1•bryanrasmussen•9s ago•0 comments

Trump Media pitched $100k monthly fee for fast feed of president's posts

https://www.ft.com/content/e466df85-fa3b-4a7f-a4a1-ae04d66db99f
1•theahura•1m ago•0 comments

If You Build It, They Will Come

https://www.benlandautaylor.com/p/if-you-build-it-they-will-come
1•barry-cotter•1m ago•0 comments

Show HN: Sovereign-Metal – Zero-Dependency Python/Metal GPGPU Advection

https://github.com/getcognition-online/sovereign-metal
1•Jamie_Nixx_CUI•2m ago•0 comments

US data center protests go national as backlash grows

https://www.reuters.com/business/retail-consumer/us-data-center-protests-go-national-backlash-gro...
1•vrganj•3m ago•0 comments

Elixir-lang.org has a new design

https://elixir-lang.org/
1•bbg2401•6m ago•1 comments

Multidim inplace permutations in constant(*) space

https://cschen.cc/posts/inplace-permdims/
2•FacelessJim•6m ago•0 comments

Young women who go to North Lake Tahoe's beaches are shallow heightists

1•AnonymousAProb•6m ago•1 comments

How voice-to-voice models work: from sound wave to living conversation

https://asaptf.github.io/v2v-models-article-en/
1•asaptf•8m ago•0 comments

Official Jagex Launcher for Linux

https://secure.runescape.com/m=news/jagex-launcher-for-linux-beta-out-now?oldschool=1
1•Venn1•9m ago•1 comments

What else do people draw on gradient.horse?

https://rybakov.com/blog/what_else_do_people_draw_on_gradient-copy.horse/
1•spython•9m ago•0 comments

Traders are increasingly betting against SpaceX just weeks after IPO

https://www.ft.com/content/2b96703d-440b-46db-8d86-9fff9ecc59d5
1•ethanhawksley•12m ago•1 comments

Run all your sites SEO on autopilot

https://boldpilot.club
2•Utopyasz•18m ago•0 comments

Show HN: Du, honest – an APFS-clone-aware disk usage analyzer

https://github.com/cheapsteak/duh
1•cheapsteak•19m ago•0 comments

Show HN: Jelly NYC, Experiment with Box3D

https://jellynyc.vercel.app/
1•kriz9•19m ago•0 comments

Narcissistic leaders more likely to oppose remote work, new research suggests

https://www.cbc.ca/news/business/study-remote-work-narcissism-9.7275176
2•uladzislau•21m ago•0 comments

Show HN: PrimeTask, an offline-first work OS with BYO AI through MCP

https://www.primetask.app/
1•vxvaptor•22m ago•0 comments

Coding agent for local models on a Mac

https://mlx-optiq.com/blog/optiq-code
1•codelion•24m ago•0 comments

Show HN: Q3Edit – Edit and play Quake 3 maps in the browser

https://q3edit.com
1•drdator•26m ago•0 comments

OpenAI's Sol Learned Design Taste

https://notes.designarena.ai/how-openais-sol-finally-learned-design-taste/
1•gmays•28m ago•0 comments

British runner Josh Kerr breaks world record for mile which stood for 27 years

https://news.sky.com/story/british-runner-josh-kerr-breaks-world-record-for-mile-which-had-stood-...
5•austinallegro•30m ago•1 comments

Build: Mobile-First AI Creation on Roblox

https://about.roblox.com/newsroom/2026/07/build-without-limits-on-roblox
1•nyku•31m ago•0 comments

British runner Josh Kerr breaks 27-year-old world record in the mile

https://www.runnersworld.com/news/a73175937/josh-kerr-breaks-mile-world-record/
3•rappatic•32m ago•0 comments

A Simple P/E Valuation Model that Works

https://www.safalniveshak.com/simple-pe-valuation-model/
1•akbarnama•33m ago•0 comments

Show HN: Teya – Open‑source AI family agent on a wall‑mounted Android phone

https://github.com/adgapar/teya
1•AdiletGaparov•34m ago•0 comments

I tested Gisia against real-world .gitlab-ci.yml files – it just works

1•okoddcat•35m ago•0 comments

Tract Postmortem (2025)

https://buildwithtract.com/
1•dukeyukey•40m ago•0 comments

The scientific case for eating more bones

https://www.nationalgeographic.com/health/article/eating-bones-nutrition-health
1•YeGoblynQueenne•43m ago•0 comments

EU will force Google to share search data and open up AI on Android

https://arstechnica.com/gadgets/2026/07/its-official-eu-will-force-google-to-share-search-data-an...
5•akyuu•44m ago•1 comments

DBUF Encoding and Protocol

https://github.com/bintoca/dbuf
1•pierogitus•44m 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.