U.S. Pat. No. 10,307,662

DETAILED DESCRIPTION

For the purposes of promoting an understanding of the principles in accordance with the embodiments of the present invention, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe the same. It will nevertheless be understood that no limitation of the scope of the invention is thereby intended. Any alterations and further modifications of the inventive feature illustrated herein, and any additional applications of the principles of the invention as illustrated herein, which would normally occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the invention claimed.

Those skilled in the art will recognize that the embodiments of the present invention involve both hardware and software elements which portions are described below in such detail required to construct and operate a game method and system according to the embodiments of the present invention.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.), or an embodiment combining software and hardware. Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), and optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied thereon, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any variety of forms, including, but not limited to, electromagnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF and the like, or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like or conventional procedural programming languages, such as the “C” programming language, AJAX, PHP, HTML, XHTML, Ruby, CSS or similar programming languages. The programming code may be configured in an application, an operating system, as part of a system firmware, or any suitable combination thereof. The programming code may execute entirely on the user's computer, partly on the user's computer, as a standalone software package, partly on the user's computer and partly on a remote computer or entirely on a remote computer or server as in a client/server relationship sometimes known as cloud computing. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagrams. As used herein, a “gaming device” should be understood to be any one of a general purpose computer, as for example a personal computer or a laptop computer, a client computer configured for interaction with a server, a special purpose computer such as a server, or a smart phone, soft phone, tablet computer, personal digital assistant or any other machine adapted for executing programmable instructions in accordance with the description thereof set forth above.

The embodiments of the present invention may be facilitated by an electronic gaming device whereby a single player plays against the electronic gaming device's processor as described herein. The electronic gaming device may be a standalone device and or series thereof forming part of a gaming device network or not. A block diagram of the electronic gaming device100is shown inFIG. 1. The exemplary electronic gaming device100may include a central processing unit (CPU) also deemed a processor105which controls the electronic gaming device100based on instructions stored in program read-only memory (ROM)110and pay table ROM115. Program ROM110stores executable instructions related to the operation of the gaming device100and which are generally permanent. CPU105may be connected to a video controller120which provides output to one or more video displays125. Similarly, an audio controller130provides audio output as dictated by the CPU105through speakers135. The aforementioned components, and others, may be attached to a circuit board forming a motherboard. In another embodiment, the electronic gaming device100may be linked to a central game server which allows players to select from a number of games via the electronic gaming device100. In such an embodiment, one or more processors integrated into the central server control the gaming device100based on instructions stored in program ROM110.

A user interface140may respond to buttons on button panel or display incorporating touch screen technology or any other devices providing means for users to communicate with, and instruct, the electronic gaming device100.

Those skilled in the art will recognize that the configuration and features of the electronic gaming device100disclosed herein are exemplary and may be altered in any number of ways without impacting the embodiments of the present invention.

FIG. 2shows a block diagram of a gaming network200which may be used to facilitate play of the game via linked gaming devices according to the embodiments of the present invention. The gaming network200comprises a central processor205(e.g., processor-equipped game server) in communication with multiple gaming devices215-1through215-N as described inFIG. 1. The central processor205runs the game software210.

FIG. 3shows a block diagram of a wireless system250which may be used to facilitate remote play of the game according to the embodiments of the present invention. The wireless network system200comprises a processor-equipped game server255, including one or more processors running game software260, and remote devices265-1through265-N (e.g., smart phones) configured to access said game server255facilitating game play on the remote devices265-1through265-N. In another embodiment, the video game according to the embodiments of the present invention may be in the form of a software application (“App”) downloadable onto smart phones, tablets or computers and playable via processing power and a user interface associated therewith.

While the embodiments of the present invention are suitable for numerous types of games, the description herein focuses on the game of quantum chess.

Quantum mechanics is a relatively new but yet well-studied field of science. The concept is a challenge for most typical people to grasp with any comfort or clarity. The embodiments of the present invention are directed, in part, to permit players to more intuitively grasp quantum concepts such as superposition, measurement, entanglement and interference. The concept of superposition involves a game piece having some probability of being on two spaces; the concept of measurement involves measuring the value of a space to determine if the game piece occupies the space; the concept of entanglement involves moving a game piece to a space through another game piece in superposition which would, if the game piece was in the way, be improper—the two game pieces are thereby entangled; and the concept of interference involves a wave function describing game pieces affecting how game pieces combine.

For purposes of foregoing an unrealistic amount of computer memory and rendering the quantum chess game understandable, certain game rules may be integrated. Depending on the embodiment, the rules may be used wholesale or in various combinations as desired. Table 1 shows exemplary game rule options which are described in more detail below.

