frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Show HN: NanoEuler – GPT-2 scale model in pure C/CUDA from scratch

https://github.com/JustVugg/nanoeuler
2•vforno•3m ago•0 comments

TOP500 at ISC'26: We Have a New Number 1 – By George Cozma

https://chipsandcheese.com/p/top500-at-isc26-we-have-a-new-number
2•rbanffy•3m ago•0 comments

Ante: A New Way to Blend Borrow Checking and Reference Counting

https://verdagon.dev/blog/ante-blending-borrowing-rc
1•g0xA52A2A•3m ago•0 comments

Researchers Set Hybrid Bonding Records

https://spectrum.ieee.org/hybrid-bonding-2677022836
1•rbanffy•4m ago•0 comments

Nourish: A New Wayland Compositor Powered by Vulkan with Infinite Scrolling

https://www.phoronix.com/news/Nourish-Wayland-Compositor
1•okso•5m ago•1 comments

Ford rehires 'gray beard' engineers after AI falls short

https://techcrunch.com/2026/06/28/ford-rehires-gray-beard-engineers-after-ai-falls-short/
6•rbanffy•5m ago•0 comments

Enough Numbers to Build a Universe

https://www.stephendiehl.com/posts/universe/
1•tmach32•7m ago•0 comments

Cloudflare cut 1,100 jobs and then grew its engineering team by 45 percent

https://thenextweb.com/news/cloudflare-builders-sellers-measurers-engineering-surge-ai-layoffs
2•karlmush•7m ago•0 comments

Show HN: Use-zerostack – delegate any task to a lightweight coding agent

https://github.com/gi-dellav/use-zerostack/
1•gidellav•8m ago•0 comments

Cold War Erosion Simulation

https://github.com/ajsbsd/ajsbsd-jwst-cli
1•ajsBSDdotnet•9m ago•1 comments

Asciigraph: Go pkg to make lightweight ASCII graph in CLI with zero dependencies

https://github.com/guptarohit/asciigraph
1•atkrad•11m ago•0 comments

Mercury – Open-source, local-first agentic harness for Android

https://github.com/Yene96/Mercury
1•yene96•13m ago•0 comments

Release v1.27.0 · go-delve/delve

https://github.com/go-delve/delve/releases/tag/v1.27.0
1•atkrad•16m ago•0 comments

The Curious Case of Aa.ns.charter.com

https://mikehowells.com/2026/06/21/the-curious-case-of-aa-ns-charter-com/
1•sashk•16m ago•0 comments

A conversation with Marc Andreessen (2000-10-02)

https://charlierose.com/videos/5018
1•andreyazimov•19m ago•0 comments

Show HN: I built an opinionated minimalist ePub/pdf online reader

https://epub.mirror.forum
1•Imustaskforhelp•20m ago•0 comments

A wire-faithful, browser-based re-creation of the Atari ST game MIDI Maze

https://github.com/diegoparrilla/midi-maze-js
5•logronoide•23m ago•0 comments

WinPE as a stateless harness for Windows driver testing and fuzzing

https://bednars.me/blog/winpe-harness
2•piotrbednarsalt•23m ago•0 comments

Your Kids’ School Bus Is About to Become a Roaming Surveillance Vehicle

https://www.thedrive.com/news/your-kids-school-bus-is-about-to-become-a-roaming-surveillance-vehicle
2•voxadam•28m ago•0 comments

Show HN: Snarl – Fast Shacl Validator

https://github.com/trivyn/snarl
1•jcadam•28m ago•0 comments

SISU: The Feeling of Perseverance

https://finland.fi/emoji/sisu/
1•jruohonen•32m ago•1 comments

The US Used to Demand the Best Tech. Now We Ban It

https://www.pcmag.com/opinions/the-us-used-to-demand-the-best-tech-now-we-ban-it
7•mwexler•33m ago•1 comments

What I Do Not Understand, (A)I Cannot Create

https://medium.com/@joshua.sparaga/what-i-do-not-understand-a-i-cannot-create-740d335e33fb
1•psteitz•33m ago•0 comments

Show HN: Prose or Con, can you detect AI writing?

https://prose-or-con.com/
1•SwellJoe•34m ago•1 comments

Keyless, Identity-Aware Access to Any AI

https://netbird.ai/
1•braginini•35m ago•0 comments

Do LLMs pass the mirror test?

https://blog.pascalschuster.de/article/do-llms-pass-the-mirror-test
2•thepasch•35m ago•0 comments

LLDB MCP

https://lldb.llvm.org/use/mcp.html
2•Austin_Conlon•41m ago•0 comments

Computer-Aided Language Development in Nonspeaking Children (1968) [pdf]

https://archive.org/details/colby1968-computer-aided-language-development-in-non-speaking-children
3•dang•41m ago•0 comments

PostgreSQL and ClickHouse as the Open Source unified data stack

https://clickhouse.com/blog/postgres-clickhouse-oss
1•saisrirampur•43m ago•0 comments

EU-Backed DNS Resolver Collects Pirate Site Blocklist, Which It Doesn't Use

https://torrentfreak.com/eu-backed-dns-resolver-collects-pirate-site-blocklist-which-it-doesnt-use/
5•gslin•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.