An Ant Colony Optimization Algorithm for Knight´s Tour Problem on the Chessboard with Holes

Knightpsilas tour problem (KTP) on the chessboard with holes is an especial but interest tour problem. We improve the basic ant colony optimization,and introduce more better pheromone resource update and sharing mechanism,, and find its tour path solutions on the chessboard with holes with the help of colonies sharing the information resource by their intercommunion. We have used the algorithm to encumerate the knightpsilas tours on different chessboard with holes, and made the particular analysis for produce. Experiment results show that the algorithm not only produce the path solutions quickly on the chessboard with holes, but also is easy to control the path starting square and path style.