frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Bitchat

https://bitchat.free/
1•mikecarlton•55s ago•0 comments

YD Shomer – Runtime SQL validator for PHP with security suggestions

https://github.com/yd-shomer/php-shomer
1•hm-iti26•1m ago•1 comments

If Calendly had gorgeous video backgrounds

https://timetuna.com
1•pavelk2•1m ago•0 comments

Unix Fourth Edition

http://squoze.net/UNIX/v4/README
1•dcminter•1m ago•0 comments

Bitchat: Jack Dorsey's Bluetooth Messaging Experiment

https://42zero.org/bitchat-jack-dorseys-bluetooth-messaging-experiment/
1•mikecarlton•2m ago•0 comments

Font with Built-In Syntax Highlighting (2024)

https://blog.glyphdrawing.club/font-with-built-in-syntax-highlighting/
1•california-og•2m ago•0 comments

We Just Unredacted the Epstein Files

https://krassencast.com/p/breaking-we-just-unredacted-the-epstein
1•Kaibeezy•3m ago•0 comments

Continuously hardening ChatGPT Atlas against prompt injection attacks

https://openai.com/index/hardening-atlas-against-prompt-injection/
1•Tomte•4m ago•0 comments

Got my first sales before running out of sacings

https://sololaunches.com
1•Sharanxxxx•4m ago•1 comments

Is gravitational time dilation a form of computational latency?

https://zenodo.org/records/18027729
2•Jonghwa_Lee•5m ago•1 comments

Show HN: A tiny work log that generates performance review summaries

https://jotchain.com/
1•morozred•6m ago•0 comments

Show HN: Claude Code Skills Playground

https://skillsplayground.com
1•jackculpan•6m ago•0 comments

SimQA a fun little game to simulate QA strategies

https://www.desplega.ai/tools/simqa
1•pls-dnt-deploy•8m ago•0 comments

Track your Claude Code carbon footprint

https://weeatrobots.substack.com/p/claude-carbon-ai-footprint
1•djgrant•8m ago•0 comments

Toilet Rats: Rare, but There

https://www.nytimes.com/2025/12/21/us/washington-flooding-toilet-rats.html
2•mistersquid•15m ago•1 comments

Show HN: I built a tool to clear my YouTube's "Watch Later" Video Graveyard

https://recapio.com/
2•nikhonit•15m ago•0 comments

Gouing, Going, Gone

https://zhaoxo.substack.com/p/gouing-going-gone
1•shrinkzxo•21m ago•0 comments

Bloom: an open source tool for automated behavioral evaluations

https://www.anthropic.com/research/bloom
2•maluta•23m ago•0 comments

I learned to stop worrying and love AI slop

https://www.technologyreview.com/2025/12/23/1130396/how-i-learned-to-stop-worrying-and-love-ai-slop/
2•fleahunter•23m ago•0 comments

Why Scientists Are Performing Brain Surgery on Monarchs

https://www.nytimes.com/video/science/earth/100000010574028/why-scientists-are-performing-brain-s...
1•quapster•24m ago•1 comments

Amazon to offer DRM-free ePub and PDF downloads for Kindle titles in January

https://kdp.amazon.com/en_US/help/topic/GDDXGH9VR22ACM8U
1•KoftaBob•24m ago•0 comments

Show HN: A place to make predictions that are worth surviving in the simulation

https://prediction.danilofiumi.com/
1•danilofiumi•25m ago•0 comments

AI Representation Risk and the Emerging Requirement for Audit-Grade Evidence

https://zenodo.org/records/18031821
2•businessmate•25m ago•1 comments

Classical billiards can compute (2d billiard systems are Turing complete)

https://arxiv.org/abs/2512.19156
1•nabla9•25m ago•0 comments

Show HN: White Collar Agent = a computer-use AI agent with TUI interface

https://github.com/zfoong/WhiteCollarAgent
1•zfoong•34m ago•0 comments

Jupyter, ChatGPT, Copilot (Part 2): The Technical Guide to Jupyter Setup

https://omid.dev/2025/12/23/jupyter-technical-setup-guide/
1•omidfarhang•35m ago•0 comments

Are We Loong Yet?

https://areweloongyet.com/en/
2•todsacerdoti•35m ago•1 comments

Some Epstein files can be unredacted

https://old.reddit.com/r/law/comments/1ptlms6/some_epstein_files_can_be_unredacted/
8•amarcheschi•37m ago•2 comments

Zed: Dev Containers Support

https://zed.dev/docs/dev-containers
1•ahamez•39m ago•0 comments

1WebAnalytics, a Looker Alternative for Google Analytics

https://1webanalytics.com/
1•aleks5678•39m ago•1 comments
Open in hackernews

Generating Mazes with Inductive Graphs (2017)

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

Comments

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