Solving N Queen Problem using Genetic Algorithm

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/5768

Full metadata record

DC Field	Value	Language
dc.contributor.author	Farhan, Ahmeed Suliman	-
dc.date.accessioned	2022-10-23T21:22:17Z	-
dc.date.available	2022-10-23T21:22:17Z	-
dc.date.issued	2015-07	-
dc.identifier.issn	0975 – 8887	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/5768	-
dc.description.abstract	This paper, explain solution to find the 92 solution of nQueen problem based on GA (Genetic Algorithm). The nQueen 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	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Computer Applications	en_US
dc.subject	N-Queen Problem,	en_US
dc.subject	Genetic Algorithm (GA), Swarm Intelligence (SI)	en_US
dc.title	Solving N Queen Problem using Genetic Algorithm	en_US
dc.type	Article	en_US
Appears in Collections:	مركز الحاسبة الالكترونية

Files in This Item:

File	Description	Size	Format
pxc3905005 (1).pdf		443.99 kB	Adobe PDF	View/Open