![rules for dammit card game rules for dammit card game](https://cdn.mos.cms.futurecdn.net/oB9QuJAkcPBNBMyiKhH6Wd.png)
![rules for dammit card game rules for dammit card game](https://compote.slate.com/images/9a88f47c-160d-4878-ab63-a1265f1ad99d.jpeg)
One of the extra bonuses allows you to fill in the handful of footpaths – bordered by dashed lines rather than solid ones – on the map. The immediate bonuses match the shapes on the dice, so you can fill in one of those shapes on your board, following the usual rules. Passing landmarks, which are marked with single letters on the board, earns you the choice of eleven bonuses, seven immediate and four you can use later. Each player gets to roll five times over the course of the game. (In rare instances when you can’t legally do so, you may ‘downgrade’ to a less valuable shape.) The 2 | and the 3 | die faces mean you may draw a continuous line up to that many spaces long you can go shorter than that, but you can’t break it apart or turn its direction. You must fill in roads on your map using the shape of the die you select, connecting one of the edges of the shape your existing network of roads. The dice show seven different shapes of roads: a straight line, a cross, a T, an elbow, a half-street, a 2 with a straight line, or a 3 with a straight line. On each player’s turn, they roll the game’s six dice, which the players then draft, one at a time. In Seven Bridges, all players begin by marking in the same square on their pages, showing a grid map of the city with, indeed, seven bridges, along with thirteen ‘landmarks,’ some trees, lots of buildings, and numbers around the map’s edge.
#Rules for dammit card game update
(The game is currently unavailable, but I’ll update this post when Puzzling Pixel gets the next print run.) Seven Bridges is a “stroll-and-write” game based on the famous mathematical problem, eventually proved unsolvable by Leonhard Euler: Can a pedestrian walk through the German city of Königsberg, crossing each of its seven bridges exactly once? Euler’s proof became a foundational one in the history of graph theory, but that’s beyond the scope of the game.