CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Solving N Queen Problem using Genetic Algorithm

by Ahmed S. Farhan, Wadhah Z. Tareq, Fouad H. Awad
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 122 - Number 12
Year of Publication: 2015
Authors: Ahmed S. Farhan, Wadhah Z. Tareq, Fouad H. Awad
10.5120/21750-5005

Ahmed S. Farhan, Wadhah Z. Tareq, Fouad H. Awad . Solving N Queen Problem using Genetic Algorithm. International Journal of Computer Applications. 122, 12 ( July 2015), 11-14. DOI=10.5120/21750-5005

@article{ 10.5120/21750-5005,
author = { Ahmed S. Farhan, Wadhah Z. Tareq, Fouad H. Awad },
title = { Solving N Queen Problem using Genetic Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 122 },
number = { 12 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 11-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume122/number12/21750-5005/ },
doi = { 10.5120/21750-5005 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:10:21.071158+05:30
%A Ahmed S. Farhan
%A Wadhah Z. Tareq
%A Fouad H. Awad
%T Solving N Queen Problem using Genetic Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 122
%N 12
%P 11-14
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper, explain solution to find the 92 solution of n-Queen problem based on GA (Genetic Algorithm). The n-Queen problem become a Widespread platform for the AI researcher for implement their intelligence algorithms and try them. The Genetic algorithm used to solve the problem and each chromosome is be a solution for the problem and depending on the steps of the GA, The 92 solution, all possible solution for 8 Queen problem is founded. The represent of each chromosome have been by using one dimension array with size equal 8 contain only the queens which represent a one solution and the empty location are aborted to reduce the searching time.

References
  1. I. Martinjak and M. Golub, "Com-parison of Heuristic Algorithms for the N-Queen Problem", Proceedings of the ITI 2007 29th Int. Conf. on Information Technology Interfaces, June 25, 2007.
  2. K. D. Crawford, "Solving the N-Queens Problem Using GA", In Proceedings ACM/SIGAPP Symposium on Applied Computing, Kansas City, 1992, pages 1039-1047.
  3. Božikovi?, Marko, G. "paralleling genetic algorithm", Faculty of Electrical Engineering and Computing, Zagreb, 22. 05. 2006.
  4. Sloane, Neil J. A. , Number of ways of placing n non attacking queens on n x n board, The On-Line Encyclopedia of Integer Sequences id:A000170, http://www. research. att. com/~njas/sequence,s/A000170, (30. 01. 2007. )
  5. David E. Goldberg, Genetic algori-thms in search, optimization and machine learning, Addison-Wesley Publishing Company Inc. , Reading, MA, 1989.
  6. Kelly D. Crawford, "Solving n Queen problem using genetic algorithms", Tulsa University.
  7. Eric Cantú-Paz, "A summary of research on parallel genetic algorithms", Computer Science Department and The Illinois Genetic Algorithms (IlliGAL), University of Illinois at Urbana-Champaign, cantupaz@uiuc. edu
  8. Eric Cantú-Paz, "A survey of parallel genetic algorithms, Computer Science Department and The Illinois Genetic Algorithms Laboratory", University of Illinois at Urbana-Champaign, cantupaz@illigal. ge. uiuc. edu.
Index Terms

Computer Science
Information Sciences

Keywords

N-Queen Problem 8-Queen Problem Heuristic Techniques Genetic Algorithm (GA) Swarm Intelligence (SI).

Powered by PhDFocusTM