{"id":19573296,"url":"https://github.com/11belowstudio/ce213-ninesquaresolver","last_synced_at":"2026-05-13T22:31:47.030Z","repository":{"id":98944516,"uuid":"266192494","full_name":"11BelowStudio/ce213-NineSquareSolver","owner":"11BelowStudio","description":"This is the thing I made for my CE213 Artificial Intelligence assignment. Basically, it's a nine square solver that uses bidirectional breadth first search. and it go nyoom.","archived":false,"fork":false,"pushed_at":"2020-05-22T19:47:09.000Z","size":11,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-09T03:45:15.815Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/11BelowStudio.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}},"created_at":"2020-05-22T19:33:13.000Z","updated_at":"2022-11-08T22:31:20.000Z","dependencies_parsed_at":null,"dependency_job_id":"8ed4bd1d-ab25-4e4b-a8f4-16a2094f5076","html_url":"https://github.com/11BelowStudio/ce213-NineSquareSolver","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/11BelowStudio%2Fce213-NineSquareSolver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/11BelowStudio%2Fce213-NineSquareSolver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/11BelowStudio%2Fce213-NineSquareSolver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/11BelowStudio%2Fce213-NineSquareSolver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/11BelowStudio","download_url":"https://codeload.github.com/11BelowStudio/ce213-NineSquareSolver/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240840106,"owners_count":19866168,"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-11-11T06:33:10.482Z","updated_at":"2026-05-13T22:31:41.997Z","avatar_url":"https://github.com/11BelowStudio.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ce213-NineSquareSolver\nThis is the thing I made for my CE213 Artificial Intelligence assignment. Basically, it's a nine square solver that uses bidirectional breadth first search. and it go nyoom.\n\n# what it does\n\nso basically it just solves a 9-square puzzle with an initial state of this:\n```\n8 7 6\n5 4 3\n2 1  \n```\nto a goal state of this: \n\n```\n1 2 3\n4 5 6\n7 8  \n```\nvia bidirectional breadth first search (and outputs the moves taken to get to this state to an output.txt file).\n\nand does it pretty quickly too, which is nice.\n\nyeah that's basically it.\n\n# credits\n\n* Built off some sample code provided by Professor John Gan\n* everything else by me\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F11belowstudio%2Fce213-ninesquaresolver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F11belowstudio%2Fce213-ninesquaresolver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F11belowstudio%2Fce213-ninesquaresolver/lists"}