|Treehouse update to an older game|
|Players:|| 2 - 4 (though it works better with even numbers)|
"(thoughitworksbetterwithevennumbers)" can not be assigned to a declared number type with value 4.
|Trios per color:||5|
|Number of colors:||[[Number of colors::1 Treehouse Set]]|
|Monochr. stashes:||[[Stashes::1 Treehouse Set]]|
|- - - - - - Other equipment - - - - - -|
|Setup time:||2 minutes|
|Status: complete? (v1.0), Year released: 2987|
A Bit of History
Halma was invented by American Thoracic Surgeon George Monks in the 1880's. Halma was later reworked and became the game most of us know as Chinese Checkers (odd name since it was neither Chinese nor did it use checkers). Tree-Halma is a somewhat twisted version of Halma. It uses a smaller board (5x5 as opposed to 16x16) And fewer pieces for each player (3 as opposed to 19 or 13).
Set out your Volcano Board or other 5x5 board and place each player's pieces in a corner. If there are only two players, use opposing corners. Set a tree of a neutral color in the center square. The setup is as shown below.
|3|1| |2|3| |2| | | |1| | | |T| | | |1| | | |2| |3|2| |1|3|
The numbers above represent the pips on the pieces and the T is the tree.
On their turns players must make a move. NO PASSING! A player may move one of his own pieces or one of the neutral pieces. If the player chooses to move the neutral piece on his/her turn, it can be only one NOT the entire tree. Additionally it can be any one of the three not just the topmost.
A move can be either a:
- Move- move 1 space in any direction.
- Jump- jump over a piece to the space opposite the jumped piece from where he started. (provided that space was vacant).
The following restrictions apply to movement:
- A piece cannot jump another with the same number of pips.
- A piece cannot move backwards (toward the starting point).
1 2 3 4 5 A| | | |G|G| B| |M|M|M|G| C| |X|^|M| | D|S|X|X|M| | E|S|S| | | |
In the above illustration the second restriction is illustrated. The Pyramid is shown as ^ Legal Moves are M, illegal moves are X, the starting area is S and the goal is G.
A player wins when he (or she) occupies the three squares in the opposing corner. Which pyramid is in which square does not matter. If a player occupies one or more of the 'goal' squares (i.e. on a piece never moved from start or someone has entered a corner that is not their goal a win is achieved by a player occupying the squares nearest the goal as well as any vacant goal squares. (in short you can't guarantee a draw by only moving the neutral pyramids).