{"id":14964044,"url":"https://github.com/smoothex/markov-decision-processes","last_synced_at":"2026-02-05T08:02:04.171Z","repository":{"id":153134221,"uuid":"503333025","full_name":"Smoothex/Markov-Decision-Processes","owner":"Smoothex","description":"A dungeon crawler game based on the stochastical model of Markov Decision Processes","archived":false,"fork":false,"pushed_at":"2022-08-02T09:34:30.000Z","size":39447,"stargazers_count":0,"open_issues_count":2,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-08T12:32:19.203Z","etag":null,"topics":["game-development","markov-decision-processes","phaserjs","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/Smoothex.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","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":"2022-06-14T11:37:30.000Z","updated_at":"2024-01-03T13:24:36.000Z","dependencies_parsed_at":"2023-05-21T04:00:39.927Z","dependency_job_id":null,"html_url":"https://github.com/Smoothex/Markov-Decision-Processes","commit_stats":{"total_commits":443,"total_committers":12,"mean_commits":"36.916666666666664","dds":0.6907449209932279,"last_synced_commit":"b874d875bce8e8f9848dddcb88ad54811ae5aa3c"},"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/Smoothex/Markov-Decision-Processes","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Smoothex%2FMarkov-Decision-Processes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Smoothex%2FMarkov-Decision-Processes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Smoothex%2FMarkov-Decision-Processes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Smoothex%2FMarkov-Decision-Processes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Smoothex","download_url":"https://codeload.github.com/Smoothex/Markov-Decision-Processes/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Smoothex%2FMarkov-Decision-Processes/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266413357,"owners_count":23924708,"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","status":"online","status_checked_at":"2025-07-22T02:00:09.085Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"robots_txt_url":"https://github.com/robots.txt","online":true,"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":["game-development","markov-decision-processes","phaserjs","typescript"],"created_at":"2024-09-24T13:32:30.852Z","updated_at":"2026-02-05T08:02:04.144Z","avatar_url":"https://github.com/Smoothex.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# This project has been forked from the [MTV](https://www.mtv.tu-berlin.de/menue/home/) GitLab server!\n# You can play the game [here](https://pr.mtv.tu-berlin.de/2021sose-evakuierung)\n# Short demo available [here](https://youtu.be/KSHAEq6LcC4)\n\n### Game description\nA little dungeon crawler game, inspired by a crowd evacuation simulator that was also based on the Markov Decision Process.\nThe fields represent different states that the player can switch to. The probability is implemented by a logic that splits the alien groups depending on which action field the player is standing on.\nThe action fields are all marked accordingly - there are split fields, group fields and death fields.\nThe goal is to reach the exit with as many aliens as possible and within the limit of movements.\n\n### Theoretical background\nThe theoretical concept that this game is based on is called [Markov Decision Processes (MDP)](https://en.wikipedia.org/wiki/Markov_decision_process).\nThe core principle of the mathematical model is to either maximize the reward or the cost by switching states.\nWhile in one particular state, the player can change the state by performing a certain action. The game is decision-making with the different outcomes (when changing a state) being partly random and partly controllable - this is what MDP is mainly used for.\n\n### Credits\n\n| Name    | Role         | \n| ------ | ------------------- | \n| Alexander Steffen    | Product Owner        | \n| Christoph Rauchegger   | Dev        | \n| Georgi Kotsev  | MR Manager        | \n| Kevin Nguyen   | MR Manager       | \n| Momchil Petrov    | Dev      |\n| Phil Neujahr    | Dev  |\n| Krutarth Parwal | Dev |\n| Dennis Korolevych | Scrum Master |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsmoothex%2Fmarkov-decision-processes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsmoothex%2Fmarkov-decision-processes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsmoothex%2Fmarkov-decision-processes/lists"}