user1105: Suppose the knight is on square X and he wants to get to square Y, and in order to do that he has to move N moves. how big could N be?
Could that be solved using a mathematical equation? Say Nf3 should capture Bg8, could that be solved mathematically without having to take a look and analyze it step by step? is there an equation?

user2271: I think the options are finites (not infinite) is possible calculate all the possible moves from f3 to g8 so the Knight can take the Bishop but its a longest number.
Since the chess board is finite in dimensions (8x8) all the possible moves can be calculated, but off course it will be again a very longest number.

user3445: If the knight cannot touch the same square twice then the answer is 63. See Knight's tour
A coworker of mine wrote the software to determine the route a long time ago.

user70: N can be infinite.  I can always make a zillion knight moves.  So I expect you really want to know the smallest number of moves a Knight needs to get from square A to square B.
Some N's won't work.  A Knight on a1 can't get to b3 in any even number of moves.
One thing we know - if the start and end squares are the same color, it will take an even number of moves.  If they are different colors, it will take an odd number of moves.
It doesn't take long to figure out the longest path on the board (a8 to h1 for example) requires six moves. Note the start and end squares are the same color.  For alternating colors, the requirement is 5 moves, max.
I don't think there will be an equation where one enters the square locations and a single number comes out.

user956: The furthest distance is from one corner to the opposite one.  You can get from a1 to h8 in six moves, for example a1,c2,d4,f3,e5,g6,h8.  There are few pairs of squares that take more than four moves.

1105: <p>Suppose the knight is on square X and he wants to get to square Y, and in order to do that he has to move N moves. how big could N be?</p>

<p>Could that be solved using a mathematical equation? Say Nf3 should capture Bg8, could that be solved mathematically without having to take a look and analyze it step by step? is there an equation?</p>
 2271: <p>I think the options are finites (not infinite) is possible calculate all the possible moves from f3 to g8 so the Knight can take the Bishop but its a longest number.</p>

<p>Since the chess board is finite in dimensions (8x8) all the possible moves can be calculated, but off course it will be again a very longest number.</p>
 3445: <p>If the knight cannot touch the same square twice then the answer is 63. See <a href="http://en.wikipedia.org/wiki/Knight%27s_tour" rel="nofollow">Knight's tour</a></p>

<p>A coworker of mine wrote the software to determine the route a long time ago.</p>
 70: <p>N can be infinite.  I can always make a zillion knight moves.  So I expect you really want to know the smallest number of moves a Knight needs to get from square A to square B.</p>

<p>Some N's won't work.  A Knight on a1 can't get to b3 in any even number of moves.</p>

<p>One thing we know - if the start and end squares are the same color, it will take an even number of moves.  If they are different colors, it will take an odd number of moves.</p>

<p>It doesn't take long to figure out the longest path on the board (a8 to h1 for example) requires six moves. Note the start and end squares are the same color.  For alternating colors, the requirement is 5 moves, max.</p>

<p>I don't think there will be an equation where one enters the square locations and a single number comes out.</p>
 956: <p>The furthest distance is from one corner to the opposite one.  You can get from a1 to h8 in six moves, for example a1,c2,d4,f3,e5,g6,h8.  There are few pairs of squares that take more than four moves.</p>
