Anonymous user
Homeworlds Settlers: Difference between revisions
→Using Actions
imported>Cuc |
imported>Cuc |
||
Line 40:
== Using Actions ==
'''Action''' Choose a piece you own, this is the ''action piece''. Its color determines the ''action type'': Red ~ Conquer, Yellow ~ Move, Green ~ Build, Blue ~ Trade/Upgrade. Its pip-size determines the ''number'' of actions of that action type. '''Note.''' If you ''don’t own'' a piece, you can Build (see under Green). In particular, your first
'''Definition.'''
Line 47:
For each pip of the action piece, you get one ''optional'' action of the action type associated with its color. You can choose how to use each action according to the following. Unused action pips are forfeited by the end of your turn.
* '''Red ~ Conquer'''. You can ''conquer'' an opponent’s piece bordering your Red action piece if '''a.)''' the piece you try to conquer is ''not larger'' than your conquering piece, AND '''b.)''' the total pip count of all of your Red pieces bordering the opponent’s piece is ''larger'' than the total pip count of all the opponent’s Red pieces bordering it (and if the attacked piece is Red, then its pips must also be counted). To conquer a piece, turn it 180 degrees on its field, pointing away from you. '''Note.''' Red pieces can therefore attack (on your turn) and defend (on your opponent’s turn). Once you conquered an opponent's ship, it counts as yours, even
* '''Yellow ~ Move'''. Make a partition (n1, n2, n3) of the number of pips n of your chosen Yellow action piece, such that n1 + n2 + n3 = n. For each number in your partition, choose a ''moving piece'', EITHER the said Yellow action piece OR a piece bordering to ''where said Yellow action piece now is''; move the moving piece the corresponding number of bordering spaces using only unoccupied fields. '''Note.''' If n = 1, there is only one partition, i.e., (1): you can only move 1 piece over 1 space. If n = 2, there are two partitions, i.e., (2) and (1, 1): you can EITHER move 1 piece over 2 spaces, OR 2 pieces over 1 space each. If n = 3, there are three partitions, i.e., (3), (2, 1), (1,1,1): you can EITHER '''a.)''' move 1 piece over 3 spaces, OR '''b.)''' 1 piece over 2 spaces and another piece over 1 space, OR '''c.)''' 3 pieces over 1 space each.
| |||