TABLE 1Power Pieces (i.e., non-pawns) May Perform Quantum Moves (PawnsMoved in Traditional Manner)Quantum Moves May Not Be Used to Capture an Opponent's GamePiece (i.e., a Player May Not Move a Game Piece onto a Space ThatHas Any Probability of Occupancy by an Opposing Game Piece)Attempting to Capture a Piece Occupying a Space in SuperpositionCaptures the Game Piece on the Substate for Which the Game Piece isActually Present in the Target SpaceAttacking from a Space in Superposition Only Acts on the Subspace forWhich the Game Piece is PresentMeasurement of the Superposition Occurs When a Space is PossiblyOccupied by More than One Game Piece TypeGame is Won by Killing the King on all Possible Game BoardConfigurationsMay Only Make Moves that Change the State of the Game BoardMay Only Make Moves from or Measure Spaces that the Player hasGame Pieces Occupying

In one embodiment, players may take several actions per move comprising (i) swiping a piece equally between two spaces (superposition); (ii) measuring a space to determine if the space is occupied (measurement); and (iii) attacking a space by moving a game piece onto an occupied space with a standard move (attack).

FIG. 6Ashows a flow chart500detailing a broad overview of quantum chess game procedures according to the embodiments of the present invention. At505, a quantum chess game starts. At510, the system waits for player input. The game may be played between two players or a single player against a computer. At515, the system translates input to action in the form of a standard or quantum move. In one embodiment, pawns are moved in a conventional/standard manner (i.e., not subject to quantum parameters). All other pieces (e.g., Kings, Queens, Rooks, Bishops and Knights) are moved pursuant to quantum parameters. If the proposed move is improper, the flow chart500loops back to510. At520, the system executes the move. The move may be unitary or non-unitary as described below. At525, a conditional measurement occurs. At530, an end condition is checked. If the end condition is met (e.g., King is dead), at535, the game ends. If the end condition is not met, at540, the move sequence ends, control is moved to the other player and the flow chart500loops back to510for the other player's input.

FIG. 6Bshows a user interface game system interaction flow chart550according to the embodiments of the present invention. A user interface555communicates with a game controller560in communication with the quantum system565. A user input570is received by the game controller560which transmits the appropriate standard or quantum move unitary based on the user input and the spaces involved575to the quantum system565. The quantum system565then transmits the quantum state580to the game controller560. The game controller560then causes a measurement if the space has a non-zero occupancy by more than one type of game piece585and provides visual information including translation of quantum information590to players via the user interface550.

A quantum move allows a game piece to move up to two standard moves in one turn.FIG. 5Ashows a standard move associated with a pawn450-1. With the quantum move, the game piece may or may not move. The quantum move creates a superposition of game board configurations corresponding to each of the possibilities.FIG. 4Ashows possible quantum moves (i.e., two standard move combinations) associated with the Queen405and made up of a first leg402and multiple second leg options404in this instance.FIG. 4Aalso shows two pawns420,425having been moved in a standard manner. In one embodiment, a quantum move cannot be used for attack. That is, a standard move must be used for an attack.FIG. 4Bshows the game board after a quantum move of the Queen405from space D1to space B3. As shown, the Queen405-1has an equal probability of being on space D1and space B3. To represent the superposition, a Queen game piece is shown on both space D1and space B3with only half of each Queen405-1being fully colored. The half-colored portion represents the fact that there is a 50% chance the Queen405-1is on space D1and a 50% chance the Queen405-1is on space B3.FIG. 4Cshows a potential quantum move of Bishop405-2from space C8to space B3occupied by Queen405-1. The quantum move comprises a first leg430and second leg435. Since in this embodiment a quantum move cannot be used for an attack, the move triggers a measurement action to determine if the Queen405-1is actually on space B3.FIG. 4Dshows the measurement action occurring in space B3. As shown, the Queen405-1and Bishop405-2are both shown on space B3in reduced size. After a brief time period, the results of the measurement become known as shown inFIG. 4E. Two results are possible with the measurement—(i) if the Queen405-1is on space B3, the Queen405-1will appear fully colored and the Queen405-1on space D1will disappear and the Bishop405-2returns to space C8(this is result shown inFIG. 4E) or (ii) if the Queen405-1is not on space B3, the Queen405-1on space B3disappears and the Bishop405-2takes its place on space B3and the Queen405-1on space D1returns to being fully colored (this is not an attack because the Queen405-1was never occupying space B3).

FIGS. 5A-5Dshow an alternative game board design with alternative game pieces depicting superposition.FIG. 5Ashows a standard move of Pawn450-1from E2to E4.FIG. 5Bshows that the King450-2has been the subject of a quantum move and now has an equal chance of occupying space D1and space B3.FIG. 5Cshows that the Knight450-3has been the subject of a quantum move and now has an equal chance of occupying space E3and space F6. InFIG. 5Dshows a Rook450-4that has an unequal chance of occupying two different spaces, namely space C4and space F3. As shown, the Rook450-4has a better chance of occupying space F3than space C4as represented by the 75% colored game piece on space F3versus the 25% colored game piece on space C4.

The magnitude of the amplitude of the depends on the state of the game board. Initially the amplitudes are weighted evenly so that there is a 50-50 chance the game piece moved or did not move. A game piece follows all possible paths to the target space such that its amplitude is divided among the possible paths. A path that has some probability of being blocked (i.e., a space in the path has a non-zero probability of having a game piece) decreases the amplitude that the piece moved. A probability1blocked path is not deemed a possible path.

