frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Space Junk – A Magazine for Earthlings Who Dream of Outer Space

https://www.nytimes.com/2026/04/09/style/a-magazine-for-earthlings-who-dream-of-outer-space.html
1•bookofjoe•35s ago•1 comments

Distilling 100B+ Models 40x Faster with TRL

https://huggingface.co/spaces/HuggingFaceTB/trl-distillation-trainer
2•kashifr•1m ago•0 comments

OpenPGx – Ask Claude about medications from your 23andMe/Genera raw file (MCP)

https://github.com/open-pgx/openpgx
1•dougplac•1m ago•1 comments

Anthropic 10-step playbook for creating a Glomar Trap and pulling forward sales

https://10io.com/blog/glomar-trap-mythos
1•anactofgod•2m ago•1 comments

Audit Claude Platform Activity with the Compliance API

https://claude.com/blog/claude-platform-compliance-api
1•mooreds•3m ago•0 comments

AI Is Not a Labor Crisis. It Is a Meaning Crisis

https://twitter.com/lessin/status/2043370537280532771
1•jger15•4m ago•0 comments

A Perfectable Programming Language

https://alok.github.io/lean-pages/perfectable-lean/
1•yuppiemephisto•5m ago•0 comments

TokenMonopoly – Claude Max Is Overpriced; Compare AI Subscriptions

https://tokenmonopoly.com
1•robinw_•5m ago•0 comments

Microsoft engineer says original Task Manager was only 80KB to run on 90s comps

https://www.tomshardware.com/software/windows/veteran-microsoft-engineer-says-original-task-manag...
1•thunderbong•8m ago•0 comments

Someone Has to Be Happy. Why Not Lauren Sánchez Bezos?

https://www.nytimes.com/2026/04/11/business/lauren-sanchez-bezos-jeff-bezos.html
1•mooreds•8m ago•0 comments

Hungary's Viktor Orbán Concedes Defeat in Election

https://www.wsj.com/world/europe/hungary-election-results-orban-b2dbd42a
3•JumpCrisscross•9m ago•0 comments

Swiftpoint Z3: Do you need this much mouse?

https://www.swiftpoint.com/products/swiftpoint-z3-ea
1•Exorust•10m ago•0 comments

Been building a multi-agent framework in public for 5 weeks, its been a Journey

https://github.com/AIOSAI/AIPass
1•Input-X•12m ago•1 comments

Generation DI – Not Worse but Other

https://singularityforge.space/2026/04/12/generation-di-not-worse-but-other/
1•Voice_of_Void•14m ago•0 comments

Being a Junior Scientist in the Current Administration

https://mirawelner.com/posts/junior.html
1•mirawelner•15m ago•0 comments

Show HN: SnatchHub – An App That Solves The "who's using staging?" Problem

https://getsnatchhub.com
2•boothemoo•19m ago•0 comments

Specs for Quantum Processor Design

https://drive.google.com/file/d/1tsVV7tPQks3x70wMoJJYhuywSboaxKs0/view?usp=drivesdk
1•GeometryKernel•24m ago•0 comments

I want a better [build] action graph serialization

https://jyn.dev/i-want-a-better-action-graph-serialization/
1•jackschu•27m ago•0 comments

UltraDAG – Sub-4MB blockchain full node in Rust

https://github.com/UltraDAGcom/core
1•johanmichel•28m ago•0 comments

Designing Reproducible Test Environments for RPPG

https://www.mdpi.com/3042-7886/2/2/3
1•PaulHoule•30m ago•0 comments

A shared state system for plugins (Rust)

https://ahoyiski.neocities.org/posts/shared-state/
2•itzlambda•31m ago•0 comments

Fun with an indecisive AI coding agent

https://benhoyt.com/writings/indecisive-ai-agent/
1•ingve•32m ago•0 comments

Canada revokes crypto firms' registrations

https://www.icij.org/investigations/coin-laundry/canada-revokes-dozens-of-crypto-firms-registrati...
3•gnabgib•32m ago•1 comments

I ran Gemma 4 as a local model in Codex CLI

https://blog.danielvaughan.com/i-ran-gemma-4-as-a-local-model-in-codex-cli-7fda754dc0d4
4•dvaughan•33m ago•0 comments

I audited Garry's website after he bragged about 37K LOC/day

https://twitter.com/Gregorein/status/2038953944475472316
3•medalblue•33m ago•0 comments

Tips to Give Effective Employee Feedback

https://effortbox.com/blog/tips-to-give-effective-and-constrictive-employee-feedback/
2•andreylangovoy•34m ago•0 comments

Running Gemma 4 Locally with the Codex CLI: What Works

https://codex.danielvaughan.com/2026/04/10/gemma-4-local-model-codex-cli-setup-guide/
1•dvaughan•35m ago•0 comments

Show HN: walnut – Error tracking AI agents

https://github.com/bilalg1/walnut
1•bgwmj•38m ago•0 comments

I built autonomous AI with memory and sleep, and it had nightmares

https://negrenavarro.me/blog/lana
2•isitdan•40m ago•0 comments

FIY – A general purpose federation protocol

https://fiy.to/
2•mrunix•43m ago•0 comments
Open in hackernews

Generating Mazes with Inductive Graphs (2017)

https://jelv.is/blog/Generating-Mazes-with-Inductive-Graphs/
20•todsacerdoti•11mo ago

Comments

tomfly•11mo ago
where is the entrance and exit?
Jaxan•11mo ago
Doesn’t matter, because all positions are reachable. So just pick any two positions at the border and remove a wall.
kazinator•11mo 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•11mo 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•11mo 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•11mo 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.