Solution of n-Queen problem using ACO

Salabat Khan; Mohsin Bilal; M. Sharif; Malik Sajid; Rauf Baig

doi:10.1109/INMIC.2009.5383157

Solution of n-Queen problem using ACO

Salabat Khan, Mohsin Bilal, M. Sharif, Malik Sajid, Rauf Baig

National University of Computer and Emerging Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

37 Scopus citations

Abstract

In this paper, a solution is proposed for n-Queen problem based on ACO (Ant Colony Optimization). The n-Queen problem become intractable for large values of 'n' and thus placed in NP (Non-Deterministic Polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard chess queen moves. So, in this paper, the proposed solution will be applied to 8-Queen problem. The solution can very easily be extended to the generalized form of the problem for large values of 'n'. The paper contains the detail discussion of problem background, problem complexity, Ant Colony Optimization (Swarm Intelligence) and a fair amount of experimental graphs.

Original language	English
Title of host publication	INMIC 2009 - 2009 IEEE 13th International Multitopic Conference
DOIs	https://doi.org/10.1109/INMIC.2009.5383157
State	Published - 2009
Externally published	Yes
Event	2009 IEEE 13th International Multitopic Conference, INMIC 2009 - Islamabad, Pakistan Duration: 14 Dec 2009 → 15 Dec 2009

Publication series

Name	INMIC 2009 - 2009 IEEE 13th International Multitopic Conference

Conference

Conference	2009 IEEE 13th International Multitopic Conference, INMIC 2009
Country/Territory	Pakistan
City	Islamabad
Period	14/12/09 → 15/12/09

Keywords

8-Queen problem
Ant Colony Optimization (ACO)
Heuristic techniques
Swarm Intelligence (SI)
n-Queen problem

Access to Document

10.1109/INMIC.2009.5383157

Cite this

@inproceedings{ab000cd1981b4a018a334c1c37be6d50,

title = "Solution of n-Queen problem using ACO",

abstract = "In this paper, a solution is proposed for n-Queen problem based on ACO (Ant Colony Optimization). The n-Queen problem become intractable for large values of 'n' and thus placed in NP (Non-Deterministic Polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard chess queen moves. So, in this paper, the proposed solution will be applied to 8-Queen problem. The solution can very easily be extended to the generalized form of the problem for large values of 'n'. The paper contains the detail discussion of problem background, problem complexity, Ant Colony Optimization (Swarm Intelligence) and a fair amount of experimental graphs.",

keywords = "8-Queen problem, Ant Colony Optimization (ACO), Heuristic techniques, Swarm Intelligence (SI), n-Queen problem",

author = "Salabat Khan and Mohsin Bilal and M. Sharif and Malik Sajid and Rauf Baig",

year = "2009",

doi = "10.1109/INMIC.2009.5383157",

language = "English",

isbn = "9781424448722",

series = "INMIC 2009 - 2009 IEEE 13th International Multitopic Conference",

booktitle = "INMIC 2009 - 2009 IEEE 13th International Multitopic Conference",

note = "2009 IEEE 13th International Multitopic Conference, INMIC 2009 ; Conference date: 14-12-2009 Through 15-12-2009",

}

Khan, S, Bilal, M, Sharif, M, Sajid, M & Baig, R 2009, Solution of n-Queen problem using ACO. in INMIC 2009 - 2009 IEEE 13th International Multitopic Conference., 5383157, INMIC 2009 - 2009 IEEE 13th International Multitopic Conference, 2009 IEEE 13th International Multitopic Conference, INMIC 2009, Islamabad, Pakistan, 14/12/09. https://doi.org/10.1109/INMIC.2009.5383157

TY - GEN

T1 - Solution of n-Queen problem using ACO

AU - Khan, Salabat

AU - Bilal, Mohsin

AU - Sharif, M.

AU - Sajid, Malik

AU - Baig, Rauf

PY - 2009

Y1 - 2009

N2 - In this paper, a solution is proposed for n-Queen problem based on ACO (Ant Colony Optimization). The n-Queen problem become intractable for large values of 'n' and thus placed in NP (Non-Deterministic Polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard chess queen moves. So, in this paper, the proposed solution will be applied to 8-Queen problem. The solution can very easily be extended to the generalized form of the problem for large values of 'n'. The paper contains the detail discussion of problem background, problem complexity, Ant Colony Optimization (Swarm Intelligence) and a fair amount of experimental graphs.

AB - In this paper, a solution is proposed for n-Queen problem based on ACO (Ant Colony Optimization). The n-Queen problem become intractable for large values of 'n' and thus placed in NP (Non-Deterministic Polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard chess queen moves. So, in this paper, the proposed solution will be applied to 8-Queen problem. The solution can very easily be extended to the generalized form of the problem for large values of 'n'. The paper contains the detail discussion of problem background, problem complexity, Ant Colony Optimization (Swarm Intelligence) and a fair amount of experimental graphs.

KW - 8-Queen problem

KW - Ant Colony Optimization (ACO)

KW - Heuristic techniques

KW - Swarm Intelligence (SI)

KW - n-Queen problem

UR - http://www.scopus.com/inward/record.url?scp=77950397417&partnerID=8YFLogxK

U2 - 10.1109/INMIC.2009.5383157

DO - 10.1109/INMIC.2009.5383157

M3 - Conference contribution

AN - SCOPUS:77950397417

SN - 9781424448722

T3 - INMIC 2009 - 2009 IEEE 13th International Multitopic Conference

BT - INMIC 2009 - 2009 IEEE 13th International Multitopic Conference

T2 - 2009 IEEE 13th International Multitopic Conference, INMIC 2009

Y2 - 14 December 2009 through 15 December 2009

ER -

Solution of n-Queen problem using ACO

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this