Computerized bridge game including storage of deals used for constructing players

Claim 2

Bridge game apparatus having a first computer system comprising a microprocessor, memories, and input and output units including at least one alphanumeric keyboard, a display screen, and a playing card reader, wherein the microprocessor of said first computer system comprises: means for controlling said input and output units in response to being connected to at least one of the following two elements: a prerecorded pre-dealt deal module comprising a memory in which the deals are recorded, means for connecting to the microprocessor of said first computer system, means for selecting one of the deals recorded in the memory, means for reconstructing the deal by attributing cards to player positions, means for inputting bids made by the players, means for comparing bids entered by said inputting means with bids recorded in the memory, and means for displaying the optimum final contract together with prerecorded comments; and an intelligent play module removably connected to the microprocessor of said first computer system for analyzing the essential stages of the game including bidding, opening, and card play on an arbitrary deal when taking the place of at least one player, said analysis being performed by means of a second computer system comprising microprocessors and memories containing knowledge bases with the rules of the game for bidding, for opening, and for card play, data bases containing all of the information accessible to the replaced player, and inference engines for applying the rules of the knowledge bases to the information in the data bases, for recording significant results, and for updating the data bases, in order to determine each action of the player replaced by the second computer system; and means for causing said first computer system to operate as an instructional apparatus when connected to the prerecorded pre-dealt deal module and for causing said first computer system to operate as a high level play apparatus when said first computer system is connected to the intelligent play module of said second computer system.

Claim 3

Apparatus according to claim 1, wherein the deal module and the intelligent play module in combination are removable from the apparatus.

Claim 4

Apparatus according to claim 1, wherein the intelligent play module of the second computer system comprises a master microprocessor associated with a program memory and a work memory, and slave microprocessors associated with program memories and working memories and connected to the master microprocessor in order to execute independent tasks simultaneously.

Claim 5

Bridge game apparatus having a first computer system comprising a microprocessor, memories, and input and output units including at least one alphanumeric keyboard, a display screen, and a playing card reader, wherein the microprocessor of said first computer system comprises; means for controlling said input and output units in response to being connected to at least one of the following two elements: a prerecorded pre-dealt deal module comprising a memory in which the deals are recorded, means for connecting to the microprocessor of said first computer system, means for selecting one of the deals recorded in the memory, means for reconstructing the deal by attributing cards to player positions, means for inputting bids made by the players, means for comparing bids entered by said inputting means with bids recorded in the memory, and means for displaying the optimum final contract together with prerecorded comments; and an intelligent play module in the form of a second computer system comprising micro-processors, memories containing knowledge bases corresponding to the rules of bridge for bidding, opening, and card play, means for connecting said intelligent play module to the microprocessor of said first computer system, means for analyzing the various stages of the game on a given deal in the place of at least one player, and means for determining during each stage of the game the best action for the replaced player; and means for causing said first computer system to operate as an instructional apparatus when said first computer system is connected to the prerecorded pre-dealt deal module and for causing said first computer system to operate as a high level play apparatus when said first computer system is connected to the intelligent play module of said second computer system. wherein said first computer system comprises a board in which the microprocessor of said first computer system is housed, said board being fitted with four display screen, four keyboards, and four card readers, each screen being associated with one of the keyboards and one of the readers at a place for a player.

Claim 6

Bridge game apparatus having a first computer system comprising a microprocessor, memories, and input and output units including at least one alphanumeric keyboard, a display screen, and a playing card reader, wherein the microprocessor of said first computer system comprises; means for controlling said input and output units in response to being connected to at least one of the following two elements: a prerecorded pre-dealt deal module comprising a memory in which the deals are recorded, means for connecting to the microprocessor of said first computer system, means for selecting one of the deals recorded in the memory, means for reconstructing the deal by attributing cards to player positions, means for inputting bids made by the players, means for comparing bids entered by said inputting means with bids recorded in the memory, and means for displaying the optimum final contract together with prerecorded comments; and an intelligent play module in the form of a second computer system comprising micro-processors, memories containing knowledge bases corresponding to the rules of bridge for bidding, opening, and card play, means for connecting said intelligent play module to the microprocessor of said first computer system, means for analyzing the various stages of the game on a given deal in the place of at least one player, and means for determining during each stage of the game the best action for the replaced player; and means for causing said first computer system to operate as an instructional apparatus when said first computer system is connected to the prerecorded pre-dealt deal module and for causing said first computer system to operate as a high level play apparatus when said first computer system is connected to the intelligent play module of said second computer system. wherein said first computer system comprises a board in which the microprocessor of said first computer system is housed, said board being fitted with four display screen, four keyboards, and four card readers, each screen being associated with one of the keyboards and one of the readers at a place for a player.

