frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

OPDS – an open syndication standard for electronic documents

https://en.wikipedia.org/wiki/Open_Publication_Distribution_System
1•Curiositry•3m ago•0 comments

Using OpenRouter with the Anthropic Agent SDK

https://openrouter.ai/docs/guides/community/anthropic-agent-sdk
1•arbayi•4m ago•0 comments

Google Now Defaults to Not Indexing Your Content (2024)

https://www.vincentschmalbach.com/google-now-defaults-to-not-indexing-your-content/
1•AznHisoka•4m ago•0 comments

Serpl – a pleasant TUI for regex and fixed-string search and replace

https://github.com/yassinebridi/serpl
2•Curiositry•8m ago•0 comments

Show HN: App to spoof GPS location on iOS without jailbreaking

https://github.com/acheong08/ios-location-spoofer
1•acheong08•15m ago•1 comments

Fish Shell

https://fishshell.com/
3•RyanShook•19m ago•2 comments

Ask HN: How do you catch silent logic bugs that don't crash?

1•vortexshadow•20m ago•0 comments

GTA 6's Dynamic Economy Will Change Open‑World Games Forever

https://techfusiondaily.com/gta-6-dynamic-economy/
2•nelkazzu•25m ago•0 comments

Examplefile – Sample Document File Formats

https://www.examplefile.com/document
1•petethomas•27m ago•0 comments

Show HN: DefendFlow Domain Security Board – live scans of popular sites

1•riyao_lin•30m ago•0 comments

Show HN: Headroom (OSS): Cuts LLM costs by 85%

https://github.com/chopratejas/headroom
1•chopratejas•31m ago•1 comments

Breaking the Linearity Barrier: Recursive Swarms for Long-Horizon AI Engineering

https://www.blankline.org/research/horizon-mode
1•satvikpendem•33m ago•0 comments

Data Activation Thoughts

https://galsapir.github.io/sparse-thoughts/2026/01/17/data_activation/
1•galsapir•36m ago•0 comments

Show HN: My way – 18-agent autonomous workflow for ClaudeCode – issues to deploy

https://github.com/avifenesh/awesome-slash
2•anotherCodder•41m ago•0 comments

The life of a playboy publisher who shaped 20th-century literature

https://www.washingtonpost.com/books/2026/01/09/bennett-cerf-biography-nothing-random-feldman-boo...
1•benbreen•44m ago•0 comments

Revisiting Brat Summer: Artists, politicians, and the summer of 2024

https://thelastwave.substack.com/p/revisiting-brat-summer
2•johanam•44m ago•0 comments

Build Your Own AI Coding Agent (Full Guide) [video]

https://www.youtube.com/watch?v=3GjE_YAs03s
2•kburman•49m ago•0 comments

Umarell – men of retirement age who spend their time watching construction sites

https://en.wikipedia.org/wiki/Umarell
3•gurjeet•50m ago•1 comments

The SaaS Selloff: AI and Interest Rates

https://davefriedman.substack.com/p/the-saas-selloff-ai-and-interest
4•stosssik•52m ago•0 comments

BioNeMo Platform Accelerate AI-Driven Drug Discovery

https://nvidianews.nvidia.com/news/nvidia-bionemo-platform-adopted-by-life-sciences-leaders-to-ac...
1•gmays•53m ago•0 comments

How do I stop participating?

https://geohot.github.io//blog/jekyll/update/2026/01/18/how-do-i-stop.html
7•JuanJohnJames•56m ago•0 comments

AI Sandbox for Claude Code CLI with Node and Python SDKs

https://sandbox.stateset.app
2•domsteil•1h ago•0 comments

You Need More AWS Accounts Than You Think

https://cloudposse.com/blog/you-need-more-aws-accounts-than-you-think
4•mooreds•1h ago•4 comments

Show HN: Gollem – Go framework for agentic AI app with MCP and built-in tools

https://github.com/m-mizutani/gollem
1•masa00•1h ago•0 comments

A new way to call C from Java: how fast is it?

https://lemire.me/blog/2026/01/17/a-new-way-to-call-c-from-java-how-fast-is-it/
1•mfiguiere•1h ago•1 comments

How to Read a Room in 5 Minutes

https://oedmethod.substack.com/p/how-to-read-a-room-in-5-minutes
1•truenfel•1h ago•0 comments

AI and Corporate Capture of Knowledge

https://www.schneier.com/blog/archives/2026/01/ai-and-the-corporate-capture-of-knowledge.html
5•fosco•1h ago•0 comments

Algebra will return to S.F. middle schools after more than a decade

https://www.sfchronicle.com/bayarea/article/algebra-return-sf-middle-schools-21299694.php
1•mikhael•1h ago•0 comments

MIT's Computer Systems Security (2024)

https://css.csail.mit.edu/6.858/2024/
2•barishnamazov•1h ago•0 comments

More HTTP/3 focus, one back end less

https://daniel.haxx.se/blog/2026/01/17/more-http-3-focus-one-backend-less/
2•todsacerdoti•1h ago•0 comments
Open in hackernews

Generating Mazes with Inductive Graphs (2017)

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

Comments

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