frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Show HN: Unspin – A game about fake news and memes

https://unspin.app/
1•azermite•30s ago•0 comments

Rendering pull requests in the GitHub Copilot app

https://github.blog/engineering/user-experience/rendering-huge-pull-requests-in-the-github-copilo...
1•iamsyr•4m ago•0 comments

Australia says OpenAI agent hacked into government website

https://www.channelnewsasia.com/world/australia-openai-agent-breach-government-portal-6406411
1•doppp•4m ago•0 comments

Pentagon Investigating How F-35 Fighter Jet Parts Bound for US Were Diverted

https://www.military.com/pentagon-investigating-how-f-35-fighter-jet-parts-bound-for-us-were-dive...
1•harry_nutsachs•5m ago•1 comments

AP: Avoid language that gives [AI] human characteristics

https://twitter.com/APStylebook/status/2102807962364383502
3•jaredwiener•8m ago•0 comments

Qubits on NonQuantum HW Tested

https://laurinseclab.substack.com/p/breaking-news-makrogravintelligence
2•Rniznan•9m ago•0 comments

Liquid Network Security Incident Assessment

https://blog.blockstream.com/liquid-network-security-incident-assessment/
2•greyface-•10m ago•0 comments

FLAWED's Flaws and What This Means for Industry Research

https://suhacker.ai/p/flaweds-flaws-and-what-this-means-for-industry-research/
5•tob_scott_a•12m ago•0 comments

Geminigravit Core: De la teoría estática

https://gemini.google.com/app/3952a805cd6ad7a3
2•jccrcabello•13m ago•0 comments

We used an AI agent to fix an open-source bug. Someone asked to ban us

https://github.com/saulpw/visidata/pull/3229
9•maxcr•13m ago•2 comments

Shadow roots, explained with live examples

https://tools.simonwillison.net/shadow-roots
2•vismit2000•15m ago•0 comments

Show HN: Does per-step reasoning effort save money in Claude Code?

https://github.com/ifoster01/jev-effort
2•ifoster41901•20m ago•0 comments

Show HN: ChaosTree – Cache-Aware Java NavigableMap and NavigableSet Library

https://github.com/Chaos-vy/ChaosTree
1•chaos_vy•21m ago•0 comments

Show HN: Posting Puzzle – A Game Made of Post's Correspondence Problem

https://mametter.itch.io/posting-puzzle
1•mametter•22m ago•1 comments

AI startups with hyper ARR growth – what's happening inside these companies?

1•d675•24m ago•0 comments

Nesbox: A fast MicroVM with GPU sharing

https://github.com/nestrilabs/nesbox
1•WanjohiRyan•24m ago•0 comments

Using my transit card data to create a year in review experience

https://cailinpitt.com/blog/2026/9/1/chicago-transit-authority-wrapped
1•classictraffic•25m ago•0 comments

Virtio-nvgpu: Near-native Nvidia GPU access inside a KVM guest

https://github.com/nestrilabs/virtio-nvgpu
2•WanjohiRyan•26m ago•0 comments

Scientists build most accurate atomic clock

https://phys.org/news/2026-09-scientists-world-accurate-atomic-clock.html
1•wglb•28m ago•1 comments

AI Has Cracked the Most Diabolical Problems in Math. Why Can't It Solve Chess?

https://www.wsj.com/tech/ai/chess-artificial-intelligence-ai-e969a830
1•sonabinu•28m ago•0 comments

lm-detector: Model fingerprint detection on Web and CLI

https://github.com/Ikaleio/lm-detector/
1•csmantle•32m ago•0 comments

SnakeCharmer: Fuzzing Harness Generation for Pure and Hybrid Python Libraries [pdf]

https://futures.cs.utah.edu/papers/26FSE-b.pdf
2•luu•38m ago•0 comments

Making my vibe-coded app best as possible (I am perfectionist), umm for 0 users

1•arpanghoshal•39m ago•0 comments

JEV Engineering for Coding Agents

https://drive.google.com/file/d/17h982xvsL3E7b80iGmOCfKp9qTOW9ohv/view?pli=1
2•sonabinu•41m ago•0 comments

Show HN: An open-source manufacturing ERP/MES/QMS

https://carbon.ms/self-hosted
3•barbinbrad•43m ago•0 comments

Hard Startups (2020)

https://blog.samaltman.com/hard-startups
1•alentodorov•44m ago•0 comments

OnPanda – Open-source token inspection&data annotation tool from Step 5 Preview

https://twitter.com/StepFun_ai/status/2102454115473510643
3•WavyPeng•45m ago•0 comments

Feds Target AI Critics as "Foreign Agents"

https://www.kenklippenstein.com/p/feds-think-ai-critics-are-foreign
3•nmeagent•47m ago•1 comments

Arumayi

https://arumayi.com/
1•samyak007•48m ago•0 comments

Calculating atmospheric drag on satellites for a Cubesat [pdf]

https://www.osti.gov/servlets/purl/1124870
1•walrus01•54m 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.