Open Access Open Access  Restricted Access Subscription or Fee Access

Ant n-Queen Solver

Salabat Khan, Mohsin Bilal, Muhammad Sharif, Rauf Baig


Swarm intelligence and evolutionary techniques are heavily used by the researchers to solve combinatorial and NP hard problems. The n-Queen problem is a combinatorial problem which become intractable for large values of ‘n’ and thus placed in NP (Non-Deterministic Polynomial) class problem. In this paper, a solution is proposed for n-Queen problem based on ACO (Ant Colony Optimization). The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place eight queens such that no queen can kill the other using standard chess queen moves. The environment for the ants is a directed graph which we call search space is constructed for efficiently searching the valid placement of n-queens such that they do not harm each other. We also develop an intelligent heuristic function that helps in finding the solution very quickly and effectively. The paper contains the detail discussion of problem background, problem complexity, Ant Colony Optimization (Swarm Intelligence), proposed technique design and architecture and a fair amount of experimental results.


n-Queen Problem, 8-Queen Problem, Heuristic Techniques, Ant Colony optimization (ACO), Swarm Intelligence (SI).

Full Text:


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.