Solve It !

Consider a chessboard with a single Rook. A Rook can move any number of square
sideways or forward, but not diagonally.What is the minimum number of moves the Rook needs to make, in order to pass over all the squares on the chessboard and return to the original position?(Take any square as a starting position for the Rook.)