"we can't block yellow into being a rectangle so either the snake ends in the yellow corner (yellow itself, or just above it), or the numbers aren't all the same (which implies that the snake ends in pink)"
the snake must end in the yellow corner if all the numbers are the same
meaning red and blue cells are nonsnakes
and if we have the other side of those bars as also nonsnakes, there is a problem because then the 1s don't see the same thing
some stuff we know about the number the 1s can see: C9 & C10 both must see >=7, so R1 & R2 both must see >=7, so C1 & C2 both must see >=7, so R10 must see >= 7, so R9 must see >=7
(I can explain the logic for any of those if needed)
okay, so D is at least 5, right? because it has to be a non-rect. if it is 6 or greater, then it E has to either be the snake or 8 or greater, which I'm not sure will fit? maybe?
I got a proof that if R5C9 is non-snake, then the snake can't escape down C8, because then g & b can't both be non-rect. Currently looking for a way to extend this logic to either rule out escaping down C8 entirely (and maybe C9), or rule out R5C9 as non-snake