{"id":25171471,"url":"https://github.com/basemax/n-queengenetic","last_synced_at":"2025-10-14T08:04:11.301Z","repository":{"id":151535474,"uuid":"275787988","full_name":"BaseMax/N-QueenGenetic","owner":"BaseMax","description":"Solving N-Queen problem using Genetic Algorithm.","archived":false,"fork":false,"pushed_at":"2020-06-30T00:46:16.000Z","size":575,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-10-14T08:03:19.407Z","etag":null,"topics":["cpp","genetic","genetic-algorithm","genetic-algorithms","genetic-analysis","genetic-programming-algorithm","genetics","n-queen","n-queens","n-queens-completion","n-queens-problem","nqueens","nqueens-algorithm","nqueens-problem","nqueens-problem-solver","nqueens-solution"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BaseMax.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2020-06-29T11:05:10.000Z","updated_at":"2024-11-24T03:25:46.000Z","dependencies_parsed_at":"2023-07-10T14:01:11.299Z","dependency_job_id":null,"html_url":"https://github.com/BaseMax/N-QueenGenetic","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/BaseMax/N-QueenGenetic","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FN-QueenGenetic","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FN-QueenGenetic/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FN-QueenGenetic/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FN-QueenGenetic/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/N-QueenGenetic/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FN-QueenGenetic/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279018303,"owners_count":26086333,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp","genetic","genetic-algorithm","genetic-algorithms","genetic-analysis","genetic-programming-algorithm","genetics","n-queen","n-queens","n-queens-completion","n-queens-problem","nqueens","nqueens-algorithm","nqueens-problem","nqueens-problem-solver","nqueens-solution"],"created_at":"2025-02-09T09:20:35.842Z","updated_at":"2025-10-14T08:04:11.295Z","avatar_url":"https://github.com/BaseMax.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# N-Queen problem using Genetic Algorithm\n\nSolving N-Queen problem using Genetic Algorithm.\n\n## N-Queen Genetic\n\n\u003e The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others.\n\n![N-Queen Genetic](nQueen-solution.png)\n\nThe N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example, following is a solution for 4 Queen problem.\n\n![N-QueenGenetic problem](N_Queen_Problem.jpg)\n\nYou can read an article for N-Queen at [here](article.pdf).\n\nI developed this program in **1 years ago**.\n\n### Using\n\n```\ngit clone https://github.com/BaseMax/N-QueenGenetic\ncd N-QueenGenetic\ng++ N-QueenGenetic.cpp -o nqueen\nEdit QueenGenetic.cpp file and put your board size and number, then;\n./nqueen\n```\n\n### Read more\n\n**Recommended:** Please try your approach on {IDE} first, before moving on to the solution.\n\n- https://www.geeksforgeeks.org/n-queen-problem-backtracking-3/\n- https://www.geeksforgeeks.org/printing-solutions-n-queen-problem/\n\n### Output\n\n```\n[max@base N-QueenGenetic]$ ./nqueen \nPossible Solution #1:\t61528374\nPossible Solution #2:\t63185247\nPossible Solution #3:\t75316824\nPossible Solution #4:\t17468253\nPossible Solution #5:\t51863724\nPossible Solution #6:\t53847162\nPossible Solution #7:\t27581463\nPossible Solution #8:\t63741825\nPossible Solution #9:\t82417536\nPossible Solution #10:\t47526138\nPossible Solution #11:\t63175824\nPossible Solution #12:\t42751863\nPossible Solution #13:\t48531726\nPossible Solution #14:\t62714853\nPossible Solution #15:\t53168247\nPossible Solution #16:\t46827135\nPossible Solution #17:\t71386425\nPossible Solution #18:\t41586372\nPossible Solution #19:\t16837425\nPossible Solution #20:\t64158273\nPossible Solution #21:\t52814736\nPossible Solution #22:\t47531682\nPossible Solution #23:\t36418572\nPossible Solution #24:\t64285713\nPossible Solution #25:\t35841726\nPossible Solution #26:\t58413627\nPossible Solution #27:\t26174835\nPossible Solution #28:\t52617483\nPossible Solution #29:\t41582736\nPossible Solution #30:\t47185263\nPossible Solution #31:\t35286471\nPossible Solution #32:\t52473861\nPossible Solution #33:\t36824175\nPossible Solution #34:\t58417263\nPossible Solution #35:\t63184275\nPossible Solution #36:\t48136275\nPossible Solution #37:\t57248136\nPossible Solution #38:\t36428571\nPossible Solution #39:\t51842736\nPossible Solution #40:\t42857136\nPossible Solution #41:\t74258136\nPossible Solution #42:\t63581427\nPossible Solution #43:\t37286415\nPossible Solution #44:\t25713864\nPossible Solution #45:\t48157263\nPossible Solution #46:\t72418536\nPossible Solution #47:\t51468273\nPossible Solution #48:\t36258174\nPossible Solution #49:\t57263148\nPossible Solution #50:\t36271485\nPossible Solution #51:\t31758246\nPossible Solution #52:\t53172864\nPossible Solution #53:\t15863724\nPossible Solution #54:\t42736815\nPossible Solution #55:\t42736851\nPossible Solution #56:\t83162574\nPossible Solution #57:\t63724815\nPossible Solution #58:\t24683175\nPossible Solution #59:\t62713584\nPossible Solution #60:\t82531746\nPossible Solution #61:\t36814752\nPossible Solution #62:\t84136275\nPossible Solution #63:\t63728514\nPossible Solution #64:\t42861357\nPossible Solution #65:\t57138642\nPossible Solution #66:\t17582463\nPossible Solution #67:\t74286135\nPossible Solution #68:\t57142863\nPossible Solution #69:\t42586137\nPossible Solution #70:\t27368514\nPossible Solution #71:\t46831752\nPossible Solution #72:\t72631485\nPossible Solution #73:\t35714286\nPossible Solution #74:\t36275184\nPossible Solution #75:\t46152837\nPossible Solution #76:\t47382516\nPossible Solution #77:\t64713528\nPossible Solution #78:\t63571428\nPossible Solution #79:\t26831475\nPossible Solution #80:\t73825164\nPossible Solution #81:\t68241753\nPossible Solution #82:\t28613574\nPossible Solution #83:\t73168524\nPossible Solution #84:\t57263184\nPossible Solution #85:\t38471625\nPossible Solution #86:\t37285146\nPossible Solution #87:\t64718253\nPossible Solution #88:\t35281746\nPossible Solution #89:\t57413862\nPossible Solution #90:\t52468317\nPossible Solution #91:\t36815724\nPossible Solution #92:\t25741863\n```\n----\n\n# Max Base\n\nMy nickname is Max, Programming language developer, Full-stack programmer. I love computer scientists, researchers, and compilers. ([Max Base](https://maxbase.org/))\n\n## Asrez Team\n\nA team includes some programmer, developer, designer, researcher(s) especially Max Base.\n\n[Asrez Team](https://www.asrez.com/)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fn-queengenetic","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2Fn-queengenetic","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fn-queengenetic/lists"}