2,1,4,3,2,3,4,?

3,2,1,2,3,4,3,?

0,3,2,3,2,3,4,?

2,1,4,3,2,3,4,5
3,2,1,2,3,4,3,4
0,3,2,3,2,3,4,5

Nice problem Tristan!!!!

I'm very sure I've gotten it now. It's based on a square grid pattern, with 0 being the initial square. The numbers of the other squares are equivalent to how many chess-knight moves it takes to get there from the initial square.

Note that a chess knight move is 1 across and two down, or two across and one down, etc.

Edited on August 30, 2005, 10:21 am

Posted by Dimmeh on 2005-08-30 10:20:57