{"id":21546569,"url":"https://github.com/broderick-westrope/dsa-hex-game","last_synced_at":"2025-03-18T01:00:05.800Z","repository":{"id":168145699,"uuid":"348957129","full_name":"Broderick-Westrope/DSA-Hex-Game","owner":"Broderick-Westrope","description":"A fast-paced turn-based game with several advanced algorithms to verse.","archived":false,"fork":false,"pushed_at":"2022-04-07T21:57:11.000Z","size":300,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-03-15T07:27:31.569Z","etag":null,"topics":["a-star-algorithm","algorithms","astar-algorithm","cpp","data-structures-and-algorithms","hex","hex-game","mcts-algorithm","minimax-algorithm"],"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/Broderick-Westrope.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":"2021-03-18T05:52:44.000Z","updated_at":"2022-04-07T21:56:51.000Z","dependencies_parsed_at":null,"dependency_job_id":"1a444dc2-b1b9-4f02-910a-4bd13eb24a2d","html_url":"https://github.com/Broderick-Westrope/DSA-Hex-Game","commit_stats":null,"previous_names":["broderick-westrope/dsa-hex-game"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Broderick-Westrope%2FDSA-Hex-Game","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Broderick-Westrope%2FDSA-Hex-Game/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Broderick-Westrope%2FDSA-Hex-Game/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Broderick-Westrope%2FDSA-Hex-Game/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Broderick-Westrope","download_url":"https://codeload.github.com/Broderick-Westrope/DSA-Hex-Game/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244135891,"owners_count":20403797,"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":["a-star-algorithm","algorithms","astar-algorithm","cpp","data-structures-and-algorithms","hex","hex-game","mcts-algorithm","minimax-algorithm"],"created_at":"2024-11-24T06:12:43.185Z","updated_at":"2025-03-18T01:00:05.768Z","avatar_url":"https://github.com/Broderick-Westrope.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Hex Game\n\nA fast-paced turn-based game with several advanced algorithms to verse.\n\nThis is a C++ implementation of the traditional [Hex board game](https://en.wikipedia.org/wiki/Hex_(board_game)) as seen on [lutanho.net](http://www.lutanho.net/Play/hex.html). This was my sibmission for the first assignment in Data Structures \u0026 Algorithms at WSU. Although the game itself is simple, it includes pathfinding and game playing algorithms such as A*, Minimax (with alpha-beta pruning), and Monte-Carlo which have vastly different strategies.\n\n## New Algorithms / Contributing\nPull requests are welcome. As with all my projects, I am constantly on the lookout to add to the collection of algorithms, especially if they outperform all the others. If you can get the minimax working more efficiently I would love to learn how. If you know of an algorithm then I'd love to hear from you, and if you want to have a go at improving my work then by all means do so, I'd love to learn how I can do better with performance, design patterns, and more.\n\nFor major changes, please open an issue first to discuss what you would like to change.\n\n## License\n[GNU General Public License v3.0](https://choosealicense.com/licenses/gpl-3.0/)\n\n## References\n- [A* Algorithm](https://www.geeksforgeeks.org/a-search-algorithm/)\n- [Minimax](https://www.chessprogramming.org/Minimax)\n- [Alpha-Beta Pruning](https://www.chessprogramming.org/Alpha-Beta)\n- [lamesjim's Minimax in Chess](https://github.com/lamesjim/Chess-AI)\n\n- [WY Fok's write-up on Crooks Algorithm (my original source)](https://towardsdatascience.com/solve-sudoku-more-elegantly-with-crooks-algorithm-in-python-5f819d371813)\n- [Cornell's page on Crooks Algorithm](http://pi.math.cornell.edu/~mec/Summer2009/meerkamp/Site/Solving_any_Sudoku_II.html)\n- [J.F. Crooks's original paper on his algorithm](http://www.ams.org/notices/200904/rtx090400460p.pdf)\n- ['Independence Generator'](https://www.geeksforgeeks.org/program-sudoku-generator/)\n- [Greg Surma's write-up on minimax](https://gsurma.medium.com/hex-creating-intelligent-opponents-with-minimax-driven-ai-part-1-%CE%B1-%CE%B2-pruning-cc1df850e5bd)\n- [Stanford Poster on Algorithm Efficiency \u0026 Accuracy in Hex](https://www.google.com/url?sa=t\u0026rct=j\u0026q=\u0026esrc=s\u0026source=web\u0026cd=\u0026ved=2ahUKEwjFnLmm94L3AhWuyjgGHZNpBFwQFnoECAQQAQ\u0026url=http%3A%2F%2Fweb.stanford.edu%2Fclass%2Farchive%2Fcs%2Fcs221%2Fcs221.1192%2F2018%2Frestricted%2Fposters%2Feliew%2Fposter.pdf\u0026usg=AOvVaw1EfWPdkTepZCwkfUYUazsk)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbroderick-westrope%2Fdsa-hex-game","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbroderick-westrope%2Fdsa-hex-game","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbroderick-westrope%2Fdsa-hex-game/lists"}