
Any hints as to a simple way that this one can be done? Obviously trying every possibility isn't the answer...
Moderator: Board moderators
I also thought it was obvious, but I am unable to formulate an algorithm for the setfarsight wrote:hmm... I hope this isn't giving it away...
Look at how many turtles are properly in their increasing (not necessary consecutive) order. Then the solution should be obvious.![]()