9. (12 points) As shown in the figure, there is a $4 \times 8$ chessboard. Now, a chess piece is placed in the bottom-left corner cell $A$ of the chessboard. It is required that each step can only move one step to the upper right or lower right of the chessboard (for example, from $C$ one step can move to $D$ or $E$). Therefore, the number of different ways to move the chess piece from $A$ to the top-right corner $B$ of the chessboard is $\qquad$.
【Solution】Solution: As shown in the figure,
Jumping to point $C$ has only 1 way,
Jumping to point $D$ has only 1 way, which is $A-C-D$,
Jumping to point $E$ has only 1 way, which is $A-C-E$,
Jumping to point $F$ has 2 ways, which are $A-C-D-F$ and $A-C-E-F$,
Jumping to point $G$ has only 1 way, which is $A-C-D-G$,
Jumping to point $H$ has 3 ways, which are $A-C-D-G-H$, $A-C-D-F-H$, and $A-C-E-F-H$, ...

Therefore, jumping to point $I$ has 2 ways, jumping to point $J$ has $2+3=5$ ways,
Jumping to point $K$ has 3 ways, jumping to point $L$ has $3+5=8$ ways,
Jumping to point $M$ has 5 ways, jumping to point $N$ has $8+5=13$ ways, and jumping to point $B$ has 8 ways. Therefore, the answer is: 8.