An Algorithm of Generalized Knight’s Tour Problem Based on Path Joint

There are a lot of algorithms of knight's tour problem on two-dimensional chessboard, but most of them are hard to extend on N dimensional chessboard. In this paper, knight's tour problem has been considered as looking for Hamiltonian path, a path joint algorithm (PJA) has been given on 2 dimensional chessboard, a few conceptions such as path adjacency matrix and related theorems have been presented. The path joint algorithm is also applied to N dimensional chessboard. For an N dimensional chessboard L= l
₁
× l
₂
× ⋯l
_N
, the algorithm's time complexity is O(L
⁴
) if find all knight's tours while the algorithm's time complexity is O(L
³
) if find one knight's tour for 2 fixed vertexes, this matched the experimental result.