Rules: There are a few trees in the given area of the jungle. Start in one of the trees( represented by circles), write the number 1 on that tree, and find a path, numbering the trees visited in ascending order. The path can move only horizontally or vertically through adjacent cells, and all cells must be visited exactly once. The path must end in a circle.
Shaded cells cannot be visited. The path cannot visit more than 2 empty cells between two consecutively visited trees. Three or more trees visited consecutively cannot all be in the same row or column. Some trees are already numbered.
The "three or more trees" constraint there isn't needed. Removing it would seem to make the rules more elegant.
ReplyDeleteI knew that. However, one can always design a puzzle where the rule makes sense.
ReplyDelete