This project models a single player version of Catan as a mixed integer linear program (MILP) in Python with Gurobi.
Main goal:
- minimize the first turn where target victory points (VP) are reached
I compare MILP results against:
- a Greedy legal action baseline
- a Random legal action baseline
Final_Project.py- single run MILP solve (proof/bound focused run on one board seed)
Final_Project_iterative.py- iterative horizon MILP batch across seeds (120–129), writes CSV/JSON summaries
GreedyEvauluator.py- greedy baseline batch over seeds (120–129)
RandomAction.py- random legal action baseline, 10 runs per seed over seeds (120–129)
results/- generated CSV/JSON outputs used for analysis
figures/- generated plots used in report
CS_498_Final_Project.pdf- final report
- Python 3.12 (or close equivalent)
gurobipy(academic/non commercial license used in this project)matplotlib(for figure generation scripts)
From inside Final_Project/:
python Final_Project.py
python Final_Project_iterative.py
python GreedyEvauluator.py
python RandomAction.py
results/iterative_seed_120_129_summary.csvresults/iterative_seed_120_129_horizon_rows.csvresults/iterative_seed_120_129_meta.jsonresults/greedy_seed_120_129.csvresults/greedy_seed_120_129_meta.jsonresults/random_action_seed_120_129_runs10.csvresults/random_action_seed_120_129_runs10_summary.csvresults/random_action_seed_120_129_runs10_meta.json
This is a simplified single player Catan model:
- no opponents
- no robber interactions
- no ports
- deterministic expected value production (not stochastic dice simulation)
- dev cards simplified to knights (Largest Army logic included)
- Board seeds are explicitly fixed in code and metadata outputs.
- Batch comparisons use seeds 120–129.
- Seed 498 is used for proof depth case study runs in the report.