Snake Egg Sums
(Published on 7. July 2020, 17:39 by logopolys)
A snake of width 1 has to be drawn into the grid. The head and tail of the snake are not given. The snake may not touch itself orthogonally, but it can touch itself diagonally. The rest of the cells without the snake or black cells form exactly nine orthogonally connected areas, one of each size from 1 to 9. These areas may not touch each other orthogonally, but they can touch diagonally. Such an area of size n contains the digit n repeated in each of its cells. (So the 1 area contains one 1, the 2 area contains two 2s, etc.)
The snake may touch the black squares without restriction. The numbered areas can be bound by snake and/or black squares.
The numbers of the top of the puzzle represent the sums of the columns below. Snake cells have no number and are effectively treated as zeros. The two X variables are the same ungiven value. Not all sums are given.
Penpa Link
The snake may touch the black squares without restriction. The numbered areas can be bound by snake and/or black squares.
The numbers of the top of the puzzle represent the sums of the columns below. Snake cells have no number and are effectively treated as zeros. The two X variables are the same ungiven value. Not all sums are given.
Penpa Link
Solution code: Row 5 followed by column 5, as a single 20-digit string. Count snake squares as "0".
Last changed on on 12. July 2020, 05:49
Solved by NikolaZ, dm_litv, zorant, jessica6, Zzzyxas, ropeko
