frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

M-VAVE FM-1 Open: the green light for custom firmware and community hacks

https://synthanatomy.com/2026/10/m-vave-fm-1-open-the-green-light-for-custom-firmware-and-communi...
1•gregsadetsky•1m ago•0 comments

Constructors Shouldn't Throw

https://t3.at/blog/2025-07-20-constructors-shouldnt-throw/
1•jcbhmr•3m ago•0 comments

Alma image of HOPS-315, a still-forming planetary system

https://www.eso.org/public/images/eso2512a/
1•DoctorOetker•3m ago•0 comments

On Beyond Omega

https://mathenchant.wordpress.com/2026/10/18/on-beyond-omega/
1•jamespropp•6m ago•1 comments

The Deadly 1.5-Mile Corridor That Shows the Fatal Flaw in America's Road Design

https://www.wsj.com/us-news/the-deadly-1-5-mile-corridor-that-shows-the-fatal-flaw-in-americas-ro...
1•impish9208•14m ago•1 comments

I Teach at a Business School. It's Time to Shut Them Down

https://www.nytimes.com/2026/10/18/opinion/business-school-mba-harvard-cornell-cambridge.html
3•rgovostes•15m ago•2 comments

Rustd – Drop-in rustc replacement for faster builds

https://github.com/DioxusLabs/rustd
1•dabinat•19m ago•0 comments

Show HN: Hybro – an open interoperability engine for AI agents

https://github.com/hybroai/hybro
1•kevinlu310•22m ago•0 comments

OpenAI Faces Lawsuits, Subpoenas and EU Scrutiny in a Single Week

https://www.techpolicy.press/openai-faces-lawsuits-subpoenas-and-eu-scrutiny-in-a-single-week/
1•cdrnsf•23m ago•0 comments

Checking Relevance with Verdict4s

https://www.softinio.com/post/checking-relevance-with-verdict4s/
1•softinio•23m ago•0 comments

DeepSeek v4.1 Flash 1017 beats larger models in agentic tasks while cutting cost

https://the-decoder.com/deepseek-v4-1-flash-1017-beats-larger-rivals-in-agentic-tasks-while-once-...
2•yogthos•26m ago•0 comments

William Gibson and the Trademarking of Cyberspace

https://colo.to/cyberspace.html
3•Eric_Gullichsen•26m ago•2 comments

How Quickly Can the DoD Rebuild and Recast the Munitions Industrial Base?

https://www.csis.org/analysis/how-quickly-can-dod-rebuild-and-recast-munitions-industrial-base
1•gmays•26m ago•0 comments

Show HN: InfiniDomino – practically infinite world of dominoes to knock over

https://infinidomino.io/
1•Static2280•30m ago•0 comments

Newly identified green star leaves astronomers amazed

https://www.reuters.com/science/newly-identified-green-star-leaves-astronomers-amazed-2026-10-16/
5•NewJazz•35m ago•1 comments

Google Harness2: Recursive Agent Harnessing for an Open World

https://github.com/google-research/harness2
3•reimertz•44m ago•0 comments

He Wants AI Benchmarking to Be a Science, Not a Dark Art

https://www.quantamagazine.org/he-wants-ai-benchmarking-to-be-a-science-not-a-dark-art-20261016/
1•pseudolus•45m ago•0 comments

OpenFlow – Ultimate Agent Orchestration

https://github.com/SeeRay11/OpenFlow
1•searay112023•46m ago•0 comments

Home sellers cut asking prices on 3k properties a day

https://www.bbc.co.uk/news/articles/c84g13z6xx4eo
3•rvz•46m ago•1 comments

Studio Desktop

https://github.com/OrdiFi/studio-desktop
1•hreczynski1984•48m ago•0 comments

Show HN: Bhasini – 22 Indian Language Editor

https://bhasini.com/
1•Codegres•54m ago•0 comments

Integer to String Conversion (2014)

https://tia.mat.br/posts/2014/06/23/integer_to_string_conversion.html
1•jstrieb•56m ago•0 comments

Xterm/VT100 Terminal emulator library in Swift

https://github.com/migueldeicaza/SwiftTerm
2•wslh•56m ago•1 comments

Integer Multiplication as a Living Research Programme [pdf]

https://hexapode.github.io/integer-mult-living-paper/paper.pdf
1•pierre•58m ago•0 comments

CS Fundamentals are Great (OSSU)

https://teadrivendevelopment.substack.com/p/cs-fundamentals-are-great
1•ghassenfaidi•59m ago•0 comments

Reflections After Artemis II

https://www.nasa.gov/podcasts/houston-we-have-a-podcast/reflections-after-artemis-ii/
3•laybak•1h ago•0 comments

Show HN: Gspot, a tool to lint gstack code

https://generativespotting.com/
1•dr__stoney•1h ago•1 comments

GL.iNet Comet Q GL-RMQ1 Review: Single USB-C Cable Remote KVM with Tailscale

https://www.servethehome.com/gl-inet-comet-q-gl-rmq1-review-a-single-usb-type-c-cable-remote-kvm-...
1•wondersky•1h ago•0 comments

What Anthropic's 17x quantum claim left out [video]

https://www.youtube.com/watch?v=qkUx6uhIu_s
1•erratum_hunter•1h ago•0 comments

How RC2's π table was made

https://khalidhamadeh.com/writing/rc2-pi-table
2•KhalidH•1h ago•1 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.