Claim 7

Apparatus according to claim 4, comprising at least one independent box containing a playing card reader, an alphanumeric keyboard, and means for connecting via electrical conductors, infrared radiation, or ultrasound to the microprocessor of said first computer system controlling the inlet and outlet units.

Claim 8

Apparatus according to claim 4, wherein the board of said first computer system includes a central display screen placed between two of the above-mentioned screens for constituting, together therewith, a large-sized screen.

Claim 9

Apparatus according to claim 4, wherein along the sides of the board of said first computer system there are indicator means for indicating locations for playing cards.

Claim 12

The method of playing bridge according to claim 8, said method further comprising the steps of using the microprocessor to control the various input and output units in order to: record the number of players present and their places; select a deal in a memory containing a determined number of recorded deals; reconstruct the selected deal by reading the playing cards and displaying the place of the player to receive each card as read; and input each bid from each player present, compare that bid with a corresponding bid prerecorded in the memory, correct it if necessary, display the final contract, together with the prerecorded comments, and keep a score.

Claim 13

A method according to claim 9, further comprising the step of displaying the bid made by a player so long as it is identical with the bid prerecorded in memory, and otherwise in requesting the same player to make a different bid and then in displaying the correct bid as recorded in the memory.

Claim 14

A method according to claim 9 or 10, comprising the step of, after card play by the players present, displaying the essential stages of the game prerecorded in memory, together with an appropriate commentary.

Claim 15

A method according to claim 11, wherein for bidding, it comprises the steps of selecting a first knowledge base in the memory of the second computer system, said first base containing rules for decoding bids made by the other players, a second knowledge base containing rules for producing bids, five data bases respectively containing information on the cards held by the player replaced by the system, information on cards deemed to be held by its partner, information deduced from the bids made by the replaced player, information on the cards held by said player and the cards probably held by its partner, and information deduced from the bids of the opponents, then in applying the rules of the knowledge bases successively to the information in the data bases in order to determine the best bid.

Claim 16

A method according to claim 12, wherein in order to produce a bid, it comprises the steps of decoding the bid made by the partner of the replaced player an din recording that information in a data base, then in producing the bid of the replaced player and in recording the corresponding information in a data, and then in decoding said bid using the rules of the first knowledge base and recording the corresponding information in the corresponding data base.

Claim 17

A method according to claim 11, wherein, for opening, the method comprises the steps of selecting two knowledge bases containing rules for selecting a suit and rules for selecting a card within a suit, and four data bases containing information corresponding respectively to the cards of the replaced player, to that player's bids, to the bids of its partner, and to the bids of their opponents, then initially selecting a suit by applying the corresponding rules to the data bases, and subsequently determining the opening card in a manner similar to that in which the opening suit was determined.

Claim 18

A method according to claim 14, wherein when two suits may be used for opening, the method comprises the steps of attributing a weight to each suit and to the corresponding card within the suit, in summing the weights of the suit and the card, and in comparing the sums in order to determine the opening card.

Claim 19

A method according to claim 11, wherein, for card play, the method comprises the step of not selecting those data bases which contain the cards of the opponents of the replaced player when the replaced player is the declarer, and in selecting them and using them when the replaced player is an opponent of the declarer.

Claim 20

A method according to claim 16, characterized in that for each card to be played, the method comprises the steps of initially determining which cards should not be played, then simulating play using the remaining cards by proceeding as follows: dynamic analysis of play context and establishing a dynamic data base; tactical analysis of play suit-by-suit and simulating the game in part; and then strategic analysis of the entire game with full simulation using all suits.

Claim 21

A method according to claim 17, comprising the steps of continuously re-checking the data of the dynamic data base, in changing them if necessary each time new information is acquired, and in repeating all of the simulations each time new information is acquired which was not previously known or predicted.

Claim 22

A method according to claim 17 or 18, comprising the steps of recording in the dynamic data base: firstly information such as the distribution of cards in the various suits, the ways in which the declarer and dummy may get the lead, and the suits to be ruffed, to be unblocked, and to be discarded, and secondly functions to be optimized consisting, for example, in taking the lead, in giving to partner, in not giving the lead to an opponent, and in attempting a finesse on a given card.