Commit | Line | Data |
---|---|---|
1 | <p> | |
2 | At each turn, take any tower of less than 5 pieces (the number printed on it) | |
3 | and put it on an adjacent tower, such that the resulting construction isn't | |
4 | more than 5 units tall. | |
5 | </p> | |
6 | ||
7 | <p> | |
8 | When no moves are possible anymore, the game is over. The player having the | |
9 | largest number of towers of his color (on top) wins. | |
10 | </p> | |
11 | ||
12 | <p> | |
13 | <a href="http://jeuxstrategie.free.fr/Avalam_complet.php"> | |
14 | More informations. | |
15 | </a> | |
16 | </p> | |
17 | ||
18 | <p class="author">Philippe Deweys (1995).</p> |