Chain of Inception
(Published on 26. February 2022, 18:40 by Garford)
Ruleset:
1. Solve all layers of "Inception" by Matyas Martinka on LMG (Inception).
2. Remove every digit except the digits placed in the stars of the final solution of "Inception".
3. Solve the grid with those givens and the following rules:
Normal sudoku rules apply.
Every pair of orthogonally connected cells must not add to 10. (Negative constraint on the Roman Letter X)
The given greater-than sign in row 3 points towards the lower of the two neighboring digits.
Links:
Solve on F-Puzzles
Solve on CTC-App
Solution code: 18 digits of row 1 followed by row 3 (both read from left to right)
Last changed on on 26. February 2022, 21:04
Solved by Raistlen, Krokant, Rollo, Felis_Timon, thelizardreborn, CHalb, misko, bernhard, moss, zhantyzgz, AlbeyAmakiir, BenceJoful, Jodelbanane, emper0r, SansCipher, Ofri, Hydalin, codewizard, foxreign, ... chameleon, TheNewHolgersson , FHead, Blazsej007, Sewerin, Caeliat, ough, TJReds, Ines, CGeom, emmi123, Madoka42, Spyrfyr, MQ9_Reaper2, Carolin, zrbakhtiar, Calesch, Boh, Shuhua Milk, TVDK
