I even don’t know where I heard of this question but I’ve been thinking about it and I’m not sure how I should approach this.
Consider a chess board (8*8) and the king in leftest and downest squire. This king wants to go to the rightest and upest square . this king is only interested in moving toward his goal , so if he wants to move from his place he always choose between going “RIGHT” “UP” "NORTH EAST (on diagonal)” .there is no coming back. He wants to go to rightest and upest square as we mentioned. How can we calculate possible ways of him doing it ?
At first I tried to estimate the longest way possible (which is 14) if we just use our right and left option . Moving on diagonal is a faster approach.every move on diagonal take two moves if we just use left and right . Everytime we use an extra diagonal move we reduce two right or left moves So we if we choose
0 diagonal move we have 14 right or left
1 diagonal moves we have 12 right or left
2 diagonal moves we have 10 right or left
7diagonal moves we have 0 right or left
If I want to calculate the first one with 0 diagonal move and 14 right and left logically I have 7 rights and 7 lefts to use but if my first move is right i have 7 possible ways to go up and if i take two rights at first I have 7 absolutely different ups to go. How should I even write this in combination language? If we use 1 diagonal move it’s even worse , how can we calculate where in the road should we do that ?
I’m really lost Please answer or help me answer it.
Thank you guys