Artificial intelligent assistant

King on chessboard Suppose we have empty chessboard, and king on A1 King can move either up (a1-a2) or right (a1-b1), how many possible routes can king take to arrive at h8? My thoughts are to retrace kings moves backward - ie king can arrive on h8 from either h7 or g8, king can arrive on b1 only from one square - a1. However, when I try simplify/visualise route, it doesnt quite work that way, let me elaborate. Lets take 2x3 board: OO OO XO There is distinctly 3 ways to arrive at OX OO OO By either moving to right, up, up up, right, up or up, up, right However when i count possibilities to arrive: 12 12 11 2*2=4, not 3.. What am I missing here?

Starting from $\langle 0,0\rangle$ and going to $\langle n,m\rangle$ where $n,m$ are nonnegative integers, and under the condition that by each step one of the coordinates increases with $1$ you must make $n+m$ steps in total. Exactly $n$ steps must be elected to be one of the steps where the first coordinate grows.

There are:$$\binom{n+m}n$$ possible selections.

xcX3v84RxoQ-4GxG32940ukFUIEgYdPy b0f76b15b982c94931de62429432109d