An evolution search algorithm for solving N-queen problems
by Bah-Hwee Gwee, Meng-Hiot Lim
International Journal of Computer Applications in Technology (IJCAT), Vol. 24, No. 1, 2005

Abstract: This paper explores evolution search algorithm for solving the N-queen problem. It will be shown how simple mechanisms of selection, reproduction and mutation can be effective in solving the N-queen problem. Simulation of the search algorithm for N up to 2000 has been achieved on a personal computer. The algorithm is robust and is capable of exploring multiple solutions to the N-queen problem. Solutions beyond the first solution uncovered are achieved without significant additional overhead.

Online publication date: Thu, 23-Jun-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com