
Lefe (2024)
2 - 2 persone
30 - 60 min
7+
Al momento questo prodotto non è disponibile presso nessun venditore.
Descrizione:
Introduction:Lefe (from Middle English: lefe, meaning "leaf") is a drawless annihilation game for two players: Dark green and Light green. It is played on the hexes (cells) of an initially empty hexagonal board. The recommended size is 6 cells per side, but boards of 5 or 7 cells are also valid. Each player has a sufficient supply of stones of their color.
Definitions:
A tree is a maximal set of stones of the same color connected to each other. A single stone is also a tree.
A leaf is a stone adjacent to at most one friendly stone.
Turns:Dark plays first, and then turns alternate. On your turn, perform these actions in the following order:
Place a stone of your color on an empty cell adjacent to at most three friendly stones not adjacent to each other.
Remove exactly one enemy tree adjacent to a friendly tree whose number of leaves increases due to your placement, as long as the enemy tree has fewer leaves than your tree.
When two or more trees of the same color are merged, capture can only be performed if the number of leaves in the new tree exceeds the number of leaves in the tree with the fewest leaves among those trees before the merge.
End of the game:The game ends when a single player cannot place stones. The player with the highest score wins. At the end of the game, each player receives one point for each tree of their color with a different number of leaves, plus an additional point for the player whose tree contains the most leaves. In case of a tie in the number of leaves, the next tree with the most leaves is considered, and so on.
To balance the game, before the game starts, the first player places a dark stone on an empty cell and the second player chooses a side. This method of balancing is called the pie rule.
—description from the designer
Introduction:Lefe (from Middle English: lefe, meaning "leaf") is a drawless annihilation game for two players: Dark green and Light green. It is played on the hexes (cells) of an initially empty hexagonal board. The recommended size is 6 cells per side, but boards of 5 or 7 cells are also valid. Each player has a sufficient supply of stones of their color.
Definitions:
A tree is a maximal set of stones of the same color connected to each other. A single stone is also a tree.
A leaf is a stone adjacent to at most one friendly stone.
Turns:Dark plays first, and then turns alternate. On your turn, perform these actions in the following order:
Place a stone of your color on an empty cell adjacent to at most three friendly stones not adjacent to each other.
Remove exactly one enemy tree adjacent to a friendly tree whose number of leaves increases due to your placement, as long as the enemy tree has fewer leaves than your tree.
When two or more trees of the same color are merged, capture can only be performed if the number of leaves in the new tree exceeds the number of leaves in the tree with the fewest leaves among those trees before the merge.
End of the game:The game ends when a single player cannot place stones. The player with the highest score wins. At the end of the game, each player receives one point for each tree of their color with a different number of leaves, plus an additional point for the player whose tree contains the most leaves. In case of a tie in the number of leaves, the next tree with the most leaves is considered, and so on.
To balance the game, before the game starts, the first player places a dark stone on an empty cell and the second player chooses a side. This method of balancing is called the pie rule.
—description from the designer