After a year of setting puzzles, and then leaving them to collect dust once tested, I've finally gotten up the nerve to try uploading one here. Thanks for playing, and I hope you enjoy it!
Shattered Sudoku
Place the digits 1 through 9 into each Row, Column, and 9 cell Region.
The puzzle has been dropped, and the regions have shattered into multiple fragments.
Each 9 cell region was originally a 3x3 box, and its remaining fragments could be rearranged through translation and rotation (but not reflection; they all landed right side up) to form that 3x3 box.
Digits in the cages must sum to the number in the corner of the cage.
Solution code: Row 7 left to right
on 12. March 2025, 17:22 by Rollo
Just to be sure: the rearranged squares don't have to be able to form a valid Sudoku, do they?
---
DM: That's true, thanks for checking! Without an anchor point to determine which box went where (or its rotational orientation) the idea of reassembling a working sudoku sounds like a nightmare.
I have considered doing one of these where some of the pieces are anchored in the 'right' place, but even so scanning feels like it would be tough in the least interesting way.
Sorry for the long answer to a short question. :)
on 3. August 2024, 23:06 by lmdemasi
Great puzzle! The logic was cool, and the irregular sudoku was... irregular.
on 3. August 2024, 18:31 by DubiousMobius
So glad you both enjoyed it! And yeah, that's fair juggler. I definitely think scanning takes on a whole new shape once the regions are split up. Thanks for giving it a go!
on 3. August 2024, 11:10 by juggler
Fantastic puzzle! Very creative, and cool that the jigsaw can be uniquely put back together. I enjoyed the geometric part of the solve, but placing digits was quite tricky for me--that part definitely felt like a 4-star puzzle.
on 3. August 2024, 08:51 by geekpuzzles
Fantastic piece of work. Took me quite a while to solve, but it really fell together at the end.
on 2. August 2024, 15:28 by DubiousMobius
Aha! Thank you juggler, that worked like a charm!
Difficulty: | ![]() |
Rating: | 91 % |
Solved: | 20 times |
Observed: | 10 times |
ID: | 000J67 |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.