It should be solvable: there is a similar chess problem called the Knight's tour, where a Knight tries to visit every square on the board once and only once.