| More Information on this item |
Rate this page! | Skip to comments
The main objective of this chess variant is to combine some concepts of the game Diplomacy with chess.
The chess rules apply, with the following exceptions:
Example:
White plays Qc6 and Black plays Nc6: Queen takes kNight! |
White plays Qd5 and Black plays c5: There is no conflict, because the two pieces don't meet in no square during their travel. |
White plays Rh6 and Black do not move the d6 kNight: Rook cannot move, because there is an obstacle in its way (like in normal chess...) |
White plays Kb7 and Black plays Rh6: No problem! (if the rook didn't move, the king couldn't accomplish his move.) |
In my opinion this rules are more interesting if we play a progressive type of game. Each player presents the entire set of movements. Then, they execute the first move for both players, then the second, and so on...
Now, each set of moves is done at the same time! But, in order to use them, we must introduce another conflict rule:
Example:
White plays Rh2 and Black plays Bd1 and Ba1: The a2 rook and the c3 bishop conflict at b2. So the a4 bishop can perform his move because the rook cannot reach square c3. |
Include the possibility of making conditional moves. A conditional move is a move that only tries to execute, if same specific condition is true. A possible syntax could be: condition?if-true-move:if-false-move The condition can ask only one of the following questions:
I thought on including support type moves, but I'm not sure if this put Dip-Chess rules too close to Diplomacy rules, and then I may get some problems with Avalon-Hill :) So, leave it as it is!
These rules are easily transfered to many other chess variants.
I would like to try the Russian fortress variant (with progressive moves). It needs 4 players (and a master). Anyone?
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: September 30, 1996. Last modified on: March 01, 2001.
This item has comments. View all comments for this item.
Provide feedback on this page!
|
|
Last modified: Monday, December 22, 2008