{"id":26429076,"url":"https://github.com/tornao2/chessproblems","last_synced_at":"2025-03-18T04:53:08.694Z","repository":{"id":238280368,"uuid":"796224678","full_name":"Tornao2/ChessProblems","owner":"Tornao2","description":"Knight's tour and N queen problem solving program using a backtracking algorithm allowing generating the next solution without resetting created in C++ with the \"RayLib\" graphical library","archived":false,"fork":false,"pushed_at":"2024-06-04T09:59:47.000Z","size":206,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-11-18T21:20:57.394Z","etag":null,"topics":["algorithms","cpp","raylib"],"latest_commit_sha":null,"homepage":"","language":"C++","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/Tornao2.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":"2024-05-05T10:15:40.000Z","updated_at":"2024-06-04T09:59:50.000Z","dependencies_parsed_at":"2024-11-19T06:18:15.114Z","dependency_job_id":null,"html_url":"https://github.com/Tornao2/ChessProblems","commit_stats":null,"previous_names":["szyzub/chessproblems","tornao2/chessproblems"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FChessProblems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FChessProblems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FChessProblems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FChessProblems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Tornao2","download_url":"https://codeload.github.com/Tornao2/ChessProblems/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244159988,"owners_count":20408019,"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","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":["algorithms","cpp","raylib"],"created_at":"2025-03-18T04:53:08.048Z","updated_at":"2025-03-18T04:53:08.681Z","avatar_url":"https://github.com/Tornao2.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"Knight's tour and N queen problem solving program using a backtracking algorithm allowing generating the next solution without clean reset created in C++ with the \"RayLib\" graphical library.\n\nSize of the chessboard and the starting position of the first piece can be chosen. When working with 8x8 chessboard algorithms can take quite a bit - especially the knights one depending on the starting position.\n\nDemonstration at:\n\nhttps://www.youtube.com/watch?v=_8Sd4qwD4CY\n\n![MainMenu](https://github.com/SzyZub/ChessProblems/blob/master/ScreenShots/MainMenu.png)\n![SubMenu](https://github.com/SzyZub/ChessProblems/blob/master/ScreenShots/SubMenu.png)\n![KnightAnswer](https://github.com/SzyZub/ChessProblems/blob/master/ScreenShots/KnightAnswer.png)\n![QueenAnswer](https://github.com/SzyZub/ChessProblems/blob/master/ScreenShots/QueenAnswer.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftornao2%2Fchessproblems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftornao2%2Fchessproblems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftornao2%2Fchessproblems/lists"}