Implementation of a new variant of chess

Abstract

Implementation of a new variant of chess characterized because it has the following elements: a central processing unit for storing a database of reference, a database of reference created from all recorded chess games in history divided by categories, a selection and filtering process based on a specific algorithm that selects one single game in order to stablish the initial position of the new game, a chess software for installation in any device, electronic devices to play the new game online and unlimited number of users to play the game live; and because the starting position of the game is determined at random just before the start of play, being unknown by the players until the beginning of play and wherein the procedure for obtaining that initial position consists of setting a certain specified number of full moves, said number being called depth, from the starting position of classical chess and being the depths numbers all up to 10 and either integers, except 0, or the result of adding an integer plus 0.5; selecting at random one game from a single reference database made of high-skill human classical chess play and regularly updated; and initiating the game from the initial position the player with the white pieces if the depth number is an integer, otherwise the black pieces would initiate the game.

1 . Implementation of a new variant of chess characterized because it has the following elements:
 A central processing unit for storing a database of reference (1)   A database of reference created from all recorded chess games in history divided by categories (2)   A selection and filtering process based on a specific algorithm that selects one single game in order to stablish the initial position of the new game (3)   A chess software for installation in any device (4)   Electronic devices to play the new game online (5)   Unlimited number of users to play the game live (6)   
     
     
         2 . The implementation of  claim 1  wherein the selection and filtering process consists of the following steps:
 eliminating non-contemporary games, where contemporary games encompass a previous time period before a relevant reference date 
 eliminating all games where one of the players is at time of play below a certain level of rating representing a sufficiently high skill level, taking different levels in different time frames. 
 eliminating non-relevant games like slow rate played games, early draws games, blitz and blindfold games and computer games. 
 
     
     
         3 . The implementation described in  claim 1  characterized because the starting position of the game is determined at random just before the start of play, being unknown by the players until the beginning of play and wherein the procedure for obtaining that initial position consists of
 setting a certain specified number of full moves, said number being called depth, from the starting position of classical chess and being the depths numbers all up to 10 and either integers, except 0, or the result of adding an integer plus 0.5; 
 selecting at random one game from a single reference database made of high-skill human classical chess play and regularly updated 
 and initiating the game from the initial position the player with the white pieces if the depth number is an integer, otherwise the black pieces would initiate the game. 
 
     
     
         4 . the implementation described in  claim 1  wherein a statistical analysis tool is introduced within a mathematical framework of constrained optimization, in order to determine the optimal depths for competitive practice, which results are to be confirmed by experimentation. 
     
     
         5 . the implementation described in  claim 1  wherein alternatively for each depth the reference database of games can be converted into a database of either positions or initial sequences of play which appear with different frequencies; or variable depth and minor variations in the definition of the reference database. 
     
     
         6 . An algorithm for the process of randomly determining the initial position of the implementation described in  claim 1 , which verifies that the probability distribution of the initial positions of the game is representative of that of contemporary correct high-skill classical chess play and can be updated in order to accommodate its future changes, thus being able to track the collective opening preferences of human master chess.