Daily Akari 😊 482
✅2026-05-02 (Sat)✅
🎯 73% 🕓 23:25
https://dailyakari.com/
Made a thoughtless mistake right at the start 😖
Daily Akari 😊 482
✅2026-05-02 (Sat)✅
🎯 73% 🕓 23:25
https://dailyakari.com/
Made a thoughtless mistake right at the start 😖
My approach was to block everything that was impossible until there was only 1 possible option for a given row or column.
For example, counting rows top to bottom and columns left to right: The symbol in r1, c2 blocks the cells around it, so place x in r1, c1; r2, c2; and r1, c3. Now you can see that r1, c1 and r1, c3 can only be filled by placing lights in rows 2 or 3. So you can x out the entirety of rows 2 and 3 except for those 4 options (r2, c1; r3, c1; r2, c3; r3, c3). Now you have to play r4, c2).
The next steps are slightly more complex but very similar. If you’re interested and can follow the above notation, I can list my steps for you.
Alternatively, you can wait until Ezra posts his solution and watch him play: https://www.youtube.com/channel/UCYO63sn0QN-IdT7DtSy3L8g
Finally got it (through the archive), and my time is 21:54 but that does not include the time I spent on it yesterday.
I think I was doing something similar to what you described, but basically tried to brute force it from that point on and that wasn’t working for me, until it did. I’ll have to look into more techniques to try in the future.