4 ms·
Are these always solvable? The handful of 4x4's I've had don't seem to be.
by wingmanjd 2y ago
Are these always solvable? The handful of 4x4's I've had don't seem to be.
- Atiscant 2y agoWith arbitrary generation rules they are surely not. This is a counter example on 4x4: | 1 | 1 | 1 | 1 | | 1 | 3 | 3 | 3 | | 1 | 3 | 2 | 2 | | 1 | 3 | 2 | G | Or | 2 | 2 | 2 | 2 | | 2 | 2 | 2 | 1 | | 2 | 2 | 2 | 2 | | 2 | 1 | 2 | G | This seems to be able to be understood as a reachability graph problem of some sort perhaps. Edit: formatting
- CrazyStat 2y agoI did about 10 4x4s and 6x6s and they were all solvable.
- jumpoddly 2y agoWorth noting, since it was absent in the rules, that it is unnecessary to touch all of the squares.