17. A moving point moves on the integer points in the first quadrant of the Cartesian coordinate system (including the integer points on the $x$-axis and $y$-axis of the first quadrant), with the movement rules being $(m, n) \rightarrow(m+1, n+1)$ or $(m, n) \rightarrow$ $(m+1, n-1)$. If the moving point starts from the origin and reaches the point $(6,2)$ after 6 steps, then there are $\qquad$ different movement paths.
$\begin{array}{l}\text { 17. } 9 \\ C_{6}^{2}-C_{6}^{1}=9\end{array}$

The translation is as follows:

$\begin{array}{l}\text { 17. } 9 \\ C_{6}^{2}-C_{6}^{1}=9\end{array}$

Note: The original text is already in a mathematical format, which is universal and does not require translation. However, if you intended to have the problem statement or any surrounding text translated, please provide that context.