Question 20
Eight squares are numbered as shown. A jump from square $m$ to square $n$ has length $|m-n|$.
Starting at square 0, a frog jumps to other squares, each jump having length 1, 2 or 4, without visiting any square more than once. What is the largest possible total jump length?
Starting at square 0, a frog jumps to other squares, each jump having length 1, 2 or 4, without visiting any square more than once. What is the largest possible total jump length?