also accidentally got this effect:

[SPOILER] I've spent way too much time implementing the simplex algorithm and found out that some optimal solutions are fractional. Now I need another algorithm to walk it back a little toward the integers.

apparently the bug somehow only happens on the itchio page and we can't reproduce it on native or a debug web build. i feel a little vindicated now

You can also close the least recently used tab if their numbers exceeds n. I set it to 5. You don't need much more than that imo.

I did it! The trick turned out to be using another layer of commutators. I first swapped triples, like in the previous picture, then rotated the middle layer, swapped triples in reverse, and got this:

it's possible but hard. i keep messing up extra parts.

I'm trying to isolate the middle parts (so that it only swaps the centers instead of whole "lines" on that image), but I think it might not be possible.

^ (yes, that's the solution to the second part. it's o(log n))

0.007884979248046875 seconds

I just looked up the right solution and apparently it's constant time. Mine is O(log(n)) and hundreds of lines of code, so... it sucks!
But here it is anyway: github.com/sufftea/aoc2...

wait, it was a oneliner in python? give me a break...

i almost went insane writing this

Didn't know about it..
I used some modular arithmetic to find an equation that spits out solutions that work for the x axis, and then used binary search to try them out until I find one that also matches on y.

but i did it.
used a mixture of modular arithmetic and binary search.