Logic Masters Deutschland e.V.

Alphabet Soup

(Published on 22. January 2023, 23:29 by dennischen)

Each thermo displayed in the right grid must be placed in a unique 3×3 subgrid on the left grid. Moreover, the position of each thermo must not change with respect to its subgrid (meaning no rotation or translation within the subgrid).

Also note that the answer check will only work when the right side is cleared of digits (though you, of course, may consider yourself finished at the time you place the last digit in the left side of the grid).

Try it online at Penpa

Example puzzle:

Example (Penpa)

Solution code: Row 5

Last changed on on 17. March 2024, 02:10

Solved by OutOfMyMindBRB, bodemeister, FinnishGuy
Full list

Comments

on 17. March 2024, 02:10 by dennischen
fix example link

on 13. March 2024, 02:47 by dennischen
Fix link

on 13. May 2023, 05:24 by dennischen
add solution to example puzzle

on 2. February 2023, 22:17 by FinnishGuy
Very clever ruleset, requires very unique logic to solve. Once you get the idea on how this works, it is a really nice solve. Thanks!

on 25. January 2023, 22:45 by dennischen
The right grid is not a real sudoku; it is just a convenient way to display the thermos to be placed on the left grid (the real grid).

on 25. January 2023, 22:22 by faisalaak
on the right grid the position of "1" in box 1&2.has to be in the same row!!. does Sudoku rules apply to both grids or only left one?

on 25. January 2023, 22:13 by dennischen
Forgot a <p> tag again

on 25. January 2023, 22:12 by dennischen
Add <p> tag

on 25. January 2023, 22:12 by dennischen
Added example puzzle.

on 23. January 2023, 20:52 by dennischen
Thank you so much, bodemeister and OutOfMyMindBRB! bodemeister, your puzzles also seem like great, intricate challenges --- I'm trying County Map right now.

on 23. January 2023, 18:26 by bodemeister
Very creative and challenging sudoku! Happy New Year to you as well.

on 23. January 2023, 17:47 by OutOfMyMindBRB
What a mind-bending, challenging & brilliant puzzle!

Thank you :-)

Difficulty:5
Rating:N/A
Solved:3 times
Observed:6 times
ID:000CPH

Enter solution

Solution code:

Login