In a game of Ticket To Ride, players build networks of railway routes across North America. The game has tactical depth despite a simple rule-set and has won many awards including the 2004 Spiel Des Jahres, or the German "game of the year" - widely recognised as the most prestigious award in gaming. The game is so popular that it has since transformed into a whole series of games with the same concept, but with maps of locations from across the world including Europe, Africa, India and even the UK.
A = In the above example, the red player would like to make a connection between Montreal and Atlanta. What is the minimum number of cards they could play on their turn to achieve this?
B = How many points would the red player lose if they didn't complete a connection between Montreal and Atlanta before the end of the game?
C = How many points did red score when they claimed the route between Pittsburgh and Saint Louis?
D = How many points did yellow score when they claimed the route between Pittsburgh and Nashville?
E = How many bonus points will be awarded to the player who has built the Longest Continuous Path of routes at the end of the game?
F = If on my turn I choose to draw additional destination tickets, how many cards do I draw from the deck?
G = What is the minimum number of tickets drawn for F that I must keep in my hand?
Once you have answered the above questions, the cache can be found at:
N 54 0(E/2).G(F/A)D
W 001 0(B-F-G).(A+G)(E-C)(C-D)
You will also need the following information if looking for Beyond Monopoly! - The eXpansion:
A*B*C*D*E*F*G = VWXYZ