Game with the exchange of checkers (Ancient invention of Alone Coder.) Field 8x8. 12 checkers for one player, 12 for another. Arrangement similar to regular checkers (i.e. on 3 nearby rows), but one the player places his checkers on the white squares, the other - on the black squares. The task is to move all your checkers to the far 3 rows. Who spent The first one wins. The move is made like this: the checker moves either forward-right, or forward-left; if she then ended up in the “gate” between two enemy checkers (located vertically or along horizontally with a gap of one cell), then she makes another walk (if he can walk); if after that she turned out again in the “gate”, then one more move (again, if he can walk), and etc. As can be seen from the rules, the game ends no later than on the 60th go. The number of moves depends on the experience of the players - how often they give to each other"gates". However, with a cunning strategy opponents constantly force each other to create “gates”, depriving them of other moves.
Share your thoughts about the article