Commit | Line | Data |
---|---|---|
d2af3400 | 1 | p.boxed |
d982fffc BA |
2 | | Similar to Checkers, with prisoners stacked below capturers. |
3 | ||
4 | p | |
5 | | The 9x9 board is initially empty. | |
6 | | Each player receives 12 stackable pieces, "in hand". | |
7 | | At each turn, a player must either | |
8 | ul | |
9 | li. | |
10 | Enter a new piece on the board such that the opponent cannot capture it. | |
11 | However, if a capture is already possible before the move, then | |
12 | the piece can be dropped anywhere. | |
13 | White cannot place a piece in the center at move 1. | |
14 | li Play a move on the board, along diagonals. | |
15 | ||
16 | p. | |
17 | Simple moves are Ferz moves: one step diagonally. | |
18 | Captures work exactly as in Checkers: by jumping over a diagonally adjacent | |
19 | piece to land on a free square just behind. | |
20 | However, the resulting situation is more complex. See below. | |
21 | If a capture is possible, then it must be played; in this case no piece can | |
22 | be introduced on the board. | |
23 | ||
24 | p TODO: diagram | |
25 | ||
26 | p. | |
27 | Let us consider each unit as a compound entity containing W white pieces | |
28 | and B black ones (initially W = 1 and B = 0 for white units, | |
29 | and vice-versa for black). | |
30 | Captures can then be described formally as follows. | |
31 | ||
32 | p. | |
33 | As white: | |
34 | If W1/B1 jumps over W2/B2 at square S2 to land on S1', then | |
35 | W1/(B1+1) arrives on S1' and W2/(B2-1) remains on S2. | |
36 | If W2 = B2 - 1 = 0, nothing remains at the captured unit location. | |
37 | As black: exchange W and B above. | |
38 | ||
39 | p. | |
40 | In other words, each unit is a stack of friendly and enemy pieces, with | |
41 | friendly pieces on top. After each capture, the prisoners part of the | |
42 | stack is incremented, while the "jailers" counterpart at the captured | |
43 | location decreases by one. | |
44 | ||
45 | p. | |
46 | When several capturing chains are available, | |
47 | the player has to select one of the longest (as in Checkers). | |
48 | ||
49 | p TODO: diagram (from mindsports.nl) | |
50 | ||
51 | h3 More information | |
52 | ||
53 | p | |
54 | | See the | |
55 | a(href="https://www.mindsports.nl/index.php/arena/emergo/88-rules") | |
56 | | Emergo page | |
57 | | on the author's website. | |
58 | | Rules are also described on | |
59 | a(href="http://www.iggamecenter.com/info/en/emergo.html") iggamecenter | |
60 | | , where you can also play this game. | |
61 | ||
62 | p Inventors: Christian Freeling and Ed van Zon (1986) |