| More Information on this item |
Rate this page! | Skip to comments
By
Chain of Fools is a Chess variant, where instead of attempting to checkmate the opposing King, your goal is to arrange your pieces in chains where each piece defends the next.
The array and movement rules of FIDE Chess are used, with the following exceptions:
The goal Chain of Fools is to be the first to get earn 10 points by making chains of pieces. These chains have varying values depending on which pieces are used to compose them.
A move consists of the following phases :
A chain is composed of between 3 and 5 pieces, where every piece in
the chain, except for possibly the last, defends the next piece
in the chain (a piece defends another piece if the piece defended is
friendly and if captured, the defending piece could capture the
capturing piece). Here is an example:
This chain is worth 5 points. |
This is not a chain because the Bishop does not defend the Rook. The interfering black Rook would have to be shuffled before this chain could be claimed. Note that the "path" of the Knight is the two consecutive squares first, then the orthogonal square. |
This is not a chain because the Knight defends both of the other pieces. A chain must have links from piece to piece except for the last piece. |
This is a chain because there is a way in which we can make every piece defend another except one, that is, by claiming it as Knight - Rook - Bishop. It would not matter if the Bishop itself defends the Knight or the Rook : as long as the requirements for a chain are met, it doesn't matter what additional pieces members of the chain might defend. |
A chain of 3 pieces or more must be claimed on the same turn that it is formed. This means that the maximum possible length for a chain is 5 pieces (being formed from two chains of two pieces each being bridged by the last movement). To claim a chain, it is sufficient to point out the pieces of the chain in succession and count the number of points scored.
If a chain is not announced on the same turn it is formed, either by mistake or design, the opponent must shuffle it immediately when they see it. No points can be scored by either side for such a chain.
Instead of being removed from the game, captured pieces and pieces in chains are shuffled. Shuffling happens in three situations:
The method of shuffling is simple : any captured or chain-forming pieces are removed from the board and placed on any empty square by the side that captured or the opponent of the chain-forming player. There is no restriction on the squares that shuffled pieces may be placed on apart from the square having to be empty.
The King can also be shuffled. There is obviously no check or mate.
If a player for shuffles their opponent's pieces such that they form a chain of length 3 or greater, this is treated just like a chain their opponent has formed deliberately. If a shuffling occured during the opponent's claiming and shuffling phase, the opponent may claim it right away, and if they do not claim it and it is still a valid chain at the end of the opponent's turn, it is treated like any other chain left unclaimed. If a player shuffles their opponent's pieces to form a legal chain during the player's turn (due to a capture), their opponent may claim it at the end of the their following turn.
The point value of a chain is the sum of the point values of each piece involved.
A variant of these rules would be to reduce the requirements number of pieces in a chain from three to two, in the following manner:
This makes forming chains more difficult and makes for closer games.
One obvious tactic is to imprison a Pawn by shuffling it behind one of your own Pawns. Since the Pawn cannot free itself, it can stay trapped while your Pawn scores points on the third row. However, the more deployment done by your Pawn, the more leeway the imprisoned Pawn has.
Submit this game to be available for rating!
For author and/or inventor information on this item see: this item's information page.
Created on: April 04, 2002. Last modified on: April 04, 2002.
This item has comments. View all comments for this item.
Provide feedback on this page!
|
|
Last modified: Monday, December 22, 2008