[ Post a Response | Puzzles Forum ]
Posted by markr on 24/10/2009, 6:50 pm, in reply to "Solution to example"
Denis said, "the time to do this being proportional to number of triangles."
In fact, with N triangles, 3N is an upper bound (that can't be reached) for the number of moves (including backtracking). You can't move to a triangle more than three times (once forward, and twice backtracking). Triangles on the solution path can't be moved to more thatn twice, and the first and last triangles can't be moved to more than once.
Message Thread:
« Back to thread