Logic Masters Deutschland e.V.

Magically promoting to bishop

(Published on 24. November 2021, 17:54 by Udo Spemyn)

Long rules, but maybe my best puzzle so far. I hope it's understandable.

Normal Sudoku rules apply.

Digits in cells sum to the total in the top left.

Place 3 interconnected magical squares in the grid.

5s are kings; no two cells only a kings move apart contain two 5s.

2s and 8s are knights; no two cells only a knight's move apart contain two 2s or two 8s

4s are white pawns moving upwards, 6s are black pawns moving downwards.

They attack the upper (white pawns, 4) or the lower (black pawns, 6) 2 diagonally adjacent cells.

When they reach the last row (R1 for 4s, R9 for 6s), they are promoted to bishops and attack the diagonal now.

The attack is blocked by any other chess piece (2,4,5,6,8).

No cell attacked by a 4 contains a 4, and no cell attacked by a 6 contains a 6.

No King (5) is attacked by any chess move from 4s or 6s.

No King (5) is attacked by a knight (2 or 8) that is located in Box 2, 5 and 8 (grey).

Here are 4 examples of rules. Red means not allowed, green means allowed.

Play here: F-Puzzles

Solution code: Row 1 from left to right, then Row 2 from left to right.


Solved by CastleSheepside
Full list

Comments

on 24. November 2021, 23:49 by Udo Spemyn
Spoiler: Start with how 3 interconnected magic squares could even be placed in a Sudoku grid

Last changed on 24. November 2021, 19:38

on 24. November 2021, 19:37 by Udo Spemyn
@10feet yes, that's why the knight is in red, so incorrect in this case. The one in Box 7 is also a knight's move away from 5, but outside of the middle, and therefore green and allowed.
The 4 examples in the grid are independent of each other.

Last changed on 24. November 2021, 18:49

on 24. November 2021, 18:46 by 10feet
In your example, isn't the king (5) in box 4 attacked by the knight (8) in box 5?

I think your example makes things more confusing.

Difficulty:3
Rating:N/A
Solved:1 times
Observed:10 times
ID:0008DI

Puzzle variant

Enter solution

Solution code:

Login