A DNA Algorithm of Horse Traversing Problem Based on Adleman Model

Horse traversing problem was a hard problem to solve with traditional computer; and there were no efficient algorithms to solve this problem with traditional computer when the measurement of problem was very great. In order solve this problem, the extended horse traversing problem was transformed into directed Hamilton path problem, and was solved by using Adleman DNA computing model. A DNA algorithm was introduced to solve this kind of problems through an instance on a chess-board, the experiment steps were also given; at the same time, the solution of the instance was got by simulation experiment. At last, the complexity of the algorithm was illustrated.