frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Interconverting Std:Function with Copyable_function

https://quuxplusone.github.io/blog/2026/07/26/function-explosion/
1•jandeboevrie•5m ago•0 comments

JIT for the Code Vectorization Can't Optimize

https://medium.com/@DolphinDB_Inc/beyond-vectorization-dolphindbs-jit-compiler-gets-a-ground-up-r...
1•yiweileng•5m ago•0 comments

A practical partitioner for distributed simulations on sparse dynamic domains

https://dl.acm.org/doi/10.1145/3787521
1•matt_d•6m ago•0 comments

Doing general vibe math in Programming Language Theory

https://twitter.com/TimSweeneyEpic/status/2081458495006634477
1•tosh•6m ago•0 comments

I built a project management tool because every alternative felt too complicated

https://www.simplegantt.net
1•maciekdebiec•7m ago•0 comments

Searching for Robots Is Surprisingly Hard

https://rohboter.com/
1•mrsamramirez10•7m ago•0 comments

Authoritative Dnsmasq in a MikroTik Container

https://op-co.de/blog/posts/mikrotik_authoritative_dnsmasq/
1•jandeboevrie•7m ago•0 comments

EU Fines Google $1.02B for Favoring Its Own Services

https://www.wsj.com/tech/google-fined-1-02-billion-under-eus-tech-antitrust-rules-7e8ae1fb
2•1vuio0pswjnm7•13m ago•0 comments

Waymo Is Racking Up Thousands of Dollars of Parking Fines in Austin

https://www.wsj.com/business/autos/waymo-is-racking-up-thousands-of-dollars-of-parking-fines-in-a...
1•1vuio0pswjnm7•15m ago•0 comments

RedHat 7.2 (2001), Abiword 1.0, & Sanger's Rule towards kernel development

https://inavoyage.blogspot.com/2026/07/redhat-72-2001-abiword-sangers-rule.html
1•initramfs•16m ago•0 comments

Brief Answers to Cosmic Questions (~2000)

https://lweb.cfa.harvard.edu/seuforum/faq.htm
1•tempestn•17m ago•0 comments

F-14A Central Air Data Computer (CADC) FPGA Reconstruction

https://github.com/ATaylorCEngFIET/f14_CADC/
1•starkparker•19m ago•0 comments

Study: Curious robots mimic how children can learn to understand language

https://www.oist.jp/news-center/news/2026/7/24/curious-robots-mimic-how-children-can-learn-unders...
1•giuliomagnifico•20m ago•0 comments

Show HN: Rainslice – AI Employees for Home Services Businesses

https://rainslice.ai
1•edgware674•23m ago•0 comments

Keyboard Shortcuts are my Superpower

https://sightlessscribbles.com/posts/how-keyboard-shortcuts-are-my-superpower/
1•robin_reala•29m ago•0 comments

Amazon Music's Artist Conflation

https://www.jefftk.com/p/amazon-musics-artist-conflation
1•luu•29m ago•0 comments

China Chipmaker CXMT Jumps 472% in Debut After Blockbuster IPO

https://www.bloomberg.com/news/articles/2026-07-26/china-memory-champion-cxmt-set-to-debut-after-...
2•magnio•29m ago•0 comments

Antares: Highly Efficient Open Weight AI Models for Vulnerability Localization

https://blogs.cisco.com/ai/introducing-antares-the-most-efficient-open-weight-ai-models-for-vulne...
1•chillax•31m ago•0 comments

SecretSpec 0.17: Scopes, secrets caching, SOPS, age, and systemd credentials

https://secretspec.dev/blog/secretspec-0-17-scopes-secrets-caching-age-and-systemd-credentials/
1•domenkozar•37m ago•0 comments

Open dataset of i2c addresses and voltages for 50 common boards

https://github.com/i2c-net/i2c-address-dataset
1•chzburgrz•43m ago•0 comments

TIRx: An Open Compiler Stack for Evolving Frontier ML Kernels

https://tvm.apache.org/2026/06/22/tirx
2•EvgeniyZh•51m ago•0 comments

3D Printed Nuclear Reactor [video]

https://www.youtube.com/watch?v=gwRWRDrfrvA
1•flitzofolov•55m ago•1 comments

Tell HN: Leaving your country is your only real leverage

4•julienreszka•57m ago•6 comments

Show HN: Spur solver – Z3-backed model-finder solved values for coding agent

https://github.com/getspur/spur/tree/main/crates/spur-solver
1•mf_kevintruong•57m ago•0 comments

Basilisk: Fast 100% PEP compliant Python type checker

https://www.basilisk-python.dev/
1•theusus•57m ago•0 comments

Psion Emulator – classic Psion palmtops in your browser

https://joehaines.com/psion/
1•randkyp•1h ago•0 comments

The most official water costs $120k a gallon

https://signoregalilei.com/2026/07/26/the-most-official-water-costs-120000-a-gallon/
3•srijan4•1h ago•0 comments

AI Workspace for Your PC

https://stuard.ai
1•Ifesol•1h ago•1 comments

Verisign Cooperative Agreement

https://www.ntia.gov/program/verisign-cooperative-agreement
5•themaxdavitt•1h ago•0 comments

Nvidia in Talks with OpenAI to Guarantee $250B Financing for Data Center

https://www.wsj.com/tech/ai/nvidia-in-talks-with-openai-to-guarantee-250-billion-financing-for-da...
5•taurath•1h ago•1 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.