Just draw the table of the number of ways to get to a given square. This is similar to #4:
/// /// /// /// 393 /// /// ///
/// /// /// 126 141 126 /// ///
/// /// 30 45 51 45 30 ///
/// 4 10 16 19 16 10 4
/// 1 3 6 7 6 3 1
/// /// 1 2 3 2 1 ///
/// /// /// 1 1 1 /// ///
/// /// /// /// 1 /// /// ///
We start at E1 and go to E8. Ways which don't lead to E8 are left out. Just sum the possible connection from rank 2 to 8.
Just draw the table of the number of ways to get to a given square. This is similar to #4:
/// /// /// /// 393 /// /// ///
/// /// /// 126 141 126 /// ///
/// /// 30 45 51 45 30 ///
/// 4 10 16 19 16 10 4
/// 1 3 6 7 6 3 1
/// /// 1 2 3 2 1 ///
/// /// /// 1 1 1 /// ///
/// /// /// /// 1 /// /// ///
We start at E1 and go to E8. Ways which don't lead to E8 are left out. Just sum the possible connection from rank 2 to 8.
