Combining Meta-Heuristics to Solve the Rook Problem

Abstract

The combination of various meta-heuristics to solve NP-hard problems has great potential to produce good results. Ant algorithms and multi-agent system are proposed to solve a chess problem. The problem is about how to place n rooks on a chessboard so that they are all mutually non-attacking. The introduced algorithms produce reasonable results and have several advantages. A combination between the two meta-heuristics is presented and some possible crossover improvements of the proposed algorithms are suggested