Cross-endodoi
From Wikimanqala
←Older revision | Newer revision→
Cross-endodoi
|
|---|
| © 2001, Dan Troyka |
| USA |
 |
| Variant of endodoi |
| Multiple lap |
| One cycle |
| 6 holes per row |
| Two rows |
Cross-endodoi was invented by W. Dan Troyka in 2002 and soon afterwards implemented in Zillions.
Cross-endodoi is an application of the cross-mancala metarule on endodoi.
Rules
The board has two rows, each of which has six holes. Each player also owns a store to deposit his captures.
Initially there is a fixed number of beans in each hole, three being the most simple variant, six for the advanced player.
|
| Initial Position |
The contents of holes with an odd number of seeds are distributed clockwise, while holes with an even number of seeds are sown counterclockwise.
If the sowing ends in a non-empty hole, its contents, including the last bean sown, are distributed in another lap. Again, the direction of sowing (clockwise or counterclockwise) depends on the number of beans, whether it is odd or even.
If the sowing ends in an empty hole, the turn is over.
- If the last bean falls into an empty friendly hole, any beans in the opposing enemy hole hole, along with the last bean dropped, are captured.
- If the last bean is placed into an enemy hole or in a friendly hole opposite an empty enemy hole, nothing is captured.
The game ends when a player can't move. The remaining beans are awarded to the opponent.
The winner is the player with the most captured beans at the end of the game. If the players each capture half the beans, the game is a draw.
References
- Troyka, W. D.
- (2002) 'Game: Cross-Endodoi', in Zillions of Games. [Web site]
 | We publish it as we understand it is a fair use. Although the information posted in this web is under the Creative Commons Attribution ShareAlike 2.5 License this does not imply the game has lost its copyright. You can consider the game and its rules have a copyright, and what is free is this way of explaining them. If you are the copyright holder and don't want to have it published here, please contact us |
 |
