Walks, Paths and Connectivity · Challenge problem

A $4\times2$ "ladder" graph has a top path $1,2,3,4$, a bottom path $5,6,7,8$, and four rungs $15,26,37,48$. How many paths of the shortest possible length join vertex $1$ to the diagonally opposite vertex $8$?