https://github.com/inejc/scotland-yard

Java implementation of the Scotland Yard board game using Monte Carlo Tree Search methods
https://github.com/inejc/scotland-yard

decision-making monte-carlo scotland-yard search tree

Last synced: about 2 months ago
JSON representation

Java implementation of the Scotland Yard board game using Monte Carlo Tree Search methods

• Host: GitHub
• URL: https://github.com/inejc/scotland-yard
• Owner: inejc
• License: mit
• Created: 2015-06-26T10:26:42.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2022-09-21T07:57:04.000Z (about 2 years ago)
• Last Synced: 2024-04-09T20:02:35.490Z (6 months ago)
• Topics: decision-making, monte-carlo, scotland-yard, search, tree
• Language: Java
• Size: 346 KB
• Stars: 6
• Watchers: 4
• Forks: 4
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

        
# Scotland Yard board game using Monte Carlo Tree Search methods

This 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.

## Dependencies

JUnit4, [Monte Carlo Tree Search methods](https://github.com/nejc92/mcts)

## License

This project is licensed under the terms of the MIT license. See LICENSE.md.

## Authors

Nejc Ilenič