You are standing in the very corner of a 10 X 10 grid of dots. How many different ways are there to get to the opposite corner of the grid? You must travel through every node once, and only once. You cannot travel diagonally, and you may not go outside of the overall perimeter.

I give you another example to prove that there are many ways to proceed:

     1     2     3    4    5    6    7   8   9   10

1   S    R      R   R    R    R   R   R   R   D

2   D    L     L    D   L     D   L     D   L   D

3   R   D     U    D   U    D   U    D    U   D

4   D   L     U     D   U    D   U    D    U   D

5   R   D    U     D   U    D    U    D   U    D

6   D   L    U      D    U    D   U   D   U    D

7   R   D   U       D   U    D   U   D   U    D

8   D   L    U       L    U    L   U    L   U     L

9   R    R    R      R    R    R  R   R    R    D

10  F    L    L       L     L    L   L   L    L     L

D = DOWN; L = LEFT; R = RIGHT; U = UP; S = STARTING POINT; F = FINISHING POINT

Edited on April 20, 2005, 2:30 am

Posted by Jonathan Chang on 2005-04-20 02:27:17