Logic Masters Deutschland e.V.

quiero más pairrows

(Published on 25. January 2025, 15:30 by aqjhs)

This puzzle came to life thanks to Gene and him hosting a setting contest around the pairrow constraint(s). I did manage to finish this one in time to submit, and it got a place. 🥹 🥇

  • Samurai sudoku rules apply: for each grid place the digits 1-6 once each in every row, column and region. Shared regions conform to both grids' sudoku.
  • Two arrows of the same color on a cell with a digit D point to cells D spaces (not cells) away, one for each direction of the arrows, and those two digits follow the corresponding rules:
    • Red (Renban): the digits along with D make a set of three different consecutive numbers in any order.
    • Blue (Modulo): the digits are in the same residue class modulo D.
    • Green (Difference): the difference of the digits is equal to D.
    • Yellow (Sum): the sum of the digits is equal to D.
  • Not all possible pairrows are given.

Online in Sudokupad

Note: Two numbers are in the same residue class modulo D when they have the same remainder when divided by D.

See also:

Solution code: Column 2 top to bottom (12 digits)

Last changed on on 26. January 2025, 04:57

Solved by Vodakhan , brimmy, SKORP17, AKropki, tuturitu, DubiousMobius, earthpuzzles
Full list

Comments

on 26. January 2025, 23:17 by DubiousMobius
Really lovely cross grid play here. Thanks again!

on 26. January 2025, 04:57 by aqjhs
Clarification for the pairrow rule: the empty spaces between grids count. For example, r6c2 is three spaces away from r9c5.

Last changed on 26. January 2025, 05:01

on 26. January 2025, 00:50 by AKropki
Very nice puzzle!
I was confused as to whether the "non-cell" spaces was supposed to count when crossing between grids.
I eventually found out by the logic of the puzzle, so if it is meant to be like that, good job! Otherwise it would be nice to have clarified more in the rules :)

***

Yes, they do count, hope the clarification helps.

Difficulty:3
Rating:N/A
Solved:7 times
Observed:1 times
ID:000LFV

Puzzle variant

Enter solution

Solution code:

Login