US 4,891,775 AGrant
Electronic Word Game Machine
Issue Date:1990-01-02
•9 Claims
•2 Drawing Sheets
Abstract
A hand held electronic spelling dictionary to facilitate the selection of a random word. A random word may be selected for purposes of playing games. An input word size is selected by the user through a keyboard. A random number generator generates a random number for each position in the word selected. The random number selects a letter from a predetermined letter table which table has a distribution of letters approximately equal to the frequency with which letters occur in the English language. The result is a selected letter sequence having a size equal to the input size from the keyboard. This is treated as an input word which is alphabetically traversed against the memory to find valid words of equal size. To minimize biasing the valid words selected, a second random number generator generates a second random number N to select as the output word, the Nth valid word found on an alphabetical traverse.
Metadata
Assignee
- Franklin Computer Corporation
Inventor
- David McWherter
Application Information
Application Number:US 2000008
Filing Date:1988-05-27
Priority Date:1988-05-27
Art Unit:231
Classifications
IPC:
G06F 1516A63F 706G09B 500
Field of Search:
273364434272;85 G;DIG. 28705.06;410;709.02;200 MS File;900 MS File169
Patent Drawings (2 sheets)
Description
Background of the Invention
This invention relates in general to an improved electronic word game machine and in particular to one having an enhanced capacity to provide random words from an extensive dictionary for use in games such as the hangman game.
The utility of hand held electronic word game machines is essentially in their ability to provide an extensive list of words for use in whatever game is employed. This utility not only requires that an extensive dictionary be held in memory but also that as full a scope as possible of that dictionary be available for use in connection with a word game. The problem in connection with the word game hangman is instructive.
In playing hangman against the machine, the machine has to provide a word which is a determined word, but which is unknown to the player. This determined word should be selected from a pool or dictionary of words that is as extensive as possible so that game variability is as extensive as possible.
Accordingly, it is a major object of this invention to provide a technique in a hand held electronic word game machine for providing words from a dictionary held in memory and to provide those words in as random and variable a fashion as possible.
Brief Description of the Figures
FIG. 1 is a block diagram illustrating the operation of the device of this invention and the relationships between the various components and sequences of events therein.
FIG. 2 is a plan view of a hand held device incorporating the FIG. 1 arrangement.
Brief Description
In brief, in one embodiment, an English language dictionary is held in memory in a tree format. This format is sometimes called a TRIE format. The tree is traversed alphabetically in accordance with a known or standard algorithm controlled by a tree search control module. The user generates an input word size through a keyboard. A random number generator responds to the input word size to produce a random number between zero and 99 for each position in the word. This random number selects a letter from a letter table which has one hundred letters. The letters in the letter table have the approximate frequency with which letters occur in the English language. This provides a selected letter sequence having the size equal to the input size from the keyboard.
The selected letter sequence is treated by the search control module as an input word against which the tree is traversed to find valid words of equal size in the tree. There are normally a number of valid words in the tree of equal size of the selected letter sequence. The valid word selected as an output is determined by a second random number generator which generates a random number between zero and 19. That second random number is employed by the tree search control module to determine which of the valid words in the tree are provided as the output word.
The tree search is limited to those words having the word size Q. The search is then made alphabetically in accordance with a known alphabetical search algorithm.
For certain letters with relatively low frequency, the second random number generator function is bypassed and the first valid word found in the tree is provided as the output word.
Description of the Preferred Embodiment
FIG. 1 is a block diagram illustrating the essential sequence of processing in the device of this invention. As shown in FIG. 1, a word size value Q is provided from the keyboard 12 by the user of the device. A random number generator 14 produces a set of random numbers, the set being equal in size to the word size provided from the keyboard 12. Each number provided by this random number generator 14 is within the range from 0 to 99.
A letter table 16 contains the 26 letters in the alphabet in the approximate frequency with which they appear in the English language. In one embodiment, this table 16 has 100 letters and thus the frequency is only a rough approximation of English language use and, accordingly, the letters J, K. Q, X, and Z will appear only once among the hundred characters in the table 16. The random numbers provided by the generator 14 select corresponding letters from the table 16 to provide a selected letter sequence 18 having the Q letters required to match the word size provided from the keyboard 12. Because the selected letter sequence 18 is provided from a random number exercise of the table 16, the selected letter sequence 18 will usually not be a valid word. However, it is treated as is an input word for the purpose of providing a valid word from the set of words in the memory.
This selected word 18 is applied to the tree search control module 20 so that the set of words in memory 22 can be searched alphabetically in accordance with the algorithm of the control module 20 to provide a valid word output. The memory 22 is a known type of tree format which is traversed by a known type of control module 20.
The valid output word from tree 22 would disproportionately be biased toward those words which were alphabetically first among the set of words associated with any initial letter unless a further constraint were imposed. The random number generator 24 provides a further constraint. The generator 24 produces a random number N having a value between 0 and 19. This number N is employed to cause the tree search control module 20 to continue searching through the tree 22 in accordance with the algorithm of the module 20, until the Nth valid word of size Q is located. It is that Nth word which is used as the output word.
It might be noted that in the case of words whose first character are the letters J, K, Q, X, Y or Z, there are so few words that start with those letters that the employment of random numbers N from the generator 24 might result in too few output words with one of those six letters as a first letter. In one embodiment, a simple technique of resolving that problem is to include a program requirement that if the random letter sequence 18 starts with any one of those six letters, then N is set to "1". Thus, the first valid word of Q letters is provided as the output word.
As used herein, the term "word" refers to any selection of letters whether or not the set of letters constitutes a valid word. The term "valid word" refers to those sets of letters which constitute a valid word in the English language as contained in the memory. Thus, a word input to the tree search control module may or may not be a valid word. Any collection of input letters no matter how meaningless that set of letters may be is termed a word herein.
The tree search control module 20 and tree 22 arrangement are known technology. It is common to provide a tree arrangement for words contained in memory and this tree arrangement is normally in alphabetical order. The techniques for traversing the tree are known techniques.
The device 40 shown in FIG. 2 illustrates a self-contained, battery operated, readily portable, hand holdable product incorporating the arrangement shown in FIG. 1. The device 40 has a one line LCD character display 41 and a keyboard 42. The keyboard 42 includes keys for the 26 letters of the alphabet. In addition, it has an on switch 43 and a backspace 44. The clear key 45 clears the display and permits the user to initiate an input query word or, as in the case of implementing the FIG. 1 random word selection procedure, a series of hyphens. The key 49 is actuated by the user Q times in order to provide a word size indicator of Q spaces. The enter key 47 is actuated after the number of spaces Q has been indicated so that the device will initiate the random word selection and providing memory, the word selected from the tree 22.
The output word from the tree 22 is not necessarily provided on the display of the keyboard 12. Rather it is held in memory.
Where this output word is used in the hangman game, each time the user selects a letter from the keyboard and there is a match between that selected letter and one of the letters in the output word, then that letter is displayed at the appropriate space on the display 41 of the keyboard 42. The technique for holding in memory and for matching and display are well-known techniques and need not be described in detail herein.
Attached hereto as Appendix A is a presently preferred listing in Z80 assembly source code together with commentary in Source Code C. This listing is by way of an example of the routines for accessing and operating an electronic dictionary to implement the combinations of routines of this invention. A skilled programmer may implement the invention by means of a different code listing. ##SPC1##
Claims
What is claimed is:
1. A word selection device for use in a word game machine having a memory containing a word list arranged in a tree format and a tree search control module to compare an input word against the tree memory to provide a valid output word, the word selection device comprising: input means to provide a word size command; a first random number generator responsive to said word size command to provide a random number for each letter position commanded by said word size command; and a predetermined letter table having a set of letters in a predetermined relative frequency; said letter table being responsive to the output of said first random number generator to provide a selected letter sequence having a size Q equal to the word size command; said three search control module responsive to said selected letter sequence to continue the search through words in the tree adjacent to said selected letter sequence to provide, as a valid output word, an Nth valid word having the size Q.
2. The device of claim 1 wherein said relative frequency of said set of letters in said letter table is a function of the frequency with which letters occur in the English language.
3. The device of claim 2 wherein N is a random positive number 19 or less.
4. The device of claim 2 wherein N is set equal to "one" when said selected letter sequence begins with any one of the letters J, K, Q, X, Y and Z.
5. The device of claim 2 wherein N is a random positive number 19 or less.
6. The device of claim 5 wherein N is set equal to "one" when said selected letter sequence begins with any one of the letters J, K, Q, X, Y and Z.
7. The device of claim 5 wherein N is generated by a second random number generator.
8. The device of claim 2 wherein N is generated by a second random number generator.
9. The device of claim 1 wherein N is generated by a second random number generator.