3 ms·
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
by franze 1y 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 1y agoyou 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...