In this paper the NP-complete problems are studied. They contain such important problems as the integer-programming and the Hamiltonian circuit problems which are worth studying but equally difficult to compute. Based on the thought of dividing and conquering-merge, an algorithm is designed, with which the knight's tour on an international chessboard can be quickly found.
