Very nice and satisfying, but I would suggest ramping up the difficulty a little faster. I got until lvl 15 by just flipping the obvious areas, taking no more than 2 seconds. It's otherwise very cool and minimalist.
Edit: limiting it to square flips was a great idea. There are just enough moves to make the answer non-obvious (after lvl 15), but not so many possible moves that you get overwhelmed.
---
Edit 2: I just remembered I made a similar "game"[1], where you select columns to XOR with other columns and try to reach the target pattern. Use the scroll wheel and shift+wheel to change the pattern and size.
That was actually part of a real research project in optimizing circuits for computing binary finite fields, where the "game" was a sandbox to try different algorithms. The best algorithm was actually found by someone playing in this sandbox and coming up with an efficient strategy.
I like it. Played a bunch of levels. I could feel my brain learning new patterns (like the card game Set). There are a handful of really useful primitives.
i have a strong quibble about calling this XOR. XOR takes two arguments and one of the arguments here is implicit. The game inverts the square colors, which XORing with "1" will do, but it's not defined whether white or black is 1, it just inverts white and black.
The game is quite fun. But it seems the difficulty ramp quite late? It's not very difficult to get the answer with least step by solve the side first until about last 20 levels.
Also, the game does give you a hint about how to bruteforce the level if you only have one square left. Good job.
30 comments
[ 4.1 ms ] story [ 46.0 ms ] threadEdit: limiting it to square flips was a great idea. There are just enough moves to make the answer non-obvious (after lvl 15), but not so many possible moves that you get overwhelmed.
---
Edit 2: I just remembered I made a similar "game"[1], where you select columns to XOR with other columns and try to reach the target pattern. Use the scroll wheel and shift+wheel to change the pattern and size.
That was actually part of a real research project in optimizing circuits for computing binary finite fields, where the "game" was a sandbox to try different algorithms. The best algorithm was actually found by someone playing in this sandbox and coming up with an efficient strategy.
[1] https://boppreh.com/source/playreduce/
edit: found a way to solve it in 6, but not in 4
—-
Edit: and the right answer was so obvious, too
[0] https://www.hidden-mirrors.com
https://en.wikipedia.org/wiki/Lights_Out_(game)
https://archive.org/details/Quadromania_1987_CP_Verlag_de-en...
Also, the game does give you a hint about how to bruteforce the level if you only have one square left. Good job.
Well done!