https://github.com/nathom/cse251b-final-project
https://github.com/nathom/cse251b-final-project
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/nathom/cse251b-final-project
- Owner: nathom
- License: mit
- Created: 2024-03-08T02:48:40.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-03-23T04:09:22.000Z (about 1 year ago)
- Last Synced: 2025-03-18T08:51:17.198Z (2 months ago)
- Language: Python
- Size: 9.7 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# cse251b-final-project
Install `poetry` for dependency management.
Usage
```
poetry shell # enter venv
poetry install # install dependencies
play --help # our command
```
## Monte carlo tree search
We wrote this in C due to performance issues with the Python version (it would take 3 days to ru n). It is a single file and has no dependencies.
```
cd c # directory with c files
make
# Play 1 game with 200 branching factor with display
./2048 mc 200 1 true
```
The output is written to csv files in the current directory. You
can change the heuristic used by modifying the `METHOD` macro
at the top of the file.