{"id":17287427,"url":"https://github.com/adamslevy/rush_hour_solver","last_synced_at":"2025-03-26T17:19:36.595Z","repository":{"id":85612806,"uuid":"49352224","full_name":"AdamSLevy/rush_hour_solver","owner":"AdamSLevy","description":"A rush hour board representation and a breadth first search solver.","archived":false,"fork":false,"pushed_at":"2016-01-10T03:46:38.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-17T22:13:21.582Z","etag":null,"topics":[],"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/AdamSLevy.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}},"created_at":"2016-01-10T03:46:10.000Z","updated_at":"2016-04-11T20:16:36.000Z","dependencies_parsed_at":"2023-03-13T06:05:08.328Z","dependency_job_id":null,"html_url":"https://github.com/AdamSLevy/rush_hour_solver","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AdamSLevy%2Frush_hour_solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AdamSLevy%2Frush_hour_solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AdamSLevy%2Frush_hour_solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AdamSLevy%2Frush_hour_solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AdamSLevy","download_url":"https://codeload.github.com/AdamSLevy/rush_hour_solver/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245699263,"owners_count":20657987,"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":[],"created_at":"2024-10-15T10:02:26.407Z","updated_at":"2025-03-26T17:19:36.569Z","avatar_url":"https://github.com/AdamSLevy.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Rush Hour Solver\n\nBoard.cpp and Board.h define a Rush Hour board class.\nBoardQ.cpp and BoardQ.h define a Queue of Rush Hour boards. This is used by the bread first search.\nbfs.cpp defines a breadth first search which exhausts all possibilities and prints out the shortest solution.\n\n## To run\nRun make. Run rush_hour_solver.\nThe program will solve the hardest known sudoku board and print out the steps. It takes about a minute to solve. The full solution is printed before the program exits.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadamslevy%2Frush_hour_solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fadamslevy%2Frush_hour_solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadamslevy%2Frush_hour_solver/lists"}