It is possible for a Knight to cover all the 64 squares, starting from its original position, without repeating any square. This obviously requires 63 moves. Now take 2 white Knights at their original positions on a blank board. They are on a journey to cover all the 64 squares without repeating any square. They move in sequence in such a manner that they are never in attacking position. What is the maximum number of moves till then they avoid the attacking position? Can it be solved analytically?