|Designed by Erik Oosterwal|
|Create Big Molecules at Home|
|Trios per color:||5|
|Number of colors:||5|
|- - - - - - Other equipment - - - - - -|
|Poker Chips, Opaque Bag|
|Setup time:||1 minute or less|
|Theme:||Science, Chemistry, Biology|
|Status: complete? (v1.0), Year released: 2987|
This science themed game mimics the structures of Polymer Chains (http://en.wikipedia.org/wiki/Polymer_chain).
X stashes of pyramids, where X is 1 more than the number of players. (perhaps this game lends itself to using treehouse sets rather than single color stashes?)
Some large number of Poker chips.
Arrange 7 poker chips in a hexagonal pattern and place a random pyramid in the center.
o o o X o o o
The remaining pyramids are kept in a bag.
Players take turns completing the following two steps:
- Blindly select a pyramid from the bag and add it to the playing area,
- Add poker chips to the playing area so that there is always a ring of one empty space surrounding the pyramids.
Turns are scored by adding the number of pips on all pyramids of the same color that are connected to the newly placed pyramid, including the newly placed pyramid.
The newly placed pyramid may not touch two pyramids of the same color if those two are already next to each other.
If the playing area looks like this:
o o o o o o o R R Y G G o o o R R Y G o o B B G o o o o o o
Then a Green pyramid may be placed in any of the locations marked with '+' but not in the two locations marked with 'X'.
+ + + + X + + R R Y G G X + + R R Y G + + B B G + + + + + +
The location towards the bottom right would connect two groups of Green pyramids that were not already connected forming a chain of 5 pyramids. After placing the Green pyramid in that location, one more poker chip is added and the resulting playing area looks like this:
o o o o o o o R R Y G G o o o R R Y G o o B B G G o o o o o o
The game ends at the end of the round when one player reaches 100 points. All players will be allowed to place the same number of pyramids and the winner will be the person with the highest score.
This work is distributed by Erik Oosterwal under the Creative Commons Attribution-Noncommercial-Share Alike 3.0 License.