← Power Grid

Power Grid rules

Pages refer to the Power Grid rules (English).

How do I win?

Start over

Rule

Building costs

A city has 3 spaces: 10, 15, and 20 Elektro. Put your house on the lowest empty space, and pay its price plus the cheapest connection from one of your cities.

  • Step 1: one house in each city.
  • Step 2: two houses in each city.
  • Step 3: three houses in each city.

Example: from Münster, Dortmund costs 10 for the space plus 2 for the connection: 12.

The map of that example on page 5. Anna has houses in Essen and Münster, and Bob in Düsseldorf and Köln. The number on each connection is its cost; Duisburg and Essen touch, so their connection costs 0:

Example of 7 pieces and 9 lines on a field of 9 by 8, from the top left:

An empty city: Duisburg, Dortmund, and Aachen DUI at 1, 2

A city with a house of Anna: Essen and Münster ESS at 4, 3

A city with a house of Anna: Essen and Münster MÜN at 7, 0

An empty city: Duisburg, Dortmund, and Aachen DOR at 8, 4

A city with a house of Bob: Düsseldorf and Köln DÜS at 2, 5

An empty city: Duisburg, Dortmund, and Aachen AAC at 0, 8

A city with a house of Bob: Düsseldorf and Köln KÖL at 4, 8

Line 0 from An empty city: Duisburg, Dortmund, and Aachen DUI at 1, 2 to A city with a house of Anna: Essen and Münster ESS at 4, 3: A connection, with its cost in Elektro

Line 6 from A city with a house of Anna: Essen and Münster ESS at 4, 3 to A city with a house of Anna: Essen and Münster MÜN at 7, 0: A connection, with its cost in Elektro

Line 2 from A city with a house of Anna: Essen and Münster MÜN at 7, 0 to An empty city: Duisburg, Dortmund, and Aachen DOR at 8, 4: The cheapest connection for Anna to Dortmund: 10 for the space plus 2

Line 4 from A city with a house of Anna: Essen and Münster ESS at 4, 3 to An empty city: Duisburg, Dortmund, and Aachen DOR at 8, 4: A connection, with its cost in Elektro

Line 2 from A city with a house of Anna: Essen and Münster ESS at 4, 3 to A city with a house of Bob: Düsseldorf and Köln DÜS at 2, 5: A connection, with its cost in Elektro

Line 9 from A city with a house of Bob: Düsseldorf and Köln DÜS at 2, 5 to An empty city: Duisburg, Dortmund, and Aachen AAC at 0, 8: A connection, with its cost in Elektro

Line 4 from A city with a house of Bob: Düsseldorf and Köln DÜS at 2, 5 to A city with a house of Bob: Düsseldorf and Köln KÖL at 4, 8: A connection, with its cost in Elektro

Line 7 from A city with a house of Bob: Düsseldorf and Köln KÖL at 4, 8 to An empty city: Duisburg, Dortmund, and Aachen AAC at 0, 8: A connection, with its cost in Elektro

Line 10 from An empty city: Duisburg, Dortmund, and Aachen DOR at 8, 4 to A city with a house of Bob: Düsseldorf and Köln KÖL at 4, 8: A connection, with its cost in Elektro

  • A city with a house of Anna: Essen and Münster
  • A city with a house of Bob: Düsseldorf and Köln
  • An empty city: Duisburg, Dortmund, and Aachen
  • A connection, with its cost in Elektro
  • The cheapest connection for Anna to Dortmund: 10 for the space plus 2

So Anna pays 10 for Duisburg, 12 for Dortmund, and 21 for Aachen (10 + 2 + 9, through Düsseldorf).

Rulebook pages 4, 5, 6

MoneyPlacement

Diagram

All steps Summary

The highlighted box is the current step. A dashed line goes back to an earlier step. Select + or − on a phase to show or hide its steps.

The steps in order

  1. Phase: Setup, then Choose the map and the regions.
  2. Step: Choose the map and the regions, then Give each player houses and money.
  3. Step: Give each player houses and money, then Fill the resource market.
  4. Step: Fill the resource market, then Lay out the power plant market.
  5. Step: Lay out the power plant market, then Prepare the draw stack.
  6. Step: Prepare the draw stack, then A round.
  1. Phase: A round, then Phase 1: set the player order.
  2. Step: Phase 1: set the player order, then Phase 2: auction a plant or pass?.
  3. Decision: Phase 2: auction a plant or pass?, then Auction a plant: Run the auction; or Pass: Can another player start an auction?.
  4. Step: Run the auction, then Can another player start an auction?.
  5. Decision: Can another player start an auction?, then Yes: next auction: Phase 2: auction a plant or pass?; or No: auctions end: Which case ends the auctions?.
  6. Decision: Which case ends the auctions?, then First round: Set the player order again; or No plant sold: Remove the lowest plant; or Plants were sold: Phase 3: buy resources.
  7. Step: Set the player order again, then Phase 3: buy resources.
  8. Step: Remove the lowest plant, then Phase 3: buy resources.
  9. Step: Phase 3: buy resources, then Phase 4: build.
  10. Step: Phase 4: build, then Does a player have the end city count?.
  11. Decision: Does a player have the end city count?, then No: go on: Does step 2 start now?; or Yes: the game ends: End of the game.
  12. Decision: Does step 2 start now?, then No: Phase 5: bureaucracy; or Yes: start step 2: Start step 2.
  13. Step: Start step 2, then Phase 5: bureaucracy.
  14. Step: Phase 5: bureaucracy, then Was the Step 3 card drawn?.
  15. Decision: Was the Step 3 card drawn?, then No: next round: Phase 1: set the player order; or Yes: start step 3: Start step 3.
  16. Step: Start step 3, then Phase 1: set the player order.
  1. Phase: End of the game, then Count your powered cities.
  2. Step: Count your powered cities, then The most powered cities wins.
  3. End: The most powered cities wins

Reference rules

Tags