In one embodiment, the quantum move is performed using the square root of a swap unitary while the standard move is performed using the swap unitary. The square root swap means that two identical consecutive moves have the effect of giving the game piece probability1of being on the target space. The same effect is achieved by two standard moves in sequence. The unitaries act on source spaces and target spaces. Valid move unitaries are determined based on the states of the spaces involved as well as the states of all spaces in the path therebetween. A Queen, for example, may not move to a space if for all basis states (i.e., board configurations) present in the superposition there is a game piece of any type between the target and the source. The unitary describing such a move is deemed invalid and is not considered in the list of possible moves for a player to perform. In one embodiment, the Knight does not have such restrictions rendering it one of the most important quantum chess game pieces.

Capturing a game piece is non-unitary but in an alternative embodiment can be made unitary by using invisible “ancilla” spaces to store captured game pieces. Capturing then changes the target space value to empty and then performs the appropriate movement unitary between the source and target.

When two or more game pieces have a non-zero probability of occupying the same space a measurement occurs to reduce the count to at most one piece in the space. The system measures a particular place value in the space to determine if the game piece is on the space or not based on its probability given the superposition describing the game board. In one embodiment, a random number is selected and if the number is less than or equal to the probability of finding the game piece in the space then the game piece is on the space and superposition is collapsed to include only those basis states where the game piece is occupying the space. Otherwise, the superposition is collapsed to include only those basis states where the game piece is not occupying the space. Alternative embodiments include the player selecting which value to measure for or measuring the space to determine the exact value leaving no possibility for superposition after the measurement.

Flow charts7A-7E show more detailed game procedures according to the embodiments of the present invention. Flow chart700ofFIG. 7Adetails a game procedure starting with a first player move with the chess board state set at its initial state. At705, the first player inputs an action. At710, it is determined if the action is a chess piece move (i.e., swipe). If not, at715, the system identifies the action as a measurement. If, at715, it is determined that the action is a chess piece move, at720, the move is validated. At725, it is determined if the move is valid. If not, the flow chart700loops back to705. If the move is valid, at730, it is next determined if the move initiates an attack (i.e., non-quantum move). If the move initiates an attack, at735, the attack is identified and, at740, the attack action is executed. If the move does not initiate an attack, at745, the move is identified and, at740, the move action is executed. At715, if the player input is not a move/swipe action then, at750, the player input represents a measurement action. At755, the measurement is validated. At760, it is determined if the measurement is valid. If not, the flow chart700loops back to710. If the measurement is valid, at765, the measurement is identified and, at740the measurement action is executed. At770, a win condition is checked. At775, it is determined if either player has won the chess game. If so, at780, the game ends. If no player wins at775, at785, the system swaps players permitting the other player to initiate an input at705.

Flow chart800ofFIG. 7Bdetails a sequence of events associated with beginning the execution process. At805, an action based on a player input is to be executed. At810, it is determined if the action is a measurement. If so, at815, the measurement of space a is executed (as detailed by flow chart900ofFIG. 7C). If the action is not a measurement action, at820, it is determined if the action is a move. If so, at825, the move (involving spaces a and b) is executed (as detailed by flow chart1000ofFIG. 7D). If the action is not a measurement or move, at830, the action is deemed an attack. At835, the measurement of space a is executed (as detailed by flow chart850ofFIG. 7C). At840, it is determined if the player occupies space a, after which, at845, the measurement of space b is executed. At850, it is determined if an opponent occupies space b. At855, an attack is executed (as detailed by flow chart1110ofFIG. 7E).

Flow chart900ofFIG. 7Cdetails a measurement action of space a. At905, a value for space a is probabilistically chosen. At910, the superposition state is updated and the measurement action is visually animated. At915, the board view is updated.

Flow chart1000ofFIG. 7Ddetails a move action is executed. At1005, the superposition state is updated to reflect move between space a and b and the move action is visually animated. At1010, the board view is updated.

Flow chart1100ofFIG. 7Edetails an attack action involving pieces potentially occupying spaces a and b. At1105, the superposition state is updated so that opponent does not occupy space b and the attack action is visually animated. At1110, the board view is updated.

FIGS. 8A through 8Cshow screen shots depicting the possible outcomes of an attack. Screen shot1201ofFIG. 8Ais a failed attack based on a measurement that the attacking piece is not on the space from which it sought to attack. Screen shot1202ofFIG. 8Bis a failed attack based on a measurement that the attacked piece is not on the space on which it is being attacked. Screen shot1203ofFIG. 8Cis a successful attack based on a measurement that the attacking piece occupies the space from which it is attacking and the attacked piece occupies the space on which it is being attacked.

Although the invention has been described in detail with reference to several embodiments, additional variations and modifications exist within the scope and spirit of the invention as described and defined in the following claims.