Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

NajiAboo/8QueensProblem

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
3 Commits
 
 
 
 

Repository files navigation

8QueensProblem

Used Evolutionary Algorithm to find the 8 queens problem. Population is initialized with a random unique number between 1 to 8. High quality parents are selected for crossover. Here lower checks count is considered as high quality parent. We used Partially Mapped Crossover and Swap mutate. Once the children are created we add them with the parents and low quality parents are removed from the list. Same process is repeated unit we get a high quality ( number of checks zero ) or if its reaches 10k iterations

Releases

Packages

Contributors

Languages

Morty Proxy This is a proxified and sanitized view of the page, visit original site.