A true no-no-gram

Question

This is a nonogram with the usual rules. That is, you must fill white squares in with black so that the numbers at the head of each row or column indicate, in order, the respective lengths of sequences of black squares in that row or column.
…except that I've committed a no-no.  There are four ambiguous squares in the diagram: seemingly, either a specific two of them or the other two can be colored black.  Normally that means the nonogram is unsolvable.  In this case, though, you'll find that only one of those possibilities yields a valid solution.

Bass · Accepted Answer

Here's the grid as far as it solves (with absolutely basic solving techniques only, there are several "full" rows and columns, so you can only get stuck if you make a mistake):

Obviously, the remainder is supposed to be solved by

but since OP foiled any plans of creating a clean image by using dotted lines that don't stop the paint bucket tool, it'll take a moment to transfer the result into some more suitable format that

Here's the cleaned-up picture of the variation that scans. It leads to some kind of rabbit hole, it seems.

It's way past my bedtime, so I won't be delving any deeper today.
Here's the discovered image with some (hopefully helpful) annotations:

although there might be a simpler way to group them:

A true no-no-gram

One Answer

Add your own answers!

Ask a Question