CA2168555A1 - Computerized device useful in teaching problem solving - Google Patents
Computerized device useful in teaching problem solvingInfo
- Publication number
- CA2168555A1 CA2168555A1 CA002168555A CA2168555A CA2168555A1 CA 2168555 A1 CA2168555 A1 CA 2168555A1 CA 002168555 A CA002168555 A CA 002168555A CA 2168555 A CA2168555 A CA 2168555A CA 2168555 A1 CA2168555 A1 CA 2168555A1
- Authority
- CA
- Canada
- Prior art keywords
- solution
- computer
- game
- hints
- screen
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
- G09B19/00—Teaching not covered by other main groups of this subclass
- G09B19/22—Games, e.g. card games
-
- A—HUMAN NECESSITIES
- A63—SPORTS; GAMES; AMUSEMENTS
- A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
- A63F3/00—Board games; Raffle games
- A63F3/02—Chess; Similar board games
- A63F3/022—Recording or reproducing chess games
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
- G09B7/00—Electrically-operated teaching apparatus or devices working with questions and answers
- G09B7/02—Electrically-operated teaching apparatus or devices working with questions and answers of the type wherein the student is expected to construct an answer to the question which is presented or wherein the machine gives an answer to the question presented by a student
- G09B7/04—Electrically-operated teaching apparatus or devices working with questions and answers of the type wherein the student is expected to construct an answer to the question which is presented or wherein the machine gives an answer to the question presented by a student characterised by modifying the teaching programme in response to a wrong answer, e.g. repeating the question, supplying a further explanation
Abstract
A computerized method for teaching games (11) of the type having game equipment (13) which is sequentially manipulated during the play of the game such as Chess, Checkers, Bridge, Backgammon, Go, wherein the computer (11) stores selectable hints (16, 17, 18, 19) for solving presented problems.
Description
WO 9S/05639 2 1 6 8 ~ 5 5 PCTtUS94/08138 CO~ ~K~Fn GAME TF-~Ç~1~G METHOD
R~ÇRGROUND OF THE lNV~ ON
The present invention relates to a computerized method for te~ching g~mes and, in particular, to a computerized te~rhing method 5 for g~mes of the type having game eq~lipment which is sequentially m~ni~ulated during the play of the game.
The method of the present invention will be discussed and described in connection with the game of chess although it will be evident from what follows that the method of the present invention is 10 applic~hle to any game that includes sequentially m~nipulated game equipment, such as Checkers, Bridge, Backg~mmon, Go, etc.
While there are presently available numerous computerized game simulations, including chess, they are for the most part of the type where the computer takes the part of one of the opponents in the 15 game and the game is played to finality to determine a winner.
The present invention relates to a method wherein the object is not to simulate a game opponent for the purpose of determinin~ a winner, but rather to present in a novel format a series of problems that occur during the play of the game and which when mastered 20 increases a player's prowess.
SU~a~ARY OF THE lNV~ ON
In the present invention, all or a portion of a chessboard is simulated on a portion of a computer screen and a number of 25 simulated chess pieces appear at various locations on the chessboard so as to est~hli.~h a problem to be solved by one or more steps comprising one or more moves of one or more of the pieces appearing on the screen. In order for the player to know immediately whether or not a given selected step (move of a chess piece) is the correct step 30 predetermined for the solution of the problem, only the predetermined step will be acknowledged by the computer. VVhen the game is chess, a correct step may be one of a plurality of equivalent moves. Thus, a correct step may be achieved by more than one move.
WO 9SI05639 2 1 6 8 5 5 ~ PCTIUS94/08138 In addition to, and in comhin~tion with, the simulated chesshoard and chess pieces, the player is able to prompt the computer to select one of several different hints for solving the problem. Each of the several hints av~ hle to the player can be 5 weighte~l to reflect the amount of information toward the solution of the problem that the hint cont~ine Iypically, in the course of solving the problem, the player may make one or more incorrect steps and may use one or more of the available hints. Depentling on the number of incorrect steps and/or 10 the number of hints utilized in order to solve the problem, a score is determined and ascribed to the solution of the problem. One of the features of the method of the present invention is that the particular problem presented to the player can be dependent upon the score achieved in one or more previously presented problems to the same 15 player. In this way, the more problems that a player solves, the more the computer knows about the player and the more the computer can select the best problem to be presented to the player.
Thus, it is an object of the present invention to provide a computerized te~ching method for g~mes of the type that include 20 game equipment and the play of which includes sequential movement of that equipment, wherein all or a portion of the game equipment is simulated on a computer screen to present a problem to be solved by one or more sequential moves of the equipment, wherein the computer only recognizes the sequential steps predetermined for the 25 solution of the problem, and wherein a plurality of hints for solving the problem are selectively revealed to the player at the player's option.
Another object is to include the further feature of est~hli.~hing a score for the solution of a problem based on the number of incorrect moves and/or the hints utilized in the course of solving the problem and/or 30 the time required to solve the problem, and utili~ing the score achieved in one or more previous problems to select the next problem to be presented to the player.
R~ÇRGROUND OF THE lNV~ ON
The present invention relates to a computerized method for te~ching g~mes and, in particular, to a computerized te~rhing method 5 for g~mes of the type having game eq~lipment which is sequentially m~ni~ulated during the play of the game.
The method of the present invention will be discussed and described in connection with the game of chess although it will be evident from what follows that the method of the present invention is 10 applic~hle to any game that includes sequentially m~nipulated game equipment, such as Checkers, Bridge, Backg~mmon, Go, etc.
While there are presently available numerous computerized game simulations, including chess, they are for the most part of the type where the computer takes the part of one of the opponents in the 15 game and the game is played to finality to determine a winner.
The present invention relates to a method wherein the object is not to simulate a game opponent for the purpose of determinin~ a winner, but rather to present in a novel format a series of problems that occur during the play of the game and which when mastered 20 increases a player's prowess.
SU~a~ARY OF THE lNV~ ON
In the present invention, all or a portion of a chessboard is simulated on a portion of a computer screen and a number of 25 simulated chess pieces appear at various locations on the chessboard so as to est~hli.~h a problem to be solved by one or more steps comprising one or more moves of one or more of the pieces appearing on the screen. In order for the player to know immediately whether or not a given selected step (move of a chess piece) is the correct step 30 predetermined for the solution of the problem, only the predetermined step will be acknowledged by the computer. VVhen the game is chess, a correct step may be one of a plurality of equivalent moves. Thus, a correct step may be achieved by more than one move.
WO 9SI05639 2 1 6 8 5 5 ~ PCTIUS94/08138 In addition to, and in comhin~tion with, the simulated chesshoard and chess pieces, the player is able to prompt the computer to select one of several different hints for solving the problem. Each of the several hints av~ hle to the player can be 5 weighte~l to reflect the amount of information toward the solution of the problem that the hint cont~ine Iypically, in the course of solving the problem, the player may make one or more incorrect steps and may use one or more of the available hints. Depentling on the number of incorrect steps and/or 10 the number of hints utilized in order to solve the problem, a score is determined and ascribed to the solution of the problem. One of the features of the method of the present invention is that the particular problem presented to the player can be dependent upon the score achieved in one or more previously presented problems to the same 15 player. In this way, the more problems that a player solves, the more the computer knows about the player and the more the computer can select the best problem to be presented to the player.
Thus, it is an object of the present invention to provide a computerized te~ching method for g~mes of the type that include 20 game equipment and the play of which includes sequential movement of that equipment, wherein all or a portion of the game equipment is simulated on a computer screen to present a problem to be solved by one or more sequential moves of the equipment, wherein the computer only recognizes the sequential steps predetermined for the 25 solution of the problem, and wherein a plurality of hints for solving the problem are selectively revealed to the player at the player's option.
Another object is to include the further feature of est~hli.~hing a score for the solution of a problem based on the number of incorrect moves and/or the hints utilized in the course of solving the problem and/or 30 the time required to solve the problem, and utili~ing the score achieved in one or more previous problems to select the next problem to be presented to the player.
2 1 6~5,5~
BRIEF DESCR~TION OF T~ DRAWINGS
Figure 1 is a represent~tio~ of a computer screen illustrating the various elements of the present invention in connection with the game of chess.
Figure 2 is the same as Figure 1 with certain design~ted portions of the screen activated.
Figure 3 is the same as Figure 1 with other portions of the screen activated.
Figure 4 is the s~me as Figure 1 with one of the chess pieces moved to a new location.
Figure 5 is the same as Figure 1 with the chess pieces moved to new locations and certain features of the invention shown activated.
Figure 6 is the same as Figure 5 with the chess pieces shown in a new location.
Figure 7 is the s~me as Figure 6 with the chess pieces once again shown in a new loc~tion.
DESCRIPTIO~ OF pREFFl2RF~n EMBODL~N-~
Referring to Figure 1, a computer screen 11 simulates a chessboard 12 (a portion of the board may be adequate for some problems) on which are arranged a number of chess pieces 13 in a configuration establishing a problem to be solved. The goal of the problem, as well as any other inform~tion that might be of interest can be stated in a text box 14 (which can overlay other text boxes when selected). A plurality of hint text boxes 16, 17, 18, and 19 are presented on the computer screen along with the equipment ~sim~ tion.
The problem presented is solved by one or more predetermined steps achieved by sequentially moving one or more of the pieces 13 according to the rules of chess. If the problem calls for the player to move the white pieces then the computer operates the black pieces and vice versa. The most convenient way for moving a piece 13 is to drag it from one square to the square that the player believes is the next sequential move in solving the problem. The use of a mouse for dr~inE~ items on a screen is well known in the art and while this is a convenient way of moving pieces of a game of this sort, it is well within the art to use other methods including a keyboard.
If the player moves the selected piece to a predetermined correct location for the solution of the problem, the piece will stay at the new location to which it has been moved. If, how~v~l, an attempt is made to make other than a predetermined move, the piece moved will automatically return to it's origin~ting square indicating to the player that a correct move was not selected. Other ways of alerting the player that an incorrect move has been attempted is to generate a sound or flash a message on the screen.
At any time during the attempted solution of the problem, the player can receive a hint by selecting one of the hint text boxes 16, 17, 18, or 19. Prompting the computer to reveal the contents of one of these hint text boxes results in either a graphic or t~ l hint being presented in that text box. The hints in the text boxes can contain varying amounts of information for the solution of the problem so as to be proessively more revealing such that selection of the hint in text box 19, for example, will be more helpful in solving the problem than any of the other hints. The hint in text box 18 will be more revealing than the hints in text boxes 16 and 17, etc. The player is at liberty to choose any one of the text boxes 16-19 at any time to obtain a hint and is not required to proceed in any order. Thus, while the hints have a hierarchy r~nging from general to specific, they may be selected in any order desired by the player. The score for solving a problem can be dependent not only on the number of hints used but the information content of the hints as well.
When the problem to be solved requires more than one sequential move of the chess pieces, the hints available from all or some of the hint text boxes 16-19 will likely change with each successive correct step taken towards the solution of the problem.
Thus, by way of ~mple, selection of the hint text box 16 will bring forward certain information for solving the problem when all the WO 95105639 2 ~ 6 ~ ~ 5 5 PCI/US94/08138 pieces are in their original squares, but bring forward difrel~llt hint information when selected after one or more successful moves tc,walds the solution have been made. In Ws way, the av~ hle hints to the player are always appropriate for the configuration of the pieces as 5 they exist at the time that the hint is called for and relate to the moves yet to be made to solve the problem.
It is a feature of the invention that a series of related problems be stored in the computer and presented to the player in order to achieve a proficiency in a particular aspect of the game of chess. In order to acquire this proficiency, it is useful if the problems are presented in an order which takes into account the skill and mastery of the player at the time.
During the solution of a problem, a player will take a certain amount of time to solve the problem and a player may also attempt one or more incorrect moves and may select one or more of the available hints. A score can be ascribed to the solution of any problem as a function of one or more of the following factors: (1) the number of incorrect moves attempted, (2) the number of hints selected, (3) the level (information content) of the hints selected, (4) the time taken to solve the problem, and (5) the number of related problems previously solved and their scores. Using one or any combination of these five factors or other factors, the computer maintains a scoring history for a given player and based on that scoring history, selects new problems to be solved by that player which are most appropriate for the player's demonstrated skill level. The more that the system of the present invention is used by a player, the more the computer knows about the user, and, thus, the more it can tailor the teaching to the capability of that player.
Thus, for teaching the game of chess the computerized method of the present invention includes the steps of: presenting on a portion of a computer screen a simulation of all or a portion of a chessboard together with representations of chess pieces arranged on the board to present a problem having a solution achieved by one or more predetermined steps achieved by a predetermined move or sequence W O 95/05639 PC~rrUS94/08138 2 1 6~55~
of moves of one or more of the chess pieces one or more times to one or more different locations on the board as permitted by the rules of chess; autom~tic~lly returning any moved piece to its origin~ting position on the board unless it is a predetelmined next move; storing in the computer memory a plurality of selectable hints for m~king a predetermined correct next move for the configuration of pieces on the screen wherein the hints are of varying specificity; and, optionally selecting a stored hint and revealing it on the computer screen. In addition, the solution of a problem can be scored as a function of the time taken to solve the problem, the number of incorrect moves (moves other than predetermined moves), and the number and/or specificity of hints selected during the solution of the problem. The computer stores a plurality of problems of varying difficulty. The scores achieved by the player are stored in the computer and used in selecting the next problem to be presented to the player.
In addition to the representation of a chessboard 12, chess pieces 13 and the hint boxes 16, 17, 18, and 19 in the preferred embo-liment, the computer screen also presents a "tool bar" 21 collllJlised of a plurality of separate "tools" 22 each represented by a graphical or textual icon. The tool bar 21 and it's tools 22 provide a col-~,ellient way to prompt the computer to initiate computer subroutines that effectuate the various steps of the method of the present invention.
Those features of the present invention previously described, as well as others which further enh~nce the teaching method of the invention are best revealed and described in connection with a step by step solution of a problem ut~ ing various method steps of the invention. For this purpose, reference is made to Figures 1-6, sequentially.
Referring to Figure 1, chess pieces 13 are arranged in a configuration that presents a problem to be solved. If the player does not immediately recognize the problem to be solved or the solution to the problem, a number of choices exist for obt~ining further information to assist in better underst~n~ling the problem and it's solution.
Referring to Figure 2, the pieces 13 remain in their original loc~tion.c as shown in Figure 1, but the text boxes 14 and 16 have been 5 activated to bring forth information about the problem and a hint. The text box 14 can be activated by either selecting (clicking a mouse when the cursor is on the screen area to be selected) the box itself or selecting tool 31 "About the Problem". ~imil~rly, the computer can be prompted to reveal the hint in text box 16, 17, 18, or 19 by either selecting the box itself or selecting tool 32, 33, 34, or 36, respectively.
Referring to Figure 3, the chess pieces 13 continue to remain in their original locations. If the player rem~in.s unsure of the next move and desires further information for m~king that move, the "Ghost" tool 37 can be selected from the tool bar 21 which will prompt the computer to identify certain of the chess pieces 13 (such as by t1imming the others) as the pieces involved in the solution of the problem. The particular way identifying the chess pieces involved in solving the problem is a m~tter of choice, and in addition to flimming the non-essential pieces, pieces could be idenfffied by color or size, etc. Uses of the "Ghost" feature can be taken into account in ascribing a solution score.
Referring to Figure 4, one of the chess pieces (in particular the black queen) is shown moved to a new location. Because it is a feature of the present invention that movement of any pieces other than predetermined pieces to any squares other than predetermined squares results in the piece being automatically returned to it's originating position, the player knows immediately that a correct piece has been selected and a correct move made when the piece rem~ins in it's new location. In addition, text is presented in the text box 14 acknowledging that a correct move was made along with other comments.
Referring to Figure 5, to discover how many moves remain to achieve the solution, tool 38, "Number of Moves to Solution" in the WO 95t05639 PCI/US94/08138 21 6855`~
tool bar 21 is selected producing the text 27. Further, the piece to be moved for the next correct step in the solution is revealed (highlighted) as a result of selecting the "From Square" tool 39 in the tool bar 21 and further, an ad-lition~l hint in text box 18 has been 5 revealed as a result of selecting "Hint 3" tool 34, (or selecting the text box 18 itselfl.
The movement of the black queen to it's new location autom~ffcally resulted in the computer having the white king capture the black queen as one of the predetermined moves in the sequence 10 le:~(ling to the solution of the problem. For convenience, the last moves of both the opponent (computer) and the player are listed in a "Last Move" text box 26 below the chessboard 12.
Referring to Figure 6, the black knight has been moved to capture the white bishop (which the computer acknowledges as a 15 correct move by permitting the black knight to remain in it's new location) and text in the text box 14 gives an expl~n~tion of the position.
Referring to Figure 7, after the computer was forced to move the white king out of check, the black knight captured the white queen 20 which is the predetermined final and correct move in solving the problem. Once again, text appears at 14 commenting on the position.
The foregoing example reveals some of the tools available to the player during the solution to a problem such as the use of the "Ghost"
tool 37, the "Hints" tools 32, 33, 34, and 36, the "Number of Moves to 25 Solution" tool 38, and information about the problem. There are adtiition~l tools 22 in the tool bar 21 that could also have been used.
These additional tools 22 include the "Key Squares" tool 41 which when selected prompts the computer to highli~ht the squares which are involved in solving the problem; the "Transforming Pieces"
30 tool 42 which when selected prompts the computer to outline (or otherwise identify) all chessboard 12 squares that contain pieces which move or are captured in the solution to the problem (this tool is only available when the final solution to the problem is a few moves from being achieved); the "Graphic Tn.~ight" tool 43 which graphically W O 9S/05639 2 1 6 8 5 5 5 PC~rtUS94tO8138 characterizes key pieces in the position. When a graphic incight piece is double selected (double clicked with a mouse), a help text box pops up on the screen (not shown) which ~xrl~ins in text the me~ning and intent of it's graphic. The "Suggested Moves" tool 44, when selected, 5 brings up a list of moves which the user might try, including a correct move wlth several "decoys". Selecting the move from the list m~kes the move on the board momentarlly. To actually make a suggested move, the user must physically move the piece on the board in the normal m~nner. The "Final Position" tool 46, when selected results in 10 the final position of the pieces on the chessboard representing the solution. Once again, this tool is best available when the solution to the problem is only a few moves away. The "To Square" tool 47 when selected, highlight~ the next square to which one of the pieces must be moved. The "Answer" tool 48, when selected highlights both the 15 square of the piece to be moved and it's destination square.
In addition to the tool bar 21, the computer screen also presents a navigation bar 23 having a plurality of navigation tools represented by graphic or textual icons. When the "Skip" navigation tool 24 is selected, the current problem is withdrawn and a new 20 problem is presented. The "Score" navigation tool 25 brings up the player's score for the last completed problem. In addition, the graphical icon tools permit the problems to be reset one step or to the very beginning of the problem.
In the preferred emborliment of the teaching method of the 25 invention the problems stored in the computer would be in sets. Each set of problems would end with the same steps but approach those steps from progressively more remote positions. For ~x~mple, the first chess problem of a set could be solved by step "a" followed by step "b". The second problem presented from the set would require a step 30 "c" (or possibly "c" and "d") to get the pieces to where they were in the first problem and again requiring step "a" followed by step "b" to solve the problem. The third problem could require a step "e" to get the pieces to the arrangement of the second problem, requiring steps "c", "d","a"and "b" to solve the problem. By presenting the problems in WO 95/05639 2 t ~ 8 5 ~5 PCT/US94/08138 these sets, the player gets a larger and larger view of the game while repeatedly practicing ftm~l~mental moves.
Thus, the method of the present invention advantageously includes the steps of storing in the computer for selective 5 presentz tion on the computer screen a set of problems solved by sequential mztnipulation of game equipment wherein the stored problems are related in that in their solution they all include among the steps required to solve the problem a common sequence of steps.
The present inv~ntion, while particularly suited to the game of 10 chess, is not uniquely so and, in fact, just about any game that includes game equipment which is sequentially moved during the play of the game is adaptable to the method of the present invention. By way of example, if the game simulated is bridge, there would be presented in the location where the chess game presents the board and pieces four 15 sets of bridge playing cards representing the cards remztining to be played in a hand of bridge. The problem solution might require one or more cards to be played with the declarer playing the cards assigned to that position as well as the dummy cards and the computer playing the defender's cards. The information box 14 and the hint boxes 16-20 19 function in the same way as described above in connection with thegame of chess as would most of the tools 22 in the tool bar 21. The tools 22 might be differently labeled or use different graphical icons but their functions would remain largely the same. As in connection with chess, any z~ttempt to play a card other than one of the 25 predetermined correct cards would result in the card immediately returning to it's original position indicating to the player that an incorrect move was attempted.
The adaptation of the method of the present invention to such ~mes as Checkers, Go, Rzlckgzmmon and even Scrabble are obvious 30 and require no further explanation. In all of the games, the computer presents a simulation of all or a part of the game equipment in a condition posing a problem to be solved. The solution of the problem is achieved by sequential mzln~ z~tion of the simulated game equipment assisted by hints and information selected by the player as WO 9S/05639 2 t 6 8 5 5 5 PCTIUS94/08138 desired. Each problem upon completion is scored and that score is retained in the computer whereby the computer gauges the ability of the player and presents new problems most a~ o~liate for the player's demonstrated skill level.
All of the computer functions described in connection with the present invention are well within the skill of those versed in the art of computer progr~mming and do not of themselves form any part of the invention. Other adaptations and modific~tion~ of the invention are possible and thus the scope of the invention is not to be limited by the specific e~mples presented herewith, but are rather to be limited only by the scope of the ~ im~s that follow.
Figure 1 is a represent~tio~ of a computer screen illustrating the various elements of the present invention in connection with the game of chess.
Figure 2 is the same as Figure 1 with certain design~ted portions of the screen activated.
Figure 3 is the same as Figure 1 with other portions of the screen activated.
Figure 4 is the s~me as Figure 1 with one of the chess pieces moved to a new location.
Figure 5 is the same as Figure 1 with the chess pieces moved to new locations and certain features of the invention shown activated.
Figure 6 is the same as Figure 5 with the chess pieces shown in a new location.
Figure 7 is the s~me as Figure 6 with the chess pieces once again shown in a new loc~tion.
DESCRIPTIO~ OF pREFFl2RF~n EMBODL~N-~
Referring to Figure 1, a computer screen 11 simulates a chessboard 12 (a portion of the board may be adequate for some problems) on which are arranged a number of chess pieces 13 in a configuration establishing a problem to be solved. The goal of the problem, as well as any other inform~tion that might be of interest can be stated in a text box 14 (which can overlay other text boxes when selected). A plurality of hint text boxes 16, 17, 18, and 19 are presented on the computer screen along with the equipment ~sim~ tion.
The problem presented is solved by one or more predetermined steps achieved by sequentially moving one or more of the pieces 13 according to the rules of chess. If the problem calls for the player to move the white pieces then the computer operates the black pieces and vice versa. The most convenient way for moving a piece 13 is to drag it from one square to the square that the player believes is the next sequential move in solving the problem. The use of a mouse for dr~inE~ items on a screen is well known in the art and while this is a convenient way of moving pieces of a game of this sort, it is well within the art to use other methods including a keyboard.
If the player moves the selected piece to a predetermined correct location for the solution of the problem, the piece will stay at the new location to which it has been moved. If, how~v~l, an attempt is made to make other than a predetermined move, the piece moved will automatically return to it's origin~ting square indicating to the player that a correct move was not selected. Other ways of alerting the player that an incorrect move has been attempted is to generate a sound or flash a message on the screen.
At any time during the attempted solution of the problem, the player can receive a hint by selecting one of the hint text boxes 16, 17, 18, or 19. Prompting the computer to reveal the contents of one of these hint text boxes results in either a graphic or t~ l hint being presented in that text box. The hints in the text boxes can contain varying amounts of information for the solution of the problem so as to be proessively more revealing such that selection of the hint in text box 19, for example, will be more helpful in solving the problem than any of the other hints. The hint in text box 18 will be more revealing than the hints in text boxes 16 and 17, etc. The player is at liberty to choose any one of the text boxes 16-19 at any time to obtain a hint and is not required to proceed in any order. Thus, while the hints have a hierarchy r~nging from general to specific, they may be selected in any order desired by the player. The score for solving a problem can be dependent not only on the number of hints used but the information content of the hints as well.
When the problem to be solved requires more than one sequential move of the chess pieces, the hints available from all or some of the hint text boxes 16-19 will likely change with each successive correct step taken towards the solution of the problem.
Thus, by way of ~mple, selection of the hint text box 16 will bring forward certain information for solving the problem when all the WO 95105639 2 ~ 6 ~ ~ 5 5 PCI/US94/08138 pieces are in their original squares, but bring forward difrel~llt hint information when selected after one or more successful moves tc,walds the solution have been made. In Ws way, the av~ hle hints to the player are always appropriate for the configuration of the pieces as 5 they exist at the time that the hint is called for and relate to the moves yet to be made to solve the problem.
It is a feature of the invention that a series of related problems be stored in the computer and presented to the player in order to achieve a proficiency in a particular aspect of the game of chess. In order to acquire this proficiency, it is useful if the problems are presented in an order which takes into account the skill and mastery of the player at the time.
During the solution of a problem, a player will take a certain amount of time to solve the problem and a player may also attempt one or more incorrect moves and may select one or more of the available hints. A score can be ascribed to the solution of any problem as a function of one or more of the following factors: (1) the number of incorrect moves attempted, (2) the number of hints selected, (3) the level (information content) of the hints selected, (4) the time taken to solve the problem, and (5) the number of related problems previously solved and their scores. Using one or any combination of these five factors or other factors, the computer maintains a scoring history for a given player and based on that scoring history, selects new problems to be solved by that player which are most appropriate for the player's demonstrated skill level. The more that the system of the present invention is used by a player, the more the computer knows about the user, and, thus, the more it can tailor the teaching to the capability of that player.
Thus, for teaching the game of chess the computerized method of the present invention includes the steps of: presenting on a portion of a computer screen a simulation of all or a portion of a chessboard together with representations of chess pieces arranged on the board to present a problem having a solution achieved by one or more predetermined steps achieved by a predetermined move or sequence W O 95/05639 PC~rrUS94/08138 2 1 6~55~
of moves of one or more of the chess pieces one or more times to one or more different locations on the board as permitted by the rules of chess; autom~tic~lly returning any moved piece to its origin~ting position on the board unless it is a predetelmined next move; storing in the computer memory a plurality of selectable hints for m~king a predetermined correct next move for the configuration of pieces on the screen wherein the hints are of varying specificity; and, optionally selecting a stored hint and revealing it on the computer screen. In addition, the solution of a problem can be scored as a function of the time taken to solve the problem, the number of incorrect moves (moves other than predetermined moves), and the number and/or specificity of hints selected during the solution of the problem. The computer stores a plurality of problems of varying difficulty. The scores achieved by the player are stored in the computer and used in selecting the next problem to be presented to the player.
In addition to the representation of a chessboard 12, chess pieces 13 and the hint boxes 16, 17, 18, and 19 in the preferred embo-liment, the computer screen also presents a "tool bar" 21 collllJlised of a plurality of separate "tools" 22 each represented by a graphical or textual icon. The tool bar 21 and it's tools 22 provide a col-~,ellient way to prompt the computer to initiate computer subroutines that effectuate the various steps of the method of the present invention.
Those features of the present invention previously described, as well as others which further enh~nce the teaching method of the invention are best revealed and described in connection with a step by step solution of a problem ut~ ing various method steps of the invention. For this purpose, reference is made to Figures 1-6, sequentially.
Referring to Figure 1, chess pieces 13 are arranged in a configuration that presents a problem to be solved. If the player does not immediately recognize the problem to be solved or the solution to the problem, a number of choices exist for obt~ining further information to assist in better underst~n~ling the problem and it's solution.
Referring to Figure 2, the pieces 13 remain in their original loc~tion.c as shown in Figure 1, but the text boxes 14 and 16 have been 5 activated to bring forth information about the problem and a hint. The text box 14 can be activated by either selecting (clicking a mouse when the cursor is on the screen area to be selected) the box itself or selecting tool 31 "About the Problem". ~imil~rly, the computer can be prompted to reveal the hint in text box 16, 17, 18, or 19 by either selecting the box itself or selecting tool 32, 33, 34, or 36, respectively.
Referring to Figure 3, the chess pieces 13 continue to remain in their original locations. If the player rem~in.s unsure of the next move and desires further information for m~king that move, the "Ghost" tool 37 can be selected from the tool bar 21 which will prompt the computer to identify certain of the chess pieces 13 (such as by t1imming the others) as the pieces involved in the solution of the problem. The particular way identifying the chess pieces involved in solving the problem is a m~tter of choice, and in addition to flimming the non-essential pieces, pieces could be idenfffied by color or size, etc. Uses of the "Ghost" feature can be taken into account in ascribing a solution score.
Referring to Figure 4, one of the chess pieces (in particular the black queen) is shown moved to a new location. Because it is a feature of the present invention that movement of any pieces other than predetermined pieces to any squares other than predetermined squares results in the piece being automatically returned to it's originating position, the player knows immediately that a correct piece has been selected and a correct move made when the piece rem~ins in it's new location. In addition, text is presented in the text box 14 acknowledging that a correct move was made along with other comments.
Referring to Figure 5, to discover how many moves remain to achieve the solution, tool 38, "Number of Moves to Solution" in the WO 95t05639 PCI/US94/08138 21 6855`~
tool bar 21 is selected producing the text 27. Further, the piece to be moved for the next correct step in the solution is revealed (highlighted) as a result of selecting the "From Square" tool 39 in the tool bar 21 and further, an ad-lition~l hint in text box 18 has been 5 revealed as a result of selecting "Hint 3" tool 34, (or selecting the text box 18 itselfl.
The movement of the black queen to it's new location autom~ffcally resulted in the computer having the white king capture the black queen as one of the predetermined moves in the sequence 10 le:~(ling to the solution of the problem. For convenience, the last moves of both the opponent (computer) and the player are listed in a "Last Move" text box 26 below the chessboard 12.
Referring to Figure 6, the black knight has been moved to capture the white bishop (which the computer acknowledges as a 15 correct move by permitting the black knight to remain in it's new location) and text in the text box 14 gives an expl~n~tion of the position.
Referring to Figure 7, after the computer was forced to move the white king out of check, the black knight captured the white queen 20 which is the predetermined final and correct move in solving the problem. Once again, text appears at 14 commenting on the position.
The foregoing example reveals some of the tools available to the player during the solution to a problem such as the use of the "Ghost"
tool 37, the "Hints" tools 32, 33, 34, and 36, the "Number of Moves to 25 Solution" tool 38, and information about the problem. There are adtiition~l tools 22 in the tool bar 21 that could also have been used.
These additional tools 22 include the "Key Squares" tool 41 which when selected prompts the computer to highli~ht the squares which are involved in solving the problem; the "Transforming Pieces"
30 tool 42 which when selected prompts the computer to outline (or otherwise identify) all chessboard 12 squares that contain pieces which move or are captured in the solution to the problem (this tool is only available when the final solution to the problem is a few moves from being achieved); the "Graphic Tn.~ight" tool 43 which graphically W O 9S/05639 2 1 6 8 5 5 5 PC~rtUS94tO8138 characterizes key pieces in the position. When a graphic incight piece is double selected (double clicked with a mouse), a help text box pops up on the screen (not shown) which ~xrl~ins in text the me~ning and intent of it's graphic. The "Suggested Moves" tool 44, when selected, 5 brings up a list of moves which the user might try, including a correct move wlth several "decoys". Selecting the move from the list m~kes the move on the board momentarlly. To actually make a suggested move, the user must physically move the piece on the board in the normal m~nner. The "Final Position" tool 46, when selected results in 10 the final position of the pieces on the chessboard representing the solution. Once again, this tool is best available when the solution to the problem is only a few moves away. The "To Square" tool 47 when selected, highlight~ the next square to which one of the pieces must be moved. The "Answer" tool 48, when selected highlights both the 15 square of the piece to be moved and it's destination square.
In addition to the tool bar 21, the computer screen also presents a navigation bar 23 having a plurality of navigation tools represented by graphic or textual icons. When the "Skip" navigation tool 24 is selected, the current problem is withdrawn and a new 20 problem is presented. The "Score" navigation tool 25 brings up the player's score for the last completed problem. In addition, the graphical icon tools permit the problems to be reset one step or to the very beginning of the problem.
In the preferred emborliment of the teaching method of the 25 invention the problems stored in the computer would be in sets. Each set of problems would end with the same steps but approach those steps from progressively more remote positions. For ~x~mple, the first chess problem of a set could be solved by step "a" followed by step "b". The second problem presented from the set would require a step 30 "c" (or possibly "c" and "d") to get the pieces to where they were in the first problem and again requiring step "a" followed by step "b" to solve the problem. The third problem could require a step "e" to get the pieces to the arrangement of the second problem, requiring steps "c", "d","a"and "b" to solve the problem. By presenting the problems in WO 95/05639 2 t ~ 8 5 ~5 PCT/US94/08138 these sets, the player gets a larger and larger view of the game while repeatedly practicing ftm~l~mental moves.
Thus, the method of the present invention advantageously includes the steps of storing in the computer for selective 5 presentz tion on the computer screen a set of problems solved by sequential mztnipulation of game equipment wherein the stored problems are related in that in their solution they all include among the steps required to solve the problem a common sequence of steps.
The present inv~ntion, while particularly suited to the game of 10 chess, is not uniquely so and, in fact, just about any game that includes game equipment which is sequentially moved during the play of the game is adaptable to the method of the present invention. By way of example, if the game simulated is bridge, there would be presented in the location where the chess game presents the board and pieces four 15 sets of bridge playing cards representing the cards remztining to be played in a hand of bridge. The problem solution might require one or more cards to be played with the declarer playing the cards assigned to that position as well as the dummy cards and the computer playing the defender's cards. The information box 14 and the hint boxes 16-20 19 function in the same way as described above in connection with thegame of chess as would most of the tools 22 in the tool bar 21. The tools 22 might be differently labeled or use different graphical icons but their functions would remain largely the same. As in connection with chess, any z~ttempt to play a card other than one of the 25 predetermined correct cards would result in the card immediately returning to it's original position indicating to the player that an incorrect move was attempted.
The adaptation of the method of the present invention to such ~mes as Checkers, Go, Rzlckgzmmon and even Scrabble are obvious 30 and require no further explanation. In all of the games, the computer presents a simulation of all or a part of the game equipment in a condition posing a problem to be solved. The solution of the problem is achieved by sequential mzln~ z~tion of the simulated game equipment assisted by hints and information selected by the player as WO 9S/05639 2 t 6 8 5 5 5 PCTIUS94/08138 desired. Each problem upon completion is scored and that score is retained in the computer whereby the computer gauges the ability of the player and presents new problems most a~ o~liate for the player's demonstrated skill level.
All of the computer functions described in connection with the present invention are well within the skill of those versed in the art of computer progr~mming and do not of themselves form any part of the invention. Other adaptations and modific~tion~ of the invention are possible and thus the scope of the invention is not to be limited by the specific e~mples presented herewith, but are rather to be limited only by the scope of the ~ im~s that follow.
Claims (35)
1. In a computer teaching method for games of the type having game equipment which is sequentially manipulated during the play of the game the steps comprising:
displaying on a computer screen representations of the game equipment arranged to present a problem to be solved by manipulating the equipment representations one or more predetermined sequential steps wherein the arrangement of the equipment representations on the computer screen after an attempted sequential step will be changed only if the attempted step is a predetermined step;
storing in the computer a plurality of problem solving hints for each problem which hints are individually selectable for display on the computer screen.
displaying on a computer screen representations of the game equipment arranged to present a problem to be solved by manipulating the equipment representations one or more predetermined sequential steps wherein the arrangement of the equipment representations on the computer screen after an attempted sequential step will be changed only if the attempted step is a predetermined step;
storing in the computer a plurality of problem solving hints for each problem which hints are individually selectable for display on the computer screen.
2. The method of claim 1 wherein the hints are appropriate after each step in the solution of the problem.
3. The method of claim 1 wherein one or more of the stored selectable hints for the displayed problem changes with each correct step toward the solution of the problem.
4. The method of claim 1 wherein the stored hints are of differing value.
5. The method of claim 4 wherein the hint value is based on the amount of information revealed to solve the problem.
6. The method of claim 1 further comprising the step of:
storing in the computer a plurality of problems to be solved by manipulating the equipment representations one or more predetermined sequential steps.
storing in the computer a plurality of problems to be solved by manipulating the equipment representations one or more predetermined sequential steps.
7. The method of claim 6 further comprising the step of:
ascribing a solution value to each problem solved wherein the solution value so ascribed is a function of the number and value of hints used during the solution of the problem.
ascribing a solution value to each problem solved wherein the solution value so ascribed is a function of the number and value of hints used during the solution of the problem.
8. The method of claim 7 wherein the solution value is also a function of one or more of (a) the time taken to solve the problem, (b) the number of incorrect steps attempted during the solution of the problem, (c) the difficulty of the problem.
9. The method of claim 8 further comprising the step of:
selecting from the plurality of problems stored in the computer a problem to be presented on the computer screen as a function of the solution values ascribed to one or more problems previously presented.
selecting from the plurality of problems stored in the computer a problem to be presented on the computer screen as a function of the solution values ascribed to one or more problems previously presented.
10. The method of claim 6 wherein the stored problems include a plurality of problems related to each other in that in their solution they all include among the steps required to solve the problem a common sequence of steps.
11. The method of claim 1 comprising the further step of:
selectively prompting the computer to indicate particular game equipment representations on the computer screen involved in the solution of the problem presented.
selectively prompting the computer to indicate particular game equipment representations on the computer screen involved in the solution of the problem presented.
12. The method of claim 1 comprising the further step of:
selectively prompting the computer to disclose on the computer screen the solution to the problem.
selectively prompting the computer to disclose on the computer screen the solution to the problem.
13. The method of claim 1 comprising the further step of:
selectively prompting the computer to disclose on the screen the number of steps remaining to the solution of the problem.
selectively prompting the computer to disclose on the screen the number of steps remaining to the solution of the problem.
14. The method of claim 1 comprising the further step of:
selectively prompting the computer to display on the screen a plurality of possible steps that might be taken including a predetermined correct step.
selectively prompting the computer to display on the screen a plurality of possible steps that might be taken including a predetermined correct step.
15. The method of claim 6 comprising the further step of:
selectively prompting the computer to display on the screen the solution value ascribed to the previous problem.
selectively prompting the computer to display on the screen the solution value ascribed to the previous problem.
16. The method of claim 1 wherein the game is chess and the game equipment includes a chessboard and chess pieces.
17. The method of claim 16 wherein the hints are appropriate at each step in the solution of the problem.
18. The method of claim 16 wherein one or more of the stored selectable hints for the displayed problem changes with each correct step toward the solution of the problem.
19. The method of claim 16 wherein the stored hints are of differing value.
20. The method of claim 19 wherein the hint value is based on the amount of information revealed to solve the problem.
21. The method of claim 16 further comprising the step of:
storing in the computer a plurality of problems to be solved by moving the chess piece representations one or more predetermined moves.
storing in the computer a plurality of problems to be solved by moving the chess piece representations one or more predetermined moves.
22. The method of claim 21 further comprising the step of:
ascribing a solution value to each problem solved wherein the solution value so ascribed is a function of the number and value of hints used during the solution of the problem.
ascribing a solution value to each problem solved wherein the solution value so ascribed is a function of the number and value of hints used during the solution of the problem.
23. The method of claim 22 wherein the solution value is also a function of one or more of (a) the time taken to solve the problem, (b) the number of incorrect steps attempted during the solution of the problem, (c) the difficulty of the problem.
24. The method of claim 23 further comprising the step of:
selecting a problem to be presented on the computer screen as a function of the solution values ascribed to one or more problems previously presented.
selecting a problem to be presented on the computer screen as a function of the solution values ascribed to one or more problems previously presented.
25. The method of claim 16 comprising the further step of:
selectively prompting the computer to indicate particular chess pieces on the computer screen involved in the solution to the problem presented.
selectively prompting the computer to indicate particular chess pieces on the computer screen involved in the solution to the problem presented.
26. The method of claim 16 comprising the further step of:
selectively prompting the computer to display on the computer screen the position of the chess pieces on the chessboard that represents the solution to the problem.
selectively prompting the computer to display on the computer screen the position of the chess pieces on the chessboard that represents the solution to the problem.
27. The method of claim 16 comprising the further step of:
selectively prompting the computer to disclose on the screen the number of moves remaining to the solution of the problem.
selectively prompting the computer to disclose on the screen the number of moves remaining to the solution of the problem.
28. The method of claim 16 comprising the further step of:
selectively prompting the computer to display on the screen a plurality of possible moves of chess pieces that might be taken including the predetermined correct step.
selectively prompting the computer to display on the screen a plurality of possible moves of chess pieces that might be taken including the predetermined correct step.
29. The method of claim 22 comprising the further step of:
selectively prompting the computer to display on the screen the solution value ascribed to the previously solved problem.
selectively prompting the computer to display on the screen the solution value ascribed to the previously solved problem.
30. The method of claim 16 comprising the further step of:
selectively prompting the computer to identify the square on the chessboard to which a chess piece must be moved for the correct next step.
selectively prompting the computer to identify the square on the chessboard to which a chess piece must be moved for the correct next step.
31. The method of claim 1 wherein the game is Go.
32. The method of claim 1 wherein the game is Bridge.
33. The method of claim 1 wherein the game is Backgammon.
34. The method of claim 1 wherein the game is Checkers.
35. The method of claim 1 wherein the game is Scrabble.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10192993A | 1993-08-04 | 1993-08-04 | |
| US08/101,929 | 1993-08-04 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2168555A1 true CA2168555A1 (en) | 1995-02-23 |
Family
ID=22287222
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002168555A Abandoned CA2168555A1 (en) | 1993-08-04 | 1994-07-19 | Computerized device useful in teaching problem solving |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US5678001A (en) |
| EP (1) | EP0712524A4 (en) |
| AU (1) | AU7338394A (en) |
| CA (1) | CA2168555A1 (en) |
| WO (1) | WO1995005639A2 (en) |
Families Citing this family (78)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3548617B2 (en) | 1995-01-31 | 2004-07-28 | 株式会社日立製作所 | Information retrieval device |
| NL1004407C2 (en) * | 1996-11-01 | 1998-05-08 | Adar Golad | Computer game. |
| US6786420B1 (en) | 1997-07-15 | 2004-09-07 | Silverbrook Research Pty. Ltd. | Data distribution mechanism in the form of ink dots on cards |
| US6213873B1 (en) * | 1997-05-09 | 2001-04-10 | Sierra-On-Line, Inc. | User-adaptable computer chess system |
| US6618117B2 (en) | 1997-07-12 | 2003-09-09 | Silverbrook Research Pty Ltd | Image sensing apparatus including a microcontroller |
| US6624848B1 (en) | 1997-07-15 | 2003-09-23 | Silverbrook Research Pty Ltd | Cascading image modification using multiple digital cameras incorporating image processing |
| US6879341B1 (en) | 1997-07-15 | 2005-04-12 | Silverbrook Research Pty Ltd | Digital camera system containing a VLIW vector processor |
| US20040119829A1 (en) | 1997-07-15 | 2004-06-24 | Silverbrook Research Pty Ltd | Printhead assembly for a print on demand digital camera system |
| US7110024B1 (en) | 1997-07-15 | 2006-09-19 | Silverbrook Research Pty Ltd | Digital camera system having motion deblurring means |
| US6690419B1 (en) | 1997-07-15 | 2004-02-10 | Silverbrook Research Pty Ltd | Utilising eye detection methods for image processing in a digital image camera |
| US6108010A (en) * | 1997-07-18 | 2000-08-22 | International Business Machines Corp. | Method and system for a true-scale motion path editor |
| US6091427A (en) * | 1997-07-18 | 2000-07-18 | International Business Machines Corp. | Method and system for a true-scale motion path editor using time segments, duration and synchronization |
| US6111590A (en) * | 1997-07-18 | 2000-08-29 | International Business Machines Corp. | Method and system for a true scale motion path editor to create motion paths as independent entities |
| US6159014A (en) * | 1997-12-17 | 2000-12-12 | Scientific Learning Corp. | Method and apparatus for training of cognitive and memory systems in humans |
| AUPP702098A0 (en) * | 1998-11-09 | 1998-12-03 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ART73) |
| US7154580B2 (en) * | 1998-11-09 | 2006-12-26 | Silverbrook Research Pty Ltd | Image recordal and generation apparatus |
| US7118481B2 (en) * | 1998-11-09 | 2006-10-10 | Silverbrook Research Pty Ltd | Video gaming with integral printer device |
| AUPP701798A0 (en) * | 1998-11-09 | 1998-12-03 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ART75) |
| AU2004200515B2 (en) * | 1998-11-09 | 2005-07-28 | Silverbrook Research Pty Ltd | Video game console incorporating a printer apparatus |
| CA2372610A1 (en) * | 1999-05-12 | 2000-11-16 | Twentieth Century Fox Film Corporation | Simulation system |
| AUPQ056099A0 (en) | 1999-05-25 | 1999-06-17 | Silverbrook Research Pty Ltd | A method and apparatus (pprint01) |
| AU2001244782A1 (en) * | 2000-03-24 | 2001-10-15 | Nam-Kyo Park | Database of learning materials and method for providing learning materials to a learner using computer system |
| US7294058B1 (en) * | 2000-03-30 | 2007-11-13 | Case Venture Management Llc | Computerized game with cascading strategy and full information |
| US6394904B1 (en) | 2000-05-12 | 2002-05-28 | Twentieth Century Fox Film | Simulation system |
| US6569013B1 (en) | 2000-07-14 | 2003-05-27 | William Arthur Taylor | Method for playing a video gaming machine |
| US6460855B2 (en) | 2000-08-03 | 2002-10-08 | Albert Shinderovsky | Alphabetic chess puzzles and games |
| WO2002036217A2 (en) * | 2000-11-03 | 2002-05-10 | Prima Communications, Inc. | Electronic game strategy guide |
| US6793575B2 (en) * | 2000-11-10 | 2004-09-21 | Case Venture Management, Llc | Racing game |
| US6612927B1 (en) | 2000-11-10 | 2003-09-02 | Case Venture Management, Llc | Multi-stage multi-bet game, gaming device and method |
| JP2002288602A (en) * | 2001-03-28 | 2002-10-04 | Nec Corp | Interpretation system using id tag |
| KR20030009938A (en) * | 2001-07-24 | 2003-02-05 | 주식회사 보보코리아 | Hint-supply banner advertisement system |
| US6890255B2 (en) | 2001-12-17 | 2005-05-10 | Igt | Multiple wheel roulette game |
| AU2003228617A1 (en) | 2002-04-18 | 2003-11-03 | Walker Digital, Llc | Method and apparatus for providing a bonus to a player based on a credit balance |
| AU2003900861A0 (en) * | 2003-02-26 | 2003-03-13 | Silverbrook Research Pty Ltd | Methods,systems and apparatus (NPS042) |
| US8057292B2 (en) | 2003-09-15 | 2011-11-15 | Igt | Draw bingo |
| US7674172B2 (en) | 2004-02-23 | 2010-03-09 | Igt | Gaming device having a wheel-based game |
| EP1756782A4 (en) | 2004-02-23 | 2010-10-27 | Wagerworks Inc | Bonus structures for multi-outcome/multi-bet gambling games |
| US7470183B2 (en) | 2004-06-15 | 2008-12-30 | Igt | Finite pool gaming method and apparatus |
| US8123606B2 (en) | 2004-07-30 | 2012-02-28 | Igt | Stud bingo |
| US7695359B2 (en) | 2004-07-30 | 2010-04-13 | Igt | “Buy a peek” gaming methods and devices |
| US7955170B2 (en) | 2004-07-30 | 2011-06-07 | Igt | Providing non-bingo outcomes for a bingo game |
| US8814652B2 (en) | 2004-07-30 | 2014-08-26 | Igt | Bingo game with multicard patterns |
| US7837545B2 (en) | 2004-09-03 | 2010-11-23 | Igt | Gaming device having an interactive poker game with predetermined outcomes |
| US7815500B2 (en) | 2005-01-07 | 2010-10-19 | Igt | Gaming device having a predetermined result poker game |
| US7658672B1 (en) | 2005-08-18 | 2010-02-09 | Igt | Multi-play poker gaming system with predetermined game outcomes |
| US7727068B2 (en) | 2005-09-12 | 2010-06-01 | Igt | Gaming system having a common display, a first bonus game or a first bonus game paytable and an option to purchase a second bonus game or a second bonus game paytable with relatively expected higher values |
| WO2007073535A2 (en) | 2005-12-09 | 2007-06-28 | Igt | Rotor-based gaming device having a secondary award system |
| US7708630B2 (en) | 2005-12-09 | 2010-05-04 | Igt | Rotor-based gaming device having a system for changing the quantity of potential game outcomes for subsequent plays |
| GB2437590B (en) * | 2006-04-25 | 2008-08-13 | Orbis Technology Ltd | Improved User Interface |
| US20080003551A1 (en) * | 2006-05-16 | 2008-01-03 | University Of Southern California | Teaching Language Through Interactive Translation |
| US8706471B2 (en) * | 2006-05-18 | 2014-04-22 | University Of Southern California | Communication system using mixed translating while in multilingual communication |
| US8032355B2 (en) * | 2006-05-22 | 2011-10-04 | University Of Southern California | Socially cognizant translation by detecting and transforming elements of politeness and respect |
| US8109820B2 (en) * | 2006-05-24 | 2012-02-07 | Ralph Nagel | Methods and apparatus for chess instruction |
| US8032356B2 (en) * | 2006-05-25 | 2011-10-04 | University Of Southern California | Spoken translation system using meta information strings |
| WO2007142861A2 (en) * | 2006-05-26 | 2007-12-13 | Ralph Nagel | Method and apparatus for chess instruction |
| US7713117B2 (en) * | 2006-06-02 | 2010-05-11 | Microsoft Corporation | Scoring system for games |
| US7857693B1 (en) | 2006-06-20 | 2010-12-28 | Igt | Multi-spin poker gaming system with predetermined game outcomes |
| US8002621B2 (en) | 2006-09-01 | 2011-08-23 | Igt | Gaming device and method having purchasable randomly selected paytables |
| US8235801B2 (en) | 2006-10-30 | 2012-08-07 | Igt | Gaming system and method for providing enhanced player opportunities for depositing monetary amounts above a designated level |
| US7846018B2 (en) | 2006-11-08 | 2010-12-07 | Igt | Gaming device and method having purchasable enhanced paytables |
| US8231455B2 (en) | 2007-02-05 | 2012-07-31 | Igt | Method and apparatus for providing a bonus to a player |
| US20090075714A1 (en) | 2007-09-18 | 2009-03-19 | Igt | Multi-card bingo patterns and wild balls |
| JP5178126B2 (en) * | 2007-10-03 | 2013-04-10 | 任天堂株式会社 | Data management device, data distribution system, data management program, data management system, and data management method |
| US20100331067A1 (en) * | 2009-06-26 | 2010-12-30 | Kirkpatrick Francis H | Multidimensional crossword game and puzzle |
| US8932129B2 (en) | 2010-03-12 | 2015-01-13 | Igt | Multi-play central determination system |
| US8562419B2 (en) | 2011-06-30 | 2013-10-22 | Igt | Gaming system, device, and method providing a multiple streak game |
| US8986106B2 (en) | 2011-09-02 | 2015-03-24 | Igt | Gaming system, gaming device, and method providing selectable different roulette wheels for play of roulette game |
| US9005004B2 (en) | 2011-09-02 | 2015-04-14 | Igt | Gaming system, gaming device, and method providing selectable different roulette wheels for play of roulette game |
| US9174116B2 (en) * | 2012-09-28 | 2015-11-03 | Intel Corporation | System for developing, managing, acquiring and playing electronic board games |
| JP5823996B2 (en) | 2013-01-31 | 2015-11-25 | グリー株式会社 | COMMUNICATION SYSTEM, COMMUNICATION SYSTEM CONTROL METHOD, AND PROGRAM |
| US9600963B2 (en) * | 2015-06-05 | 2017-03-21 | Jimmie Ray Kilby | Gaming machine, gaming system, and gaming method presenting games with artificially intelligent players |
| US10191830B1 (en) | 2017-07-07 | 2019-01-29 | ExQ, LLC | Data processing systems for processing and analyzing data regarding self-awareness and executive function |
| US10065118B1 (en) | 2017-07-07 | 2018-09-04 | ExQ, LLC | Data processing systems for processing and analyzing data regarding self-awareness and executive function |
| US10870058B2 (en) | 2017-07-07 | 2020-12-22 | ExQ, LLC | Data processing systems for processing and analyzing data regarding self-awareness and executive function |
| US11373546B2 (en) | 2017-07-07 | 2022-06-28 | ExQ, LLC | Data processing systems for processing and analyzing data regarding self-awareness and executive function |
| US10600018B2 (en) | 2017-07-07 | 2020-03-24 | ExQ, LLC | Data processing systems for processing and analyzing data regarding self-awareness and executive function |
| US10872538B2 (en) | 2017-07-07 | 2020-12-22 | ExQ, LLC | Data processing systems for processing and analyzing data regarding self-awareness and executive function |
| US11380216B1 (en) * | 2018-10-11 | 2022-07-05 | Knomadix Corporation | Dynamic number board game for adaptive learning |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3628259A (en) * | 1969-05-28 | 1971-12-21 | Herbert Kahn | Self-educational device |
| US3628256A (en) * | 1970-03-25 | 1971-12-21 | Roger W Story | Aircraft navigation teaching device |
| AT356552B (en) * | 1975-08-26 | 1980-05-12 | Siemens Ag Oesterreich | DEVICE FOR COMPUTER-CONTROLLED MONITORING OF A BOARD GAME, IN PARTICULAR CHESS |
| US4052073A (en) * | 1975-11-06 | 1977-10-04 | Miller Franklin E | Blackjack play director |
| US4073067A (en) * | 1977-05-09 | 1978-02-14 | Beach Bruce M | Pocket-size electronic device for playing chess |
| US4279421A (en) * | 1979-06-19 | 1981-07-21 | Darrell M. Tepoorten | Electronic gameboard |
| US4398720A (en) * | 1981-01-05 | 1983-08-16 | California R & D Center | Robot computer chess game |
| US4760527A (en) * | 1983-04-05 | 1988-07-26 | Sidley Joseph D H | System for interactively playing poker with a plurality of players |
| DE3608148A1 (en) * | 1986-03-12 | 1987-09-24 | Schwab Technologieberatung | ARRANGEMENT FOR MONITORING AND DISPLAYING CHESS PARTIES |
| FR2622811B1 (en) * | 1987-11-10 | 1990-03-09 | Syllogy Sa | ELECTRONIC BRIDGE GAME METHOD AND APPARATUS |
| DE8716732U1 (en) * | 1987-12-18 | 1988-04-28 | Hegener + Glaser Ag, 8000 Muenchen, De |
-
1994
- 1994-07-19 CA CA002168555A patent/CA2168555A1/en not_active Abandoned
- 1994-07-19 AU AU73383/94A patent/AU7338394A/en not_active Abandoned
- 1994-07-19 EP EP94923548A patent/EP0712524A4/en not_active Withdrawn
- 1994-07-19 WO PCT/US1994/008138 patent/WO1995005639A2/en not_active Application Discontinuation
-
1996
- 1996-04-05 US US08/628,521 patent/US5678001A/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| EP0712524A1 (en) | 1996-05-22 |
| AU7338394A (en) | 1995-03-14 |
| WO1995005639A2 (en) | 1995-02-23 |
| US5678001A (en) | 1997-10-14 |
| WO1995005639A3 (en) | 1995-03-23 |
| EP0712524A4 (en) | 1997-02-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2168555A1 (en) | Computerized device useful in teaching problem solving | |
| JP3570813B2 (en) | Game device | |
| US5295834A (en) | Educational device employing game situation | |
| US6602133B2 (en) | Interactive electronic puzzle game and a method for providing the same | |
| US6446966B1 (en) | Chess game and method | |
| US20100092933A1 (en) | System and method for an interactive phoneme video game | |
| JP4108113B1 (en) | CARD-TYPE LEARNING TOOL, LEARNING DEVICE, LEARNING DEVICE PROGRAM, AND STORAGE MEDIUM THEREOF | |
| KR20160149980A (en) | Game system, game control device and program | |
| US7303398B2 (en) | Educational game | |
| US5746431A (en) | Question and answer football game | |
| KR20160149981A (en) | Game system, game control device and program | |
| US8556696B2 (en) | System and method for puzzle solving utilizing letter and visual representations | |
| WO2011030337A2 (en) | Modified games & methods for modifying games for training various cognitive abilities | |
| WO1998053889A1 (en) | Apparatus for playing a word game | |
| US6206372B1 (en) | Magic squares game | |
| US20020082067A1 (en) | Computer game producing an award certificate and a contest mode of play | |
| US7665733B1 (en) | Religious game | |
| US6318722B1 (en) | Word puzzles and games | |
| US20130277915A1 (en) | System and Method for Playing Trading Card Game | |
| US20160332068A1 (en) | Electronic game wordbuster | |
| US20080265506A1 (en) | Closable-type electronic game grid box with digital display for strategic word pattern engagement | |
| JP2002183582A (en) | Advertising system over the internet | |
| US20160023098A1 (en) | System and method for playing and teaching games | |
| TWI828110B (en) | Auxiliary game software for examination | |
| US20200152082A1 (en) | Electronic teaching games |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |