Rules: Enter numbers 1 to N inside each outlined region where N equals the number of cells in the corresponding region. No two equal numbers can share an edge. Some numbers are already given. When a number 'A' is greater than all other numbers in its region, the following should hold true:
If an adjacent number 'B' from another region is greater, it should be possible to find a sequence that starts in the cell containing 'B', and moves horizontally or vertically through cell centers within the region, and encounters numbers in descending order until the length of the path (number of cells used) is equal to or greater than 'A'. Multiple sequences can overlap and sequences could be subsequences of larger ones. It is possible that a puzzle has no such sequences at all.
About: This puzzle type was invented by Anurag Sahay.
No comments:
Post a Comment