frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

The Other Leverage in Software and AI

https://tomtunguz.com/the-other-leverage-in-software-and-ai/
1•gmays•1m ago•0 comments

AUR malware scanner written in Rust

https://github.com/Sohimaster/traur
2•sohimaster•3m ago•0 comments

Free FFmpeg API [video]

https://www.youtube.com/watch?v=6RAuSVa4MLI
2•harshalone•3m ago•1 comments

Are AI agents ready for the workplace? A new benchmark raises doubts

https://techcrunch.com/2026/01/22/are-ai-agents-ready-for-the-workplace-a-new-benchmark-raises-do...
2•PaulHoule•8m ago•0 comments

Show HN: AI Watermark and Stego Scanner

https://ulrischa.github.io/AIWatermarkDetector/
1•ulrischa•8m ago•0 comments

Clarity vs. complexity: the invisible work of subtraction

https://www.alexscamp.com/p/clarity-vs-complexity-the-invisible
1•dovhyi•9m ago•0 comments

Solid-State Freezer Needs No Refrigerants

https://spectrum.ieee.org/subzero-elastocaloric-cooling
1•Brajeshwar•10m ago•0 comments

Ask HN: Will LLMs/AI Decrease Human Intelligence and Make Expertise a Commodity?

1•mc-0•11m ago•1 comments

From Zero to Hero: A Brief Introduction to Spring Boot

https://jcob-sikorski.github.io/me/writing/from-zero-to-hello-world-spring-boot
1•jcob_sikorski•11m ago•0 comments

NSA detected phone call between foreign intelligence and person close to Trump

https://www.theguardian.com/us-news/2026/feb/07/nsa-foreign-intelligence-trump-whistleblower
5•c420•12m ago•0 comments

How to Fake a Robotics Result

https://itcanthink.substack.com/p/how-to-fake-a-robotics-result
1•ai_critic•12m ago•0 comments

It's time for the world to boycott the US

https://www.aljazeera.com/opinions/2026/2/5/its-time-for-the-world-to-boycott-the-us
1•HotGarbage•13m ago•0 comments

Show HN: Semantic Search for terminal commands in the Browser (No Back end)

https://jslambda.github.io/tldr-vsearch/
1•jslambda•13m ago•1 comments

The AI CEO Experiment

https://yukicapital.com/blog/the-ai-ceo-experiment/
2•romainsimon•14m ago•0 comments

Speed up responses with fast mode

https://code.claude.com/docs/en/fast-mode
3•surprisetalk•18m ago•0 comments

MS-DOS game copy protection and cracks

https://www.dosdays.co.uk/topics/game_cracks.php
3•TheCraiggers•19m ago•0 comments

Updates on GNU/Hurd progress [video]

https://fosdem.org/2026/schedule/event/7FZXHF-updates_on_gnuhurd_progress_rump_drivers_64bit_smp_...
2•birdculture•20m ago•0 comments

Epstein took a photo of his 2015 dinner with Zuckerberg and Musk

https://xcancel.com/search?f=tweets&q=davenewworld_2%2Fstatus%2F2020128223850316274
8•doener•20m ago•2 comments

MyFlames: View MySQL execution plans as interactive FlameGraphs and BarCharts

https://github.com/vgrippa/myflames
1•tanelpoder•21m ago•0 comments

Show HN: LLM of Babel

https://clairefro.github.io/llm-of-babel/
1•marjipan200•21m ago•0 comments

A modern iperf3 alternative with a live TUI, multi-client server, QUIC support

https://github.com/lance0/xfr
3•tanelpoder•23m ago•0 comments

Famfamfam Silk icons – also with CSS spritesheet

https://github.com/legacy-icons/famfamfam-silk
1•thunderbong•23m ago•0 comments

Apple is the only Big Tech company whose capex declined last quarter

https://sherwood.news/tech/apple-is-the-only-big-tech-company-whose-capex-declined-last-quarter/
2•elsewhen•26m ago•0 comments

Reverse-Engineering Raiders of the Lost Ark for the Atari 2600

https://github.com/joshuanwalker/Raiders2600
2•todsacerdoti•28m ago•0 comments

Show HN: Deterministic NDJSON audit logs – v1.2 update (structural gaps)

https://github.com/yupme-bot/kernel-ndjson-proofs
1•Slaine•31m ago•0 comments

The Greater Copenhagen Region could be your friend's next career move

https://www.greatercphregion.com/friend-recruiter-program
2•mooreds•32m ago•0 comments

Do Not Confirm – Fiction by OpenClaw

https://thedailymolt.substack.com/p/do-not-confirm
1•jamesjyu•32m ago•0 comments

The Analytical Profile of Peas

https://www.fossanalytics.com/en/news-articles/more-industries/the-analytical-profile-of-peas
1•mooreds•32m ago•0 comments

Hallucinations in GPT5 – Can models say "I don't know" (June 2025)

https://jobswithgpt.com/blog/llm-eval-hallucinations-t20-cricket/
1•sp1982•33m ago•0 comments

What AI is good for, according to developers

https://github.blog/ai-and-ml/generative-ai/what-ai-is-actually-good-for-according-to-developers/
1•mooreds•33m ago•0 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/