frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Introduction to LLM Inference

https://kraghavan.ca/llm-infrastructure/inference/2026/04/14/re-introduction-to-inference.html
1•kraghavan•3m ago•0 comments

What Love Island tells us about the changing face of dating

https://www.bbc.co.uk/news/articles/c935q2k6pxqo
1•mmarian•3m ago•0 comments

Kaappi – r7rs scheme written in Zig

https://github.com/kaappi/kaappi
1•s20n•3m ago•0 comments

LLM-as-a-Judge Field Guide

https://kraghavan.ca/llm-infrastructure/evaluation/2026/07/25/llm-as-a-judge-field-guide.html
1•kraghavan•4m ago•0 comments

Only Pay for Human Ad Clicks

https://botaudit.co/
1•techguydiy•4m ago•0 comments

The Myth and the Medal(2015) [pdf]

https://www.ams.org/notices/201501/rnoti-p15.pdf
1•num42•6m ago•0 comments

Maybe we should revisit microkernels

https://notes.hella.cheap/maybe-we-should-revisit-microkernels.html
2•morkin•15m ago•0 comments

Shoppers rewire grocery routines while digesting biggest price jump in 50 years

https://abcnews.com/US/wireStory/americans-rewire-grocery-shopping-routines-digesting-biggest-pri...
1•geox•18m ago•0 comments

Thanatos Rising

https://theamericanscholar.org/thanatos-rising/
1•Caiero•20m ago•0 comments

We respond to Yelp leads in 15 seconds. The average business takes 4 hours

https://hirejosie.ai/blog/chatgpt-yelp-ai-lead-response/
1•ayinlaolajide•25m ago•1 comments

Ask HN: Protecting your Sites/Services from Unwanted Traffic?

2•prologic•26m ago•0 comments

Registration Open for OS/2 and ArcaOS Warpstock 2026 in San Antonio, Texas, USA

http://www.warpstock.org/staticpages/index.php?page=ws2026-home
2•Lammy•34m ago•0 comments

Calorie Redemption per Mile

https://shub.club/writings/2026/july/calorie-redemption-per-mile/
1•forthwall•35m ago•0 comments

Betlang – A programming language detection model in 50kb

https://github.com/DioxusLabs/betlang/
1•demonthos•38m ago•0 comments

The prestige and status of research fields within mathematics

https://arxiv.org/abs/2008.13244
1•nill0•38m ago•0 comments

You can view a lot of Claude shared conversations via Google

https://old.reddit.com/r/ClaudeAI/comments/1v6fiyj/you_can_view_a_lot_of_shared_conversations_via/
3•theanonymousone•43m ago•0 comments

Microsoft responds to LG monitors installing McAfee ads on Windows

https://arstechnica.com/gadgets/2026/07/microsoft-responds-to-lg-monitors-installing-mcafee-ads-o...
5•GavinAnderegg•55m ago•0 comments

Now that Huang believes in open source, looking forward to CUDA open sourcing

https://xcancel.com/Mononofu/status/2080937562739531837
1•theanonymousone•59m ago•0 comments

W4ME Station – a WASM-4 runtime for Java ME phones

https://github.com/mulfyx/w4me-station
2•sqshi•1h ago•0 comments

Codegraph

https://github.com/colbymchenry/codegraph
1•handfuloflight•1h ago•0 comments

Transit advocates mourn Boston transportation planner killed while biking

https://www.wbur.org/news/2026/07/17/louisa-gag-vigil-wu-bike-safety-streets
2•bariumbitmap•1h ago•0 comments

MIT to become hotbed of AI video surveillance

https://www.schneier.com/blog/archives/2026/07/mit-to-become-hotbed-of-ai-video-surveillance.html
8•SanjayMehta•1h ago•1 comments

AIs and Humans with Agency by David Mumford

https://www.dam.brown.edu/people/mumford/blog/2026/AIs%20with%20Agency.html
1•sxzygz•1h ago•0 comments

Interlock: Proving a secret moved, instead of guessing that it might

https://yashwanthreddymali.com/blog/interlock-exfiltration-at-runtime/
2•yashwxnth•1h ago•0 comments

Astrallist

https://www.astrallist.com/
4•kushthedev•1h ago•0 comments

95CSS: A Windows 95-style CSS framework

https://github.com/YoshiMannaert/95CSS
1•gurjeet•1h ago•0 comments

JEP 538: PEM Encodings of Cryptographic Objects

https://openjdk.org/jeps/538
1•0x54MUR41•1h ago•0 comments

Kimi K3 after a week of real project use: what works, what doesn't

https://chenchen.guru/blog/kimi-k3-first-impressions/
3•eongchen•1h ago•0 comments

They Tried to Put Me Back in Jail [video]

https://www.youtube.com/watch?v=CCpQw1Uhu38
4•fortran77•1h ago•1 comments

Candid Camera: Rude Computer

https://www.youtube.com/watch?v=NAeQ-krLiXY
2•noncoml•1h 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.