Ticket to Ride Germany (Licht Beschadigd)

31,00

Uitverkocht

Beschrijving

Tweedekans spellen:

Het gaat om een licht beschadigd exemplaar van dit topspel, aan een extra scherpe prijs.

Je vindt foto’s van de beschadigingen in de galerij bij dit product.

Beschrijving van de schade aan deze Ticket to Ride Germany:

  • De schade is beperkt tot een paar deuken aan de voorzijde van de doos.
  • De seal is intact en de inhoud is onbeschadigd.

Het gebruik van kortingscodes is uitgeschakeld voor tweedekans spellen.

Ticket to Ride Germany
Ticket to Ride Germany

Ticket to Ride: Germany is a standalone game in the Ticket to Ride series. Over the course of the game, players collect cards in order to then claim routes on the game board between two cities. Ideally the players create a network of routes that connect the cities showing on their secret ticket cards. Players score points both for claiming routes and for completing tickets, with incomplete tickets counting against a player’s score.

Ticket to Ride Germany
Ticket to Ride Germany

In addition to scoring points for tickets, whenever a player places a route on the board, they claim a passenger from the two cities that form the endpoints for that route (assuming that the passengers have not already been claimed). At the end of the game, whoever has the most passengers of each of the six colors scores 20 points for that color; whoever has the secondmost passengers in a color scores 10 points. Whoever has the most points at the end of the game wins.

Ticket to Ride Germany
Ticket to Ride Germany

Ticket to Ride: Germany combines most of Zug um Zug: Deutschland and the Deutschland 1902 expansion in one box. Zug um Zug: Deutschland, published solely for the German and Austrian market, consisted of the same map as Ticket to Ride: Märklin, but ZuZ:D didn’t include the passenger mechanism from Märklin in which players scored additional points by moving passengers from city to city. The Deutschland 1902expansion introduced a different method of scoring passengers, and that method is now present in this