Vier Slangen
Divide the grid into four regions of orthogonally connected cells, and fill the grid using the digits 1-9, so that no digit repeats in any row, column, or region. Every region is a snake: a one cell wide path of orthogonally connected cells that does not branch or touch itself orthogonally. Orthogonally adjacent cells in a region must have a difference of at least 4. Digits separated by a white dot must be consecutive. Not all dots are necessarily given.
Click here to start the puzzle
Solution code: Column 5 with dashes between borders (for example 1-23-456).
on 15. November 2026, 18:06 by Freegerator
Fun puzzle thank you!
on 12. November 2026, 10:19 by marty_sears
Difficult for me, but clever! Very impressive that the regions and digits can be entirely forced with just 6 dots and a given 6. But if anyone could pull it off, it was Dorlir!
on 11. November 2026, 02:44 by emoney1374
Fun puzzle!
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.