Earlier this month MattYDdraig celebrated their birthday, and since they've always tested a number of my quite mathematical puzzles, I thought I'd share my appreciation by making something new, mathematical, and a little ambiguous for them. That puzzle was rushed and a little sloppier than I'd have liked, so after reworking it, I think it's worth sharing with a larger audience now.
The Rules:
Example Puzzles:
Here's an example puzzle, and its solution. The greatest product formed by any adjacent pairs is shown.
Try This example puzzle using Sven's Sudoku Pad (estimated 2/5 stars difficulty)
Try a smaller 5x5 example puzzle using Sven's Sudoku Pad (estimated 1/5 stars difficulty)
The Puzzle:
Try the Foggy version: or the Fogless version
An Extra Puzzle:
Of course, I had to also consider what about making cages with the smallest product instead. Here's a 6x6 you can try if you're interested:
Lösungscode: Row 4 from left to right
am 18. Juli 2025, 19:13 Uhr von glum_hippo
I had fun! It's easier with the fog, I reckon.
am 18. Juli 2025, 11:09 Uhr von Yawnus
Very nice idea and well executed! The extra puzzle was fun too!
am 17. Juli 2025, 16:25 Uhr von Franjo
Very good math puzzle! I solved the foggy version, gave 3.5*, but I‘m not sure whether this is more difficult than the cleared one. Thank you very much for creating and sharing this wonderful puzzle.
am 17. Juli 2025, 06:12 Uhr von Nylimb
That was very nice! And some of the reasoning felt familiar, since I just published a puzzle with a somewhat similar constraint, 000O7K.
Schwierigkeit: | ![]() |
Bewertung: | 88 % |
Gelöst: | 26 mal |
Beobachtet: | 3 mal |
ID: | 000O8O |