frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

GLM-5.3: Frontier Coding with Emergent Cyber Capabilities

https://z.ai/blog/glm-5.3
9•pella•5m ago•0 comments

Gemini 3.7 Flash

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-3-7-fl...
717•thisisauserid•12h ago•393 comments

Accelerating GPT-5.6 Sol Ultrafast

https://www.cerebras.ai/blog/accelerating-gpt-5-6-sol-ultrafast-with-openai
508•pr337h4m•11h ago•209 comments

Hello, me. It's been a while

https://themech.net/2026/08/hello-me-its-been-a-while/
96•somesoftdev•10h ago•48 comments

Bluesky Protocol Services

https://atproto.com/blog/introducing-bluesky-protocol-services
121•danabramov•5h ago•22 comments

DeepSeek Harness developer preview

https://deepseek.com/harness/en/
604•bjin•16h ago•255 comments

NP-overrated

https://gruhn.me/blog/2026-08-13/
183•theanonymousone•9h ago•112 comments

Spaghettifying DRAM

https://github.com/xoreaxeaxeax/skitter-creek-bath-salts
546•matt_d•15h ago•150 comments

Mistral OCR 4.1

https://docs.mistral.ai/models/ocr-4-1
283•spelk•12h ago•113 comments

Understanding is the new bottleneck

https://www.geoffreylitt.com/2026/07/02/understanding-is-the-new-bottleneck
260•sebg•10h ago•143 comments

Choose Boring Technology (2015)

https://mcfunley.com/choose-boring-technology
298•tosh•11h ago•147 comments

Donkey.bas is 45 Years Old – 131 line of Glory

https://donkeybas.com/
210•jkrauska•11h ago•96 comments

Blog about things you don't understand yet

https://www.seangoedecke.com/blog-about-things-you-dont-understand-yet/
58•gfysfm•5h ago•26 comments

The Legend of the Novell NE2000 [video]

https://www.youtube.com/watch?v=nNXzQ7V1S_k
25•voxadam•4d ago•6 comments

Nine PBS sues Iron Mountain over blocked access to archival data

https://current.org/2026/08/nine-pbs-sues-iron-mountain-over-blocked-access-to-archival-data/
278•vinayakborkar•16h ago•164 comments

How do you sell a CPU design when the instruction set is free?

https://www.siliconimist.com/p/credibility-is-the-barrier-to-entry
9•johncole•3d ago•0 comments

How Compaction Works in Pi

https://earendil.com/posts/compaction-in-pi/
134•tosh•11h ago•52 comments

Finite State Machines in Forth (1994)

https://www.forth.org/literature/noble.html
65•ofalkaed•5d ago•2 comments

How Organizations Use AI: Evidence from ChatGPT [pdf]

https://cdn.openai.com/pdf/how-organizations-use-chatgpt.pdf
88•malshe•10h ago•49 comments

Where did the old web go? We followed 657,607 links to find out

https://0.mk/blog/link-rot
149•tdx•11h ago•139 comments

Cave of the Crystals

https://en.wikipedia.org/wiki/Cave_of_the_Crystals
16•ColinWright•5d ago•1 comments

Single log line is 49KB+ (ext4) / 110KB+ (btrfs) of systemd-journald disk writes

https://github.com/systemd/systemd/issues/40262
173•ValdikSS•10h ago•112 comments

How Gödel's Proof Works (2020)

https://www.quantamagazine.org/how-godels-proof-works-20200714/
89•tzury•9h ago•39 comments

An ambiguity in c89 which will never be fixed

https://sebsite.pw/w/20260810-c89ambiguity.html
47•runningmike•3d ago•13 comments

Ordinary Abundance

https://ordinaryabundance.com/
259•yen223•15h ago•133 comments

How a device finds encrypted DNS by itself

https://blog.dundns.eu/posts/ddr-encrypted-dns-discovery/
24•majorchord•6d ago•4 comments

Launch HN: Bullet (YC S26) – A Faster Coding Agent

https://www.codewithbullet.com
92•adi1•21h ago•66 comments

AI At Home Part 1: A Box Of Scraps

https://jdagostino.github.io/ai-pt1-box-o-scraps/index.html
110•timmmmmmay•13h ago•51 comments

Kubernetes on Oxide: How customer needs shaped our integrations

https://oxide.computer/blog/kubernetes-on-oxide
171•stevehipwell•14h ago•75 comments

Choosing an AI model: one prompt, 11 models, different results

https://www.netlify.com/blog/one-prompt-11-models-very-different-results/
188•toddmorey•16h ago•77 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.