{"id":21434369,"url":"https://github.com/z1skgr/n_queens","last_synced_at":"2026-01-24T11:34:38.626Z","repository":{"id":163130789,"uuid":"314615839","full_name":"z1skgr/N_Queens","owner":"z1skgr","description":"Solving algorithms on N queens problem","archived":false,"fork":false,"pushed_at":"2024-11-07T11:43:20.000Z","size":498,"stargazers_count":2,"open_issues_count":3,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-02T18:12:24.082Z","etag":null,"topics":["chess-board","constraint-satisfaction-problem","eclipse","hill-climbing","java","n-queens-problem","online-algorithms"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/z1skgr.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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}},"created_at":"2020-11-20T16:55:14.000Z","updated_at":"2024-12-19T09:16:59.000Z","dependencies_parsed_at":null,"dependency_job_id":"e2666f3f-b812-4b1d-87c5-0178e9f250b2","html_url":"https://github.com/z1skgr/N_Queens","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/z1skgr/N_Queens","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/z1skgr%2FN_Queens","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/z1skgr%2FN_Queens/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/z1skgr%2FN_Queens/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/z1skgr%2FN_Queens/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/z1skgr","download_url":"https://codeload.github.com/z1skgr/N_Queens/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/z1skgr%2FN_Queens/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28726681,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-24T10:24:43.181Z","status":"ssl_error","status_checked_at":"2026-01-24T10:24:36.112Z","response_time":89,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["chess-board","constraint-satisfaction-problem","eclipse","hill-climbing","java","n-queens-problem","online-algorithms"],"created_at":"2024-11-22T23:35:07.089Z","updated_at":"2026-01-24T11:34:38.611Z","avatar_url":"https://github.com/z1skgr.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# AI application\n\u003e Solving the problem of n queens using AI algorithms studying their performance.\n\n## Table of contents\n* [General Info](#general-information)\n* [Implementation](#implementation)\n* [Setup](#setup)\n* [Screenshot](#screenshot)\n* [Acknowledgements](#acknowledgements)\n\n## General Information\nOn *NxN* chessboard, queens placed at random cells. The problem is solved after queens move to the desired state of the chessboard (no threatened queen). \u003cbr\u003eFor more information, check https://www.geeksforgeeks.org/n-queen-problem-backtracking-3/. \u003cbr\u003e\nIn our approach, we have \n1. Local search \n2. Constraint satisfaction\n\n## Implementation\nWe use `Grid.Java` to represent queens in a board ( __NxN__ grid, queen as binary values)\nGrid is randomly initialized with queens in any columns.\n\n\n### Hill Climbing\n* Available move is a position in which another queen can't intervene (inside the grid).\n* Queens exposed to attacks reflect the conflicts.\n\nFor more information, see https://www.javatpoint.com/hill-climbing-algorithm-in-ai\n\n### Constraint Satisfaction \nIn our view, queen can threat diagonally, vertical and horizontaly (due to mutual collisions between two queens).\n\n* Non-threatened queen by a predecessor (from left-sided queen), stays where she is.\n* Otherwise, finds a row in which he is not bothered by the previous ones. \n    * No such row, then the algorithm will return with the position of the queen who has a problem.\n\nFor more info, see https://en.wikipedia.org/wiki/Constraint_satisfaction\n\n### Performance Measures\n* Average resolution time for N number of repetitions per number\nqueens\n* Average initialization number of the grid to establish the solution.\n* Reliability of the solution.\n* Collision minimization\n\n## Setup\nJava Integrated Development Environment (Eclipse IDE)\n\n## Screenshot\n### Local Search\nhttps://github.com/z1skgr/N_Queens/issues/2#issue-1237707293\n\n### Constaint Satisfaction\n\n\n## Acknowledgements\n- This project was created for the requirements of the lesson Artificial Intelligence\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fz1skgr%2Fn_queens","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fz1skgr%2Fn_queens","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fz1skgr%2Fn_queens/lists"}