phone (+39) 320 073 4588
email ENTRE EM CONTATO CONOSCO VIA E-MAIL
Promo Banner Promo Banner
Main Pic
add-wishlist
add-collection
add-alert
5.92
Votação BGG: BGG Stats
LANGUAGE-UK
2-4
45'
9
Nenhum texto necessário no jogo

Amber Road

Um jogo de tabuleiro de Dan Glimne Grzegorz Rejchtman
Editora: Mindtwister AB
utrade Quer vender sua cópia deste jogo?
utradestar
Use nosso mercado utrade!
Amber Road
O item não está disponível, você pode usar o alerta para ser avisado quando ele estiver novamente em estoque.
add-alert
Descrição Descrição
A "race game" placed in the ancient Roman Empire. Each player leads an expedition along the "Amber Road" to gain worthy ressources along the travel. Moving along the Road consumes resources such as water, food, etc. The first thing an expediton needs to do is fill up its supplies. While still in the starting area, a player may take up to four resource tokens and/or coins; he may stay as long in this starting area and take resources as he wants. When a player thinks he has enough for the journey, he takes off. In a turn, a player has three options: spend two tokens and move one step for each ox you have; move one step without spending tokens; or remain where he is. If a player moves to a new mapboard, he has to roll the stick beforehand to see which board is placed. After this each player has the option to place a village marker. On each map section the terrain changes; on a number of special places a player may perform different useful tasks, such as refilling his supply of water, food or acquire an ox. Villages are useful to buy supplies. Markers that show the 'pax' side consider the village to be friendly, however, when the village is hostile, it attacks the expedition. All oxes and scout then are placed in the bag together with three neutral green tokens. Two tokens drawn from the bag are considered lost. If the village is friendly, the stick is rolled. The dots shown is the number of resource tokens a player gets for each silver coin in this village. When the first player reaches the end of the road by exact count, he wins.
Informações adicionais Informações adicionais
Mecânica: Sistema de subsídio de pontos de ação
Categorias: Estratégia
Nomes alternativos:
BARCODE: ?????????
Em 2__PH_1__ listas de desejos Isso foi visto 4652__PH_1__ vezes
Descrição Descrição
A "race game" placed in the ancient Roman Empire. Each player leads an expedition along the "Amber Road" to gain worthy ressources along the travel. Moving along the Road consumes resources such as water, food, etc. The first thing an expediton needs to do is fill up its supplies. While still in the starting area, a player may take up to four resource tokens and/or coins; he may stay as long in this starting area and take resources as he wants. When a player thinks he has enough for the journey, he takes off. In a turn, a player has three options: spend two tokens and move one step for each ox you have; move one step without spending tokens; or remain where he is. If a player moves to a new mapboard, he has to roll the stick beforehand to see which board is placed. After this each player has the option to place a village marker. On each map section the terrain changes; on a number of special places a player may perform different useful tasks, such as refilling his supply of water, food or acquire an ox. Villages are useful to buy supplies. Markers that show the 'pax' side consider the village to be friendly, however, when the village is hostile, it attacks the expedition. All oxes and scout then are placed in the bag together with three neutral green tokens. Two tokens drawn from the bag are considered lost. If the village is friendly, the stick is rolled. The dots shown is the number of resource tokens a player gets for each silver coin in this village. When the first player reaches the end of the road by exact count, he wins.
Informações adicionais Informações adicionais
Mecânica: Sistema de subsídio de pontos de ação
Categorias: Estratégia
Nomes alternativos:
BARCODE: ?????????
Em 2__PH_1__ listas de desejos Isso foi visto 4652__PH_1__ vezes