There is also no mention of wether or not the 1's need to be adjacent..
So you seem able to do this...
1 1 0 0 0 0 0
0 0 0 0 0 1 1
0 1 1 0 0 0 0
0 0 0 0 0 1 0
0 0 1 0 1 0 0
Where the shortest path would seem to be 16263.
Update: nosbod clarified that the shortest path in the above example would rather be 26365 as you want to jump the least number of columns and not the LEFTMOST route...which would suggest the you could start anywhere on the top row..?
-----In reply to Re: Re: The Matrix
by AcidHawk
in thread The Matrix
by nosbod
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |