Chess game with ranked pieces

Abstract

A modified chess game for play by two or more opposing players. The game comprises of a conventional chess board, or any variation of that. Each player has a playing piece set, consisting of a king, a queen, two rooks, two knights, two bishops, and eight pawns, matching that of a conventional chess set, with the addition of a rank associated with each piece. The pieces are positioned as in conventional chess or any other variants, and they will be moved pursuant to conventional movements and rules of capture, except that upon a capture attempt, the outcome will be affected by the ranks of attacker and attacked pieces. A formula or instrument will be used to determine the chance of a successful capture attempt, and how it affect the ranks of each piece.

Claims

1. A method of playing chess (conventional or any derivative form) in any physical or electronic form, comprising of the steps below: a) Providing each player with visibly distinguishable sets of ranked chess pieces, positioned according to conventional chess positioning rules or any derivative of them. b) Moving the playing pieces according to conventional chess rules, or any derivative of those rules, according to the following restrictions: Upon attacking a piece of the opposite side, the outcome will be affected by the ranks of the attacker and the attacked pieces. A formula and/or instrument will be used to determine the chance of a successful capture. If successful, the attacked piece will be reduced in rank and removed from the board, and the turn will be over. If unsuccessful, neither piece is moved. The attacked and/or attacker pieces' ranks may or may not be affected, based on the agreed upon rules and formulas. The player initiating the attack, will regain their move for the turn, granted they have not gone over the agreed upon move limit per turn. c) The same move can not be made twice in the same turn. d) Pawn promotion would infer a rank reduction. e) The winner will be determined by conventional chess rules.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0015] FIG. 1 is a sample rendering of described ranked chess pieces.

[0016] FIG. 2 shows a sample formula to use in order to calculate the chance of a successful capture attempt.

[0017] FIG. 3 is a sample of described R-FEN string, describing a position on the board.

[0018] FIG. 4 is a sample of described R-PGN text, showing the history of a game.

DETAILED DESCRIPTION OF THE INVENTION

[0019] This modified chess game can be played by two or more opposing players. The game comprises of a conventional chess board, or any variation/modification of that. Each player has a playing piece set, consisting of a king, a queen, two rooks, two knights, two bishops, and eight pawns, matching that of a conventional chess set with the addition of a rank associated with each piece. The rank can be random, agreed upon, or carried over from previous games based on agreed upon rules and formulas. One representation of ranked pieces can be seen in FIG. 1, however, the rank can be displayed in any chosen manner.

[0020] The pieces are positioned as in conventional chess or any other variants (e.g. chess960, 3D chess, etc.), and they will be moved pursuant to conventional movements and rules of capture, except that upon a capture attempt, the outcome will be affected by the ranks of attacker and attacked pieces. A formula and/or instrument (e.g. any form of dice) will be used to determine the chance of a successful capture. As a sample implementation, the inventor proposes to use the formula shown in FIG. 2 to determine the chance of a successful capture attempt, as a percent represented value.

[0021] If successful, the attacked piece will be reduced in rank (ideally to rank 0), and removed from the board, and the turn will be over. If unsuccessful, neither piece is moved. The attacked and/or attacker pieces' ranks may or may not be affected, based on the agreed upon rules and formulas. For the purpose of a sample implementation, we will leave the ranks unchanged after a failed capture attempt. The player initiating the attack, will regain their move for the turn, granted they have not gone over the agreed upon move limit per turn (e.g. 3 moves per turn maximum).

[0022] When it comes to promoting a pawn, this invention follows the rules of the conventional chess, with the addition of a rank reduction for the new piece. A suggested formula would be to decrease the rank of the promoted piece, by half the conventional worth of the promoted piece, rounded to the nearest number. For example, if a pawn with a rank of 7, is promoted to a knight (worth 3 points), the new knight will have the rank of 5. However, if it is promoted to a queen (worth 9 points), the new queen will have a rank of 2. The more powerful the promoted piece, more of a rank reduction is suggested.

[0023] The same move can not be made twice in the same turn. For example, if a rank 5 pawn tries to capture a rank 3 knight and fails, the same pawn will not be permitted to attack the same knight in the same turn. Each turn will have a limited number of moves (e.g. 3 MPT), and will be over once a piece has moved to another square, or has attacked and successfully captured another piece, or if the moves per turn limit is reached.

[0024] A king's rank will have absolutely no effect on a check or checkmate situation. A king shall not be able to evade check or checkmate, using it's rank alone. In case of a position where the king has to take the piece which has put it in check in order to come out of check (i.e. opposite color queen in an immediate square to the king), the chance of the king taking the opposite piece must be 100% and no less.

[0025] In order to provide an instrument to describe the board, an extension to FEN notation is proposed, where each piece has to be followed by it's rank as a number. For example, in conventional FEN, row 8 of the conventional board will be displayed as “rnbqkbnr”. The same row, comprised of now ranked pieces, will be displayed as “r6n8b1q2k7b5n4r0” in ranked FEN (R-FEN). Piece color and empty square notations would be untouched, where lowercase letters show black pieces, uppercase letters show white pieces, and any number between 1 and 8 not immediately preceded by a valid piece letter, would represent empty squares. A Fully formed R-FEN can be seen in FIG. 3. We also propose the same extension to be made for the PGN format, in order to reflect piece ranking in game history, with the addition of following symbols: to identify a failed capture attempt, » to identify a rank increase and « for rank decrease. A sample ranked PGN (R-PGN) can be seen in FIG. 4.

[0026] The winner of the game will be determined by conventional chess rules.