Logic Masters Deutschland e.V.

Polydivisible Pandigital

(Published on 25. August 2026, 14:40 by lgastako)

Thought I'd try something a little different with this one. I hope you enjoy it. As always, feedback is welcomed and encouraged, so please leave a comment with your thoughts below.

  • Normal Sudoku Rules: Fill each row, column, and 3x3 box with the digits 1-9 once each.
  • White Kropkis/Black Kropkis: Digits in cells separated by a white dot are consecutive. Digits in cells separated by a black dot have a 1:2 ratio.
  • German Whispers: Along green lines, digits must differ from their neighbors by at least 5.
  • Thermometers: Digits along a thermometer strictly increase from the bulb end.
  • Renban: Purple lines contain a non-repeating set of consecutive digits in any order.
  • At every column of row 5, the digits from R5C1 to R5CN, when read as a single number must be divisible by N. eg. if the first three numbers of row 5 were 369 that would satisfy the constraint at column 3 because 3 is divisible by 1, 36 is divisible by 2 and 369 is divisible by 3.

NB. If you are not familiar with polydivisible pandigital numbers and you want to try to figure it out yourself, by all means, give it a shot, but really my intention is that most people will ask Google or AI, either of which will essentially hand you all of row 5.

Play online using Sudokupad

Solution code: Column 4 from top to bottom.


Solved by Pioooooo, m0rkoli, jalebc, StefanSch, L00ping007, Hyoryn, dade, gmart, Ste1729, Mc2, SKORP17, barnacle, ome86, flaemmchen, josemadre, Merovius, Karitsu, lulu614, NeroChaos, Spillo, Elizy, pmatos, echoingiris, Vaurien, drf93, tehbertl, EmX68, anton_anton, FakeCristiano, marco72, plinke, Anthony, michael_787, WhiteWarat, hearnicane, teuthida, ImpasseduPelican, kangaroo, PippoForte, Nagesh, iamignat
Full list

Comments

on 26. August 2026, 01:56 by echoingiris
Das hat mir Spaß gemacht!

on 25. August 2026, 17:28 by StefanSch
Nice!

on 25. August 2026, 16:57 by m0rkoli
Nice puzzle!

Difficulty:2
Rating:88 %
Solved:41 times
Observed:1 times
ID:000UIJ

Enter solution

Solution code:

Login