Logic Masters Deutschland e.V.

Base 2 (Dynamic Fog)

(Published on 28. March 2026, 15:12 by Hanks)

I tried to build a puzzle using this ridiculous rule: "the value of a cell equals 2 to the power of N, where N is the digit in the cell". Thanks to FIT7Y, northernwhale, and many others for testing. I hope you enjoy the puzzle!

Rules:

Fill the grid with the digits 0-8 such that every row, column, and 3x3 box contains each digit exactly once. The value of a cell equals 2 to the power of N, where N is the digit in the cell. Note that 2 to the power of 0 equals 1.

KROPKI DOTS: values of cells separated by a white dot are consecutive. Values of cells separated by a black dot are in a 1:2 ratio.

XV: values of cells separated by an X sum to 10. Values of cells separated by a V sum to 5.

ARROWS: values of cells on an arrow MAY repeat, and must sum to the value of the cell containing the attached circle.

GERMAN WHISPER LINES: values of adjacent cells on a green line have a difference of at least 5.

REGION SUM LINES: box borders divide blue lines into segments. The sum of values of cells on each segment is the same. The sum may be different for different blue lines.

KILLER CAGES: values of cells in a cage MAY repeat, and must sum to the given cage total in the leftmost cell of the topmost row of the cage.

DYNAMIC FOG: entering a correct digit clears fog in its cell, and may or may not clear fog in other cells.

Solve online

Solution code: Digits in row 4

Last changed on on 28. March 2026, 15:23

Solved by ademjaz, lutzreimer, wjdrumm, hardline35, SKORP17, 3ColorTheorem, Myfyr MJ, DominicT, ole-1995a, Prepared Jester, CitrusGremlin, djorr, ad1643, Bence1997, Chilimy, Down Atroc1ous, killje, gdc, ... cat, Noa, TimNN, RevJB, fred_DT, cjb111, dr.Bunsen, AloneWake, qlr, kasperd, cabbage_has_exploded, RKZ621, DillyK, ShuffBeeeell, OGRussHood, Deathranger999, Johan111, valacd, fryguy1013, abinchen
Full list

Comments

on 6. September 2026, 17:18 by dr.Bunsen
Great puzzle! I found the innovative power of 2 mechanics rather straightforward, but at one point I got stuck with two possibilities and coudld't rule out either of them. I had to fork, using pencilmarks carefully to avoid clearing the fog. One fork led me to a contradiction in few steps. Apparently I must have missed something.

on 5. September 2026, 09:00 by s1mn
One of my favourite puzzles of all time. Such a great construction, and really fun to solve. Thanks!

on 4. September 2026, 22:11 by ch3ka
Wow, I'm fairly familiar with the powers of two, but those were some weird and wonderful deductions to make.

on 22. April 2026, 00:26 by bleppie
I like how you changed everything to base 2 but kept the kropki/german/cage rules the same. Mixes things up. Like others have said, if you're familiar with binary this isn't too bad. Thanks!

on 2. April 2026, 22:31 by drharib0
Excellent setting and fun solve. I guess it’s two stars if you’re familiar with binary arithmetic.

Very enjoyable

on 31. March 2026, 20:50 by EvaristeLogic
Great puzzle thank you! The base 2 region sum lines are fantastic :)

on 31. March 2026, 15:45 by EvaristeLogic
Great puzzle thank you! The base 2 region sum lines are fantastic :)

on 30. March 2026, 07:41 by thomamas
Silly and clever. I vote for two star as well, wasn't as hard as I expected.

on 29. March 2026, 08:40 by Chaossudokusplease
Very fun, wouldn’t mind another base 2 puzzle to play with this idea some more

on 28. March 2026, 21:35 by CitrusGremlin
Fun puzzle! Lots of silly logic. I think 2 stars is the correct difficulty, but only if you are already familiar with the 2^n series and binary shenanigans.

on 28. March 2026, 19:34 by Myfyr MJ
Tough, no way this is 2 star surely?

Last changed on 28. March 2026, 17:37

on 28. March 2026, 17:37 by hardline35
Wow, it was not so easy but solvable. Nice puzzle, thank you!

on 28. March 2026, 16:35 by wjdrumm
Really interesting idea!

on 28. March 2026, 15:47 by ademjaz
Very enjoyable, thanks!

Difficulty:3
Rating:94 %
Solved:164 times
Observed:4 times
ID:000S2S

Enter solution

Solution code:

Login