{"id":13657559,"url":"https://github.com/inejc/scotland-yard","last_synced_at":"2026-01-22T13:12:58.617Z","repository":{"id":96479919,"uuid":"38105284","full_name":"inejc/scotland-yard","owner":"inejc","description":"Java implementation of the Scotland Yard board game using Monte Carlo Tree Search methods","archived":false,"fork":false,"pushed_at":"2022-09-21T07:57:04.000Z","size":354,"stargazers_count":6,"open_issues_count":1,"forks_count":4,"subscribers_count":4,"default_branch":"master","last_synced_at":"2024-11-10T10:43:46.423Z","etag":null,"topics":["decision-making","monte-carlo","scotland-yard","search","tree"],"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/inejc.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2015-06-26T10:26:42.000Z","updated_at":"2023-04-21T07:32:56.000Z","dependencies_parsed_at":"2023-05-14T10:00:43.205Z","dependency_job_id":null,"html_url":"https://github.com/inejc/scotland-yard","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/inejc%2Fscotland-yard","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/inejc%2Fscotland-yard/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/inejc%2Fscotland-yard/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/inejc%2Fscotland-yard/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/inejc","download_url":"https://codeload.github.com/inejc/scotland-yard/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250544098,"owners_count":21448041,"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":["decision-making","monte-carlo","scotland-yard","search","tree"],"created_at":"2024-08-02T05:00:45.141Z","updated_at":"2026-01-22T13:12:58.610Z","avatar_url":"https://github.com/inejc.png","language":"Java","funding_links":[],"categories":["Java (78)"],"sub_categories":[],"readme":"# Scotland Yard board game using Monte Carlo Tree Search methods\nThis is a Java implementation of the hide-and-seek board game with imperfect information - Scotland Yard. The [mcts](https://github.com/nejc92/mcts) component (dependency) is self-contained, domain-independent and can thus be easily reused in other state-action domains. The project was developed for the purpose of my Bachelor’s thesis.\n\n## Dependencies\nJUnit4, [Monte Carlo Tree Search methods](https://github.com/nejc92/mcts)\n\n## License\nThis project is licensed under the terms of the MIT license. See LICENSE.md.\n\n## Authors\nNejc Ilenič","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Finejc%2Fscotland-yard","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Finejc%2Fscotland-yard","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Finejc%2Fscotland-yard/lists"}