frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

1•rehmanasghar•9s ago

Indian activist urged to give up hunger strike over exam leaks

https://www.reuters.com/world/india/indian-activist-urged-give-up-hunger-strike-over-exam-leaks-2...
1•thunderbong•20s ago•0 comments

The great digital fatigue: How digital burnout is changing social media use

https://blog.incogni.com/digital-fatigue-and-burnout/
1•derbOac•1m ago•0 comments

Content Defined Chunking for Go

https://www.plakar.io/posts/2026-06-14/go-cdc-chunkers-v1.1.0-faster-leaner-and-provably-correct/
1•vcoisne•1m ago•0 comments

Patients reportedly beating cancer with just one tablet a day (2022) [video]

https://www.youtube.com/watch?v=sq2dfgg70hs
1•thelastgallon•3m ago•0 comments

The End of Effort: why no one is trying anymore [video]

https://www.youtube.com/watch?v=XZyE1sSNw8E
1•ilreb•5m ago•0 comments

AsyncAPI Supply Chain Compromise via GitHub Actions

https://www.wiz.io/blog/m-red-team-asyncapi-supply-chain-compromise-via-github-actions
1•ramimac•6m ago•0 comments

Tweak self-hosted SearXNG with Kagi domains (2025)

https://old.reddit.com/r/selfhosted/comments/1hs1oxg/appreciation_post_for_searxng/
1•patrickk•7m ago•1 comments

Show HN: Pg-jason-validator fastest JSON schema validation via C Macros

https://github.com/furstenheim/pg-jason-validator
1•furstenheim•7m ago•0 comments

The Marketplace of Ideals (2023)

https://www.dgtlgrove.com/p/the-marketplace-of-ideals
1•kugurerdem•8m ago•0 comments

The disk that never woke up: The Elasticsearch and Qdrant saga

https://www.elastic.co/search-labs/blog/vector-search-benchmark-elasticsearch-qdrant
2•talboren•9m ago•0 comments

Exch: Atomically exchanges paths between two files

https://man7.org/linux/man-pages/man1/exch.1.html
1•BoingBoomTschak•9m ago•0 comments

3D Campus Map

https://rtnf.substack.com/p/missionmap
1•altilunium•10m ago•0 comments

C3 0.8.2 a Modest Improvement

https://c3-lang.org/blog/0_8_2_a_modest_improvement/
1•lerno•12m ago•1 comments

PowerBrowsing

http://davide.eynard.it/malawiki/PowerBrowsing.html
1•navigaid•13m ago•0 comments

Replicant.space: An API-first space exploration game

https://replicant.space/
1•progval•13m ago•0 comments

Enhancing GNU-Pth for m:n threading using Claude and Codex

https://medium.com/@dibyendumajumdar/adding-m-n-threading-to-gnu-pth-using-claude-and-codex-92d57...
1•dibyendu•13m ago•0 comments

"Is AI Making Faculty More Likely to Retire?"

https://karenkelsky.substack.com/p/is-ai-making-faculty-more-likely
1•Michelangelo11•16m ago•0 comments

You only need the frontier model for one single edit

https://stencil.so/blog/prewalk
1•himata4113•17m ago•0 comments

Building an open source chain of trust: new research uncovers key blockers

https://canonical.com/blog/open-source-security-research
1•crashpn•17m ago•0 comments

Why can't you commit a .env file?

1•devmtk•17m ago•0 comments

Bryan Johnson: The world wants me to die

https://xcancel.com/bryan_johnson/status/2076365226354909522
1•fittingopposite•19m ago•0 comments

Thoughts on starting new projects with LLM agents

https://eli.thegreenplace.net/2026/thoughts-on-starting-new-projects-with-llm-agents/
1•signa11•24m ago•0 comments

New EU report details age verification plans and ID requirements

https://commission.europa.eu/document/download/d833504d-5ec3-4fac-945f-38e7d0bd5326_en
3•_____k•25m ago•0 comments

ODT Files Are Structured

https://opensource.com/article/22/8/odt-files
1•ankitg12•25m ago•0 comments

The Scramblepad Hardware and Protocol

https://bikerglen.com/blog/the-scramblepad-hardware-and-protocol/
1•jackwilsdon•26m ago•0 comments

Embracing the suboptimal organization of the human brain

https://www.sciencedirect.com/science/article/pii/S1364661326000926?via%3Dihub
1•paraschopra•29m ago•0 comments

Step by step guide to becoming a Cyber Security Expert in 2026

1•sidharth121•30m ago•0 comments

Traumatic Memories Hide in the Brain, and How to Retrieve Them (2015)

https://news.feinberg.northwestern.edu/2015/08/17/how-traumatic-memories-hide-in-the-brain/
2•nephihaha•32m ago•0 comments

Starship – Critical Path [video]

https://www.youtube.com/watch?v=-a0ecQMq-rM
1•Klaster_1•33m 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.