From Looney Pyramid Games Wiki
Jeff Zeitlin
Get all your pieces to the center goal
:Players Players: 2 - 4
:Time Length: unknown
:Complexity Complexity: Low
Trios per color: 1
Number of colors: 1 per player
Pyramid trios:
Monochr. stashes:
Five-color sets: 1
- - - - - - Other equipment - - - - - -
Volcano board, one six-sided die
Setup time: 2 minutes
Playing time:
Strategy depth: Medium
Random chance: Medium
Game mechanics:
Theme: The wikipage input value is empty (e.g. <code>SomeProperty::, [[]]</code>) and therefore it cannot be used as a name or as part of a query condition.
BGG Link: 34913
Status: Complete (v1.0), Year released: 2006

Par-Trees-i is a game for two or four players using one Treehouse stash, a Volcano board and an ordinary six-sided die. The objective is to be the first player to get all three of his pieces to the center, in decreasing size order.

Each player starts out with the three pieces of his color arranged as a tree, off the board. The board is set diagonally between the players, so that each player is at a corner of the board.

The players use any method that seems good to them to decide who plays first. Play subsequently procedes clockwise.

On a player's turn, he rolls the die. If a one is rolled, the player may choose to enter the topmost piece of his tree, by placing it on the board in the corner square nearest him. If the player does not wish to enter a piece, or already has all three pieces on the board, he may move any of his entered pieces one space counterclockwise along the edge of the board. For all other rolls, the player may move one piece counterclockwise along the edge of the board by the number of spaces rolled.

If the player enters at the lower right on the diagram below, his pieces follow the pattern of arrows to the center space (marked with the star), and are then placed on the space marked with the diamond to show that they have reached the goal. Pieces must land on the center space by exact count, and a player's pieces must reach the center in Large-Medium-Small order.

A piece may land on an occupied space. If the two pieces are the same color, arrange them as a tree (smaller pieces on top). Only the top piece from the tree may move. If the two pieces are different colors, the smaller piece is returned to its owner, who must then place it in its appropriate place in his tree of unentered pieces, and re-enter it in due course. A space that already has two pieces on it may not be landed on.

The first player to get his entire tree to the center wins. This work is distributed by Jeff Zeitlin under the Creative Commons Attribution-Noncommercial-Share Alike 3.0 License.