Logic Masters Deutschland e.V.

Those Were the Days

(Published on 5. March 2024, 21:37 by mith)

Those Were the Days
by Philip Newman

Normal sudoku rules apply.
Digits in cages cannot repeat and must sum to the total given.

f-puzzles
SudokuPad

This puzzle is from a series of "nerd snipe" constructions, originally posted on the CTC fan discord server. I recently revisited the "fewest cages" task (see Layla), lowering the cell count to 26 and max cage size to 5.

This is a brutally hard puzzle. Good luck!

Solution code: Row 5, followed by column 5

Last changed on on 8. March 2024, 03:56

Solved by SKORP17, anyeyeball, samuel1997, Playmaker6174, cdwg2000, Ragna, Snookerfan, NB_CN, AvonD, sanabas, Ephen, Vebby, pkratz22, zrbakhtiar, mezkur7, zhangjinyang, lerroyy, PotatoHead21, 5Head, Canyun, Krisonium, quantumquark1, Silverstep, Pulsar, PippoForte, Willy Wonka, Mikemerin
Full list

Comments

on 15. April 2024, 21:29 by 5Head
This is the hardest thing I have ever solved, by 100. I sat for hours doing nothing just to get a pencil mark. I dont think i have been so happy and relived after a puzzle in my entire life. What a fantastic experience. Thank you a million times for setting this beutiful beast.

on 8. March 2024, 03:56 by mith
incorrect label (CTC App -> SudokuPad)

on 7. March 2024, 05:53 by sanabas
Very tough, very impressive.

Last changed on 6. March 2024, 07:39

on 6. March 2024, 07:05 by Playmaker6174
Absolutely insane and relentless. This might take the cake as the new hardest killer sudoku I’ve solved in ages (which isn’t even surprising considering such sparse amount of cages), even much harder than your Layla one xD
(Also I’m glad to witness that such minimal result could exist)

on 6. March 2024, 02:49 by samuel1997
Absolutely brutal! It is 10 times harder than Layla! It is brilliant though!

on 6. March 2024, 01:30 by anyeyeball
Very hard. But also very nice. Adding this to my list of favorites. Thank you!

Difficulty:5
Rating:88 %
Solved:27 times
Observed:7 times
ID:000H71

Puzzle variant Online solving tool

Enter solution

Solution code:

Login