Logic Masters Deutschland e.V.

above the clouds

(Published on 17. March 2025, 07:57 by aqjhs)

So gdc launched a prompt to make puzzles using the equal split lines he and sujoyku have created.

  • Normal sudoku rules apply.
  • Dots divide lines into segments with equal sums. Digits may not repeat within a segment.
  • The value of a cell on a line is equal to the sum of its segment. The value of a cell not on any line is equal to the digit on it.
  • The values on columns and rows, read in both directions, make a total of 36 nine-digit numbers. Outside clues show the rank in ascending order among those 36 numbers for the indicated column or row in the direction of the clue. There are no ties in rank.

Online in Sudokupad

See also:

Solution code: Value of the number on rank 12.

Last changed on -

Solved by zhangjinyang, Snookerfan, gdc, Piff, TripleABattery, Joyofrandomness, marcmees, Chishiri, SKORP17, bhambells, Azumagao, brimmy, kublai, mnasti2, littlebluue, mercierus, cegie, jinkela114514, brewring, dogfarts, Julianl, roflsalot, lmdemasi, Scojo, karlmortenlunna, jmw, Innocuous, Frank Puzzles, biorycbyd, Cryccu, Yiab
Full list

Comments

on 4. April 2025, 22:51 by Innocuous
What a fantastic ruleset. It felt daunting at first, but it actually unraveled very nicely. I enjoyed this one a lot!

on 21. March 2025, 11:51 by brewring
What an amazing puzzle! Took me a while to get started. I was confused by this part of the ruleset: "The value of a cell on a line is equal to the sum of its segment." I kept reading 'segment' as 'segments' and hence concluded that if, say, a 3-segmented line's sum was 7, then the value of any digit on it would be 3x7=21. But that is my bad. Once I realised my mistake, it flowed smoothly and I enjoyed it thoroughly. Took me a few attempts to submit the solution code as well.

on 17. March 2025, 09:24 by Snookerfan
Very nice! Lovely twist on full rank, which needed some adjustment internally. Thank you

Difficulty:3
Rating:96 %
Solved:31 times
Observed:4 times
ID:000MD8

Puzzle variant

Enter solution

Solution code:

Login