In the past few days, I was experimenting with a new constraint I imagined. However, making the puzzle hold was not easy and I had a few failed attemps. Eventually, I came up with this construction, it's quite hard so I'm looking forward to make an easier version so that everyone can enjoy this constraint.
Good luck on solving this one!
Rules:
Here is the puzzle:
Hope you enjoy it! Any feedback is highly appreciated!
Solution code: Row 9 (9 digits)
today, 19:06 by PierreTombal
I had some difficulty understanding the rules, figuring that "some of the first digits" might also be 0 digits in at least one of the directions and/or a blue square 5 could also be created from a [1,6] in the row and a [1,2] in the column. The correct interpretation turns out to be that in every orthogonal direction you must have a set of digits that average to the value in the square.
I found the break-in extremely hard to see. Eventually I resorted to creating two versions of the grid, both of which required further complex evaluations until one of them finally ended in a conflict. Reviewing, I still don't see how to to do it without the trial and error (i.e. bifurcation) method.