AUSAI
2004
Springer
14 years 23 days ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...