# Cost Progressive Chess

## Introduction

Cost Progressive Chess is a form of progressive Chess where each piece requires a specified number of movement points to move, and each turn the amount of movement points a player has to move with increases.

## Board and Setup

The equipment and initial arrangement as in orthodox chess.

## Rules

The game is conducted by rules of International Chess with the following changes:

• The number of moves possible in one turn, and which pieces can make those moves, depend on the number of the turn and cost of those pieces to move.
• White and Black have the same number of movement points with which to move each turn.
• On the first turn, players may move one movement point worth of pieces, on the second turn, two movement points worth of pieces, on the third turn, three points worth of pieces, on the fourth turn four points worth of pieces, and so on.
• Cost to move pieces:
 Pieces Cost Pawn 1 Knight 3 Bishop 3 Rook 5 Queen 9 King 2
• Possible combinations of pieces that could be moved at various numbers of turn.
 # Possible combinations of piece's move 1. (p) 2. (2p) or (K) 3. (3p) or (K) or (p+K) or (N) or (B) 4. (4p) or (2p+K) or (p+N) or (p+B) 5. (5p) or (3p+K) or (2p+N) or (2p+B) or (K+N) or (K+B) 5+. etc.
• Castling is considered a move of the king.
• After the announcement of check, any unused movement points of the checking player player are lost.
• Check must be removed by a first move of the player's turn.
• A player is not required to use all of their movement points in a turn.
• Unused movement points may not be carried over to future turns.
• Pieces may be moved in any order the moving player wishes.

## Variants

#### 1. Simple Cost Progressive Chess.

It is possible to use a simple cost scale for pieces: Pawn - 1, Knight - 2, Bishop - 3, Rook - 4, Queen - 5, King - 1.
The game will develop more dynamically than with the movement point costs first given.
It is possible to use any other scale of values.

#### 2. Fibonacci Cost Progressive Chess.

There are other ways of determining the number of movement points a player receives in a turn. For example - the number of movement points received each turn is the next number in theFibonacci sequence. In this particular variant, white and black do not receive the same number of movement points in a turn:

 # Movement points per player Possible combinations of pieces moved 1. W and B - 1 p 2. W - 2 (2p) or (K) B - 3 (3p) or (2p+K) or (N) or (B) 3. W - 5 (5p) or (3p+K) or (2p+N) or (2p+B) or (K+N) or (K+B) B - 8 (8p) or (6p+K) or (5p+N) or (5p+B) or (K+2N) or (K+2B) or (2p+N+B) or (3p+R) or ... etc.

#### 3. Perfect Cost Progressive Chess.

It is possible the above rules in a game, where there are all probable combinations of standard pieces, such as Perfect Chess by Köksal Karakus or Chess 2000 by Gerhard Josten.
It would be necessary to calculate relative cost of the additional pieces.
And it would be interesting to try to combine in such a game all the given variations.

Written by Sergey Sirotkin. Prepared for posting by Peter Aronson.
WWW page created: March 25, 2001. Prepared May 2nd, 2001.