frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Start all of your commands with a comma

https://rhodesmill.org/brandon/2009/commands-with-comma/
102•theblazehen•2d ago•23 comments

OpenCiv3: Open-source, cross-platform reimagining of Civilization III

https://openciv3.org/
654•klaussilveira•13h ago•190 comments

The Waymo World Model

https://waymo.com/blog/2026/02/the-waymo-world-model-a-new-frontier-for-autonomous-driving-simula...
944•xnx•19h ago•550 comments

How we made geo joins 400× faster with H3 indexes

https://floedb.ai/blog/how-we-made-geo-joins-400-faster-with-h3-indexes
119•matheusalmeida•2d ago•29 comments

What Is Ruliology?

https://writings.stephenwolfram.com/2026/01/what-is-ruliology/
38•helloplanets•4d ago•38 comments

Unseen Footage of Atari Battlezone Arcade Cabinet Production

https://arcadeblogger.com/2026/02/02/unseen-footage-of-atari-battlezone-cabinet-production/
48•videotopia•4d ago•1 comments

Show HN: Look Ma, No Linux: Shell, App Installer, Vi, Cc on ESP32-S3 / BreezyBox

https://github.com/valdanylchuk/breezydemo
228•isitcontent•14h ago•25 comments

Jeffrey Snover: "Welcome to the Room"

https://www.jsnover.com/blog/2026/02/01/welcome-to-the-room/
14•kaonwarb•3d ago•18 comments

Monty: A minimal, secure Python interpreter written in Rust for use by AI

https://github.com/pydantic/monty
219•dmpetrov•14h ago•114 comments

Show HN: I spent 4 years building a UI design tool with only the features I use

https://vecti.com
329•vecti•16h ago•143 comments

Sheldon Brown's Bicycle Technical Info

https://www.sheldonbrown.com/
378•ostacke•19h ago•94 comments

Hackers (1995) Animated Experience

https://hackers-1995.vercel.app/
487•todsacerdoti•21h ago•241 comments

Microsoft open-sources LiteBox, a security-focused library OS

https://github.com/microsoft/litebox
359•aktau•20h ago•181 comments

Show HN: If you lose your memory, how to regain access to your computer?

https://eljojo.github.io/rememory/
286•eljojo•16h ago•167 comments

An Update on Heroku

https://www.heroku.com/blog/an-update-on-heroku/
409•lstoll•20h ago•276 comments

Vocal Guide – belt sing without killing yourself

https://jesperordrup.github.io/vocal-guide/
21•jesperordrup•4h ago•12 comments

Dark Alley Mathematics

https://blog.szczepan.org/blog/three-points/
87•quibono•4d ago•21 comments

PC Floppy Copy Protection: Vault Prolok

https://martypc.blogspot.com/2024/09/pc-floppy-copy-protection-vault-prolok.html
59•kmm•5d ago•4 comments

Where did all the starships go?

https://www.datawrapper.de/blog/science-fiction-decline
4•speckx•3d ago•2 comments

Delimited Continuations vs. Lwt for Threads

https://mirageos.org/blog/delimcc-vs-lwt
31•romes•4d ago•3 comments

How to effectively write quality code with AI

https://heidenstedt.org/posts/2026/how-to-effectively-write-quality-code-with-ai/
251•i5heu•16h ago•194 comments

Was Benoit Mandelbrot a hedgehog or a fox?

https://arxiv.org/abs/2602.01122
15•bikenaga•3d ago•3 comments

Introducing the Developer Knowledge API and MCP Server

https://developers.googleblog.com/introducing-the-developer-knowledge-api-and-mcp-server/
56•gfortaine•11h ago•23 comments

I now assume that all ads on Apple news are scams

https://kirkville.com/i-now-assume-that-all-ads-on-apple-news-are-scams/
1062•cdrnsf•23h ago•444 comments

Why I Joined OpenAI

https://www.brendangregg.com/blog/2026-02-07/why-i-joined-openai.html
144•SerCe•9h ago•133 comments

Learning from context is harder than we thought

https://hy.tencent.com/research/100025?langVersion=en
180•limoce•3d ago•97 comments

Understanding Neural Network, Visually

https://visualrambling.space/neural-network/
287•surprisetalk•3d ago•41 comments

I spent 5 years in DevOps – Solutions engineering gave me what I was missing

https://infisical.com/blog/devops-to-solutions-engineering
147•vmatsiiako•18h ago•67 comments

Show HN: R3forth, a ColorForth-inspired language with a tiny VM

https://github.com/phreda4/r3
72•phreda4•13h ago•14 comments

Female Asian Elephant Calf Born at the Smithsonian National Zoo

https://www.si.edu/newsdesk/releases/female-asian-elephant-calf-born-smithsonians-national-zoo-an...
29•gmays•9h ago•12 comments
Open in hackernews

Show HN: Color Me Same – A new kind of logic game

https://color-me-same.franzai.com/
35•franze•6mo ago

Comments

pimlottc•6mo ago
https://en.m.wikipedia.org/wiki/Lights_Out_(game)
pryelluw•6mo ago
Neat game. Needs levels and milestones in order to keep me motivated. How about a theme as well? Maybe adjustable difficulty. Overall, good start.
HeavyStorm•6mo ago
Good implementation, but this puzzle had been invented many times before.
satisfice•6mo ago
After level 10 the levels are all the same?
franze•6mo ago
Thanks for the bug report!

Found it: the puzzle generator had a "parity check" that only allowed clicking each tile once. On a 3x3 grid (9 tiles), this capped all puzzles at 9 moves maximum, even though levels 10-20 were supposed to require 10-20 moves.

