搜尋結果
狼人在一個名為Tabula的偏僻小村莊出沒：每天晚上，某些村民將會變身成狼人，並殺害無辜的村民來滿足他們殺戮的慾望。 存活下來的村民們白天聚集在一起討論到底誰是狼人？ 在討論結束後他們將會選出一位最有可能是狼人的嫌疑犯來處死。 你能在這場災難中存活下來嗎？ 或是你能解開在這滿月下的謎團？ 一款能讓眾多玩家共享的經典遊戲。 8歲以上｜8-24人｜20-40分鐘 牌套：61×112mm×26張｜內含中英文紙牌.
- Chinese
- Swan Panasia Co., Ltd.
- Gianpaolo Derossi
- 2013
2014年10月11日 · One Night Ultimate Werewolf – Amazon $24.95 – Affiliate Link. Nov 15, 2014.
Classification. No moderator, no elimination, ten-minute games. One Night Ultimate Werewolf is a fast game for 3-10 players in which everyone gets a role: One of the dastardly Werewolves, the tricky Troublemaker, the helpful Seer, or one of a dozen different characters, each with a special ability. In the course of a single morning, your ...
One Night Ultimate Werewolf Daybreak is a fast game for 3-7 players in which everyone gets a hidden role, each with a special ability. (No plain "villagers" here!) In the course of a single morning, your village will decide who among them is a werewolf...because all it takes is finding one werewolf to win! Daybreak includes eleven new roles ...
Classification. In Werewords, players guess a secret word by asking "yes" or "no" questions. Figure out the magic word before time is up, and you win! However, one of the players is secretly a werewolf who is not only working against you, but also knows the word. If you don't guess the word in time, you can still win by identifying the werewolf!
Werewolf (also known as Mafia) takes place in a small town where a minority of the townsfolk hold a dangerous secret. Each player is secretly assigned a role - Werewolf, Villager, or Seer (a special Villager). There is also a Moderator who controls the flow of the game. The game alternates between night and day phases.
Classification. Crimes have taken place all over the city, and you want to figure out exactly what's happened, so you'll need to look closely at the giant city map (75 x 110 cm / 29.5 x 43 inches) to find all the hidden information and trace the trails of those who had it in for their foes. MicroMacro: Crime City includes 16 cases for you to solve.
