Our sample project will use 4 players, so we will need to ensure that one player cannot claim both routes in a double-route set. For example, Player 1 could not claim both the black and orange routes between Chicago and Pittsburgh. In a game with 4 or 5 players, the double routes cannot both be claimed by the same player. Many more examples can be found on the game board. Along the west coast, cities between Los Angeles and Vancouver are also connected by double routes. If you look at the "Midwest spine" of cities between Duluth and Houston in the middle of the board, almost all of them are directly connected by double routes. Some of the cities are connected by "double" routes. That route has six grey spaces, so we could use six black, or six yellow, or four orange and two locomotives, or any combination of color cards and locomotives that add up to six. Marie (top-center of the board), as shown here: It's pronounced "soo" not "salt". These routes can be claimed by using any one color, provided you have enough cards of that color.įor example, say you wanted to claim the route Winnipeg to Sault Ste. There are also "grey" routes, or routes which do not have one of the main eight colors. That route requires five green cards, so you could use five green train cards, or four green cards and one locomotive card, or some combination thereof.
Louis to Pittsburgh (middle-right of the board), as shown here: Let's say you wanted to claim the route St. There is also a "locomotive" card, which acts as a wild and can be used in place of any color. Players claim routes by using "train cards", and said cards can have one of eight different colors.
Routes are then colored one of nine colors: red, blue, orange, yellow, green, purple, black, white, and grey. Various North American cities are labeled and connected by "routes". The basic goal of Ticket to Ride is to connect cities to each other by "claiming" train routes. With that out of the way, let's discuss how we play a game of Ticket to Ride! Rules of the Game
TICKET TO RIDE EUROPE RULES SERIES
Rather, the goal of this series and all Modeling Practice posts is to practice taking a real-world bounded problem (such as a board game) and translating it into C# classes, objects, and code. I honestly doubt that is even within the range of my meagar capabilities, and you will see at the end of the series that the resulting simulation is far from perfect. Remember that the goal of these posts is not to produce a perfectly-working simulation of Ticket to Ride. Part 6: Structure, Scoring, and Drawbacks.The post you are reading is Part 1 of a six-part series on modeling the board game Ticket to Ride.
0 kommentar(er)
