n this project, teams will create an integer or linear programming model

that will choose the optimal moves for a modified version of the board game

$$Ticket to Ride Europe$.$

$2$ Modified Ticket to Ride Europe game play

We will be playing a modified version of the board game $$Ticket to Ride:

Europe$.$ In the modified version, the goal is to score as many points as

possible. Points are scored by completing routes. Each team will start with

a hand of four cards: one card will be a long route, and the others will be

short routes. Teams will also have $44$ trains total.

Each route card has two cities on it and is worth a different number of

points. Players complete their routes by placing a line of trains on the board

that connect the two cities on the route card.

Turn play is the same as the original game: players will draw cards or

play trains each turn to try to maximize their points.

In this modified version, we will ignore the train stations that are used in

the original game. We will also treat each tunnel as a normal train segment.

Please feel free to stop by office hours to play the game, read the rule

book, or discuss the game in more detail. If you cannot make office hours,

email me to make an appointment.

$3$ Project Deliverables

Every person in the group will submit:

$1.(70$ points$)$ A report that explains the project

$2.(10$ points$)$ A peer rating for each other member in your group

$3.(20$ points$)$ Working code that solves your model

The code should be identical for each group member. The report for each

group member should be identical EXCEPT for the project reflection sec$-$

tion. The peer ratings should be confidential and will be different for each

$1$