The root cause: We were using binary logic (clicked/not-clicked) in a game with 3-color cycling. With 3 colors, each tile can be usefully clicked up to 2 times before returning to its original state.

fix v1.87.0: Changed from binary parity to tracking actual click counts, allowing each tile to be clicked (colors - 1) times. This enables up to 18 moves on a 3x3 grid, exactly as pyt correctly calculated!

Now levels properly progress: - Levels 1-18: 3x3 grid (max 18 moves) - Levels 19-32: 4x4 grid (max 32 moves) - Levels 33+: 5x5 grid (max 50 moves)

Thanks for playing!

refulgentis•6mo ago
Too hard to play, felt like it told me what to do for 3 levels then got impossible
ethan_smith•6mo ago
This is a variant of the "Lights Out" puzzle which has interesting mathematical properties related to linear algebra over GF(2) and can be solved systematically using Gaussian elimination.
ghostly_s•6mo ago
Aren't the rules basically the same as Conway's Life as well?
mkl•6mo ago
Not at all: https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life#Rules, https://en.wikipedia.org/wiki/Lights_Out_(game)
stoneman24•6mo ago
A long time ago, I solved a 5 by 5 version of this with a genetic algorithm. Wasn’t the most efficient way.

As you say, Gaussian elimination can be used for a more systematic approach.

chihuahua•6mo ago
I have no idea what the rules are. There is no explanation at all. At one point, the label "Tutorial levels 1-3" appeared on the screen for about 0.5 seconds and disappeared before I could click on it.

I have no idea how this is supposed to work.

xtracto•6mo ago
I feel it would be better to start cycling 2 colors, so that you naturally "catch" the reasoning you have to do. Then keep adding colors.

It reminds me of the dual n-back game, where you had to remember N steps before of 2 things. You start with 1-back and progress once you "get it".

As it is now, I just couldn't "get" what was the required reasoning behind this puzzle, before I got frustrated and left. And the hints didn't give me nothing personally, because once you get it, it basically solves it, without actually helping you understand the reasoning process.

Also similar to Sudoku... if you start with a difficult one, you just get lost. You have to learn the reasoning tricks.

franze•6mo ago
will do the 2 colors for starters after my business meeting right now.
franze•6mo ago
done
xtracto•6mo ago
Tried it and definitely worked!
boothby•6mo ago
It appears to be "lights out" with more states. https://en.m.wikipedia.org/wiki/Lights_Out_(game)
Timwi•6mo ago
Remind me never to play Mao with you lol
franze•6mo ago
i improved the tutorial and also added a proper flip effect so that it is now more clear what happens!!! working on a how to play tutorial also
franze•6mo ago
added a "how to play" section plus more clear tutorial - the "flip-over" effect of the tiles helps to I think
siberianbot•6mo ago
> A new kind of logic game

Until you find the pattern.

Also all level after Level 10 becomes the same.

franze•6mo ago
Fixed it. The level 10 bug, not the finding the pattern.
pyt•6mo ago
RGR / GBG / RGR would be the final level if the game progressed beyond 10, it requires 18 clicks to solve. All other states can be solved in fewer than 18 clicks.
franze•6mo ago
grid gets bigger over time

  - Levels 1-18: 3x3 grid (max 18 moves)
  - Levels 19-32: 4x4 grid (max 32 moves)
  - Levels 33+: 5x5 grid (max 50 moves)
retsibsi•6mo ago
I like it! I'm curious how the target move count (the one used to calculate the efficiency score) is determined. I thought it was the minimum number of moves required, but then I solved a puzzle in 5/7 moves for 140% efficiency.

edit: I then got a level 8 puzzle that could be solved in just 3 moves! I wonder if this is a deliberate possibility, or an issue with the puzzle generator/classifier?

franze•6mo ago
the math is hard. bascically the level generator starts with a solved grid and then does "reversed clicks", so yeah, there might always be cases where there are faster solutions, but I try to minimize the propability of these cases.
vrighter•6mo ago
you aren't really trying to minimize anything. I just wrote a simple gaussian elimination solver that generates all N solutions (the win condition is that all the cells are the same color, not a specific one) and then chooses the one with the least moves. It is optimal. It pretty much always gets over 200% efficiency.

I can't really say that your calculation is off, just that you're not doing one at all.

Maybe try not asking chatgpt to do it for you...

vrighter•6mo ago
Why does it take a whole second after each click for it to update?
franze•6mo ago
should not be, what browser / environment? there is some math after each move to check if the level is still solvable. not all states are solvable (in all grid sizes) but it should be pretty fast.
vrighter•6mo ago
That should be it then. You shouldn't need to do that after each move. You should do that once at the beginning of a game, and if it's solvable on the first move, it's solvable for any configuration that can be reached by applying moves.

Ex. if there are 4 colors, and I clicked once, I can click 3 times to get to my original state. Therefore if you prove one configuration solvable, then, given that I can always reverse my own moves to get back to that state, it means all configurations are (that can be reached in the current game).

tldr: any move on a solvable grid, will result in another solvable grid.

tosh•6mo ago
I like the look and feel.

I did not really get how the mechanic works. Once I got how the mechanic works I did not get how I can use it to solve it.

That said: I would have said the same about a rubik's cube with a 10s attention span.

precompute•6mo ago
This isn't new. This is exactly the same as "Flip" from Simon Tatham's Portable Puzzle Collection.

Play here: https://www.chiark.greenend.org.uk/~sgtatham/puzzles/js/flip...

vrighter•6mo ago
Other post: https://news.ycombinator.com/item?id=44712829
tamacun•6mo ago
Just curious, did you see my post before starting this project?

https://news.ycombinator.com/item?id=44091036

https://tincture-574568295911.us-west1.run.app/