With many better ideas to choose from(my submissions), this was a surprise third puzzle to be included in that round, while the other two seemed to be deserving. Wonder where it would have scored higher than others.
I was trying to write one that is 'acceptably' immune to uniqueness deductions, which I think takes an effort with this and a few other number placement puzzles. The first attempt had two places where you could exploit uniqueness, will post that some other time. In the one I am posting now, it might not be easy to see any uniqueness shortcuts unless one really looks out for.
Rules: Fill every outlined region with different numbers from 1 to N, where N in is the number of cells in the region. No two adjacent cells can contain the same number. No two cells from different regions sharing a side can both contain the largest number of their corresponding regions.
I was trying to write one that is 'acceptably' immune to uniqueness deductions, which I think takes an effort with this and a few other number placement puzzles. The first attempt had two places where you could exploit uniqueness, will post that some other time. In the one I am posting now, it might not be easy to see any uniqueness shortcuts unless one really looks out for.
Rules: Fill every outlined region with different numbers from 1 to N, where N in is the number of cells in the region. No two adjacent cells can contain the same number. No two cells from different regions sharing a side can both contain the largest number of their corresponding regions.
No comments:
Post a Comment