By Topic

Solving n-Queen problem using global parallel genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bozikovic, M. ; Fac. of Electr. Eng. & Comput., Zagreb Univ., Croatia ; Golub, M. ; Budin, L.

This paper shows a way in which genetic algorithms can be used to solve the n-Queen problem. Custom chromosome representation, evaluation function and genetic operators are presented. A global parallel genetic algorithm is also demonstrated as a possible way to increase GA speed. Results are shown for several large values of n and several conclusions are drawn about solving NP problems with genetic algorithms.

Published in:

EUROCON 2003. Computer as a Tool. The IEEE Region 8  (Volume:2 )

Date of Conference:

22-24 Sept. 2003