JPH0375187B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION <Technical Field> The present invention relates to a game device most suitable for learning words.

As described in Japanese Patent Application Laid-Open No. 57-163280, for example, a conventional game device for learning words displays unknown test words with some letters of the test words unknown on the display. In order to complete the unknown question word, the person is typing the letters corresponding to the unknown part. The entered characters are replaced with the unknown part to complete the word, and by comparing the completed word with the question word related to the unknown question word, if the answer is correct, the score is added, and if the answer is incorrect, the correct word is displayed. The next unknown word will be displayed.

According to the above-mentioned device, although this is not a problem if only the learning aspect is considered, the game becomes monotonous and the enjoyment decreases. In particular, the words themselves have no movement, and the characters you input are replaced as they are, so the gameplay is very poor, and there is also a lack of learning elements that allow you to learn words at the same time as the game.

<Objective> The present invention provides a game device that can further enhance learning effects and at the same time can be enjoyed as a game.

That is, it is an object of the present invention to provide a game device that is rich in game playability and at the same time increases motivation for learning by giving the display characteristics and effective movement.

<Example> The apparatus of the present invention will be described in detail below based on the drawings.

FIG. 1 is an external view of a radio-equipped audio electronic translator according to the present invention. In the figure, reference numeral 1 serves as a two-stage display section consisting of a liquid crystal dot matrix, 2 a headphone jack, 3 a mode selection slide switch, and 4 a game start key in the game mode, and a reverse key in the Japanese-English and English-Japanese modes. Hereinafter referred to as a game key. Reference numeral 5 denotes a substitution key for inserting characters in the game mode, hereinafter referred to as □↓ key. 6 is a right shift key in game mode, hereinafter referred to as □→ key. 7 is a left shift key in game mode, hereinafter referred to as □← key. 8 is a character input key.

The mode selection switch 3 can be switched to radio, power off, English-Japanese translation, Japanese-English translation, and game modes depending on the switching position. Since the English-Japanese and Japanese-English translation functions of this translator are already well known, detailed explanations will be omitted here.

FIG. 2 is a system block diagram. In the figure, DISP is a liquid crystal dot matrix display section, and the DSC controls the display of characters and symbols.
KEY is a key input section, and SW is a mode selection switch. The MPU is a microprocessor that outputs strobe signals to KEY and SW, and detects the input state by reading the return signals.

VC is a speech synthesis control unit that synthesizes speech corresponding to sentence numbers and word numbers received from the MPU.
DA is a D/A conversion section, and AMP is an audio signal amplification section.

ROM1 is a read-only memory in which the MPU control program is written, ROM2 is a read-only memory in which spelling data of sentences and words is written, and ROM3 is a read-only memory in which voice data used for speech synthesis is written. .

These blocks are connected by a data bus DB, an address bus AB, and a control bus CB. Note that the DSC is composed of random access memory, and a part of it has a display area corresponding to each dot on the display section. By writing a desired bit pattern in this display area, desired characters and symbols are displayed.

FIG. 3 is a flowchart showing the procedure of processing by the MPU based on the program in the ROM1.

First, the key state is read, and if there is a key input, the process corresponding to that key is performed. When there is no key input, movement processing for game progress is performed in the game mode.

FIG. 4 shows processing for game keys.

First, the highest score is displayed as shown in FIG. 91. This score is updated and stored as the highest score of the previous games played, and even if the power is turned off, the memory is backed up and stored.

After that, a message to start the game is displayed moving rapidly from right to left. Figures 2 and 3 show this state. Other words for this message include ``Chayanreji!'' and ``Ganbarou!'', and one of them is randomly selected and displayed at the start of the game. After that, a melody corresponding to this message is reported for more than ten seconds (n ₁ →n ₂ →
_n3 ).

When reading a word to be asked from the ROM 2, the word number is determined by generating a random number. however,
It is checked whether the read word (hereinafter simply referred to as word) is suitable for the game (n ₄ → n ₅ → ₆ ). In other words, words such as O'CLOCK that contain symbols other than the alpha alphabet, words that contain capital letters such as proper nouns such as San Francisco, and the translation of the word PPcaught (catch Words other than non-Japanese words such as (translations of) are determined as test words (hereinafter referred to as test words).

Since the word to be tested determined as described above is presented as an incomplete word in which some of the characters are unknown, the unknown parts are further determined by random numbers. The determined unknown part is then replaced with a character, for example a cat character (cat symbol), and displayed as an unknown question word. In this way, the unknown test words in which some of the characters of the determined test words have been replaced with cat symbols are displayed moving rapidly from right to left as shown in Figure 9 4 and 5 (n ₇ → n ₈ →
_n9 ).

The translated words are read out and displayed in a similar manner as shown in FIGS. 5 and 6 (n ₁₀ →n ₁₁ ). Furthermore, the pronunciation of the test words is reported audibly (n ₁₂ ).

After that, the user indicates the input status of the character corresponding to the unknown part (position of the cat symbol) of the unknown question word. Display symbols. and? Whether the symbol is displayed at the right end or left end is determined by a random number, and the state is set in the flag FR. Now FR=
If it is 0, is it on the left end of the top row of the display? A symbol will be displayed and a mouse facing left will be displayed in the center (n ₁₃ →n ₁₄
→n ₁₅ →n ₁₆ →n ₁₇ ). What is CP here? This is a pointer indicating the position of the symbol. FIG. 9 is an example of this display. In this state? The actual game begins where characters are input into the symbol positions and the unknown question word is completed.

If you input the desired character using the character key 8, ? The character is displayed in the symbol position. (9th
Figure 8) On the other hand, the words on the question are moved from right to left at regular intervals. This is done by the key waiting state movement process shown in FIG. FIG. 8 shows the procedure.

In FIG. 8, a time counting process is first performed to determine whether it is time to shift the words on the question. When the time to be shifted, for example, 1 second has passed since the previous shift, the question word is shifted to the left by one character and displayed. As a result, if the question word does not go out of the display range, the process returns to the key reading routine again.

When the □← key is pressed, the process shown in FIG. 7 is performed. First, a mouse facing left is displayed at the position of the currently displayed mouse (in the above example, a mouse facing left is already displayed). and,? Since the display position of the symbol is on the left, that is, FR=0, MP=2
In other words, it is determined whether the mouse's display position has reached two characters from the left (MP is a pointer that indicates the mouse's position). If MP = 2, count down the MP and shift the mouse display position to the left (O ₁ → O ₂ →
O ₃ → O ₄ ). FG is a flag indicating that the mouse is grabbing a letter, and since FG=0 now, the position of the letter "t" is not shifted (O ₅ →O ₇ ).
If the mouse reaches the position of MP=2 as shown in Fig. 9, the flag FG is set (O ₇ →
_O3 ).

If the ← key is pressed again in this state, the letter "t" will be displayed blinking, indicating that the mouse cannot proceed any further (O ₃ →O ₉ ).

9 If the → key is pressed in the state shown in FIG. 9, the display changes to a mouse pointing to the right as shown in FIG. 10, and each time the → key is pressed, both the letter "t" and the mouse move to the right.

FIG. 6 shows the processing for the → key, in which case the processing is performed as P ₁ →P ₂ →P ₁₀ →P ₁₁ →P ₁₂ →P ₁₃ .

If the ↓ key is pressed when the cat is moved to the position shown in FIG. 9 and 11, the cat is replaced with the letter "t" and the cat is deleted.

FIG. 5 shows a processing procedure for the ↓ key to replace the above-mentioned cat symbol with the input character "t", and in short, it constitutes a replacement means that follows the operation of the ↓ key. CP' indicates the position of the character "t" displayed on the upper line of the display section 1, that is, the position of the cat symbol on the lower display section corresponding to the character position pointer CP. Therefore, the position of the cat symbol and the position of the letter "t" are determined, and if they match, the cat symbol is deleted. Then, the letter t is inserted in the position of the cat symbol, completing the word (9th
(See Figure 12). If the position of the cat symbol and the position of the input character do not match, that is, if the vertical relationship between the position of the cat symbol and the character position is misaligned, the cat symbol part of the unknown question word will be replaced with the input character. There isn't. In such cases where substitution is not possible, or when the word completed by substitution does not match the question word related to the unknown question word, that is, the answer is incorrect, the character corresponding to the unknown part of the unknown question word is input again. 9 shows the character input state as shown in Figure 7. The symbol and mouse return to their initial display state similar to when the game started. (q ₁ →q ₂ →→n ₁₃ →…).

Whether or not the answer is correct is determined by storing the correct spelling in a register when the question word is determined in advance, and comparing the spelling with the completed word.

If the answer is correct, the score is added and a counter C that counts the number of steps in the game is counted up. If C=5, an intermediate display is made as shown in FIG. 9, and a melody corresponding to the step is announced (q ₃ →q ₄ →q ₅ →q ₆ →q ₇ →q ₈ ). After that, the next question will be asked.

If it is not possible to enter the correct letters until the question word, especially the cat part of the question word, disappears from the left end of the display section, the correct answer will be displayed as shown in FIG. 9, 13.

Further, as shown in FIG. 8, the reading is outputted aloud once again, and the missed number counter CN is counted up (r ₄ →r ₅ →r ₆ →r ₇ ). If you miss the game three times, a message will appear indicating that the game is over, a melody will be played according to your score, and a message will be displayed (r ₈
→r ₉ →r ₁₀ →r ₁₁ ).

Figure 9 15 Game over display. 16 is a display example of a message.

In the above example, the movement speed of the question words is constant,
Furthermore, although there was only one moth-eaten spot, the difficulty level of the game can be set, and if the game is difficult, there are multiple moth-eaten spots, and the movement speed can be increased.

Furthermore, the game can be made more interesting by providing not just one type of cat character but multiple types and changing the scores accordingly.

<Effect> As explained above, according to the game device of the present invention, while shifting the unknown question word in one direction, in which a part of the question word is made unknown, the characters of the unknown part are input. If the word completed with the given letter is correct, it will be added as a score, and if the question word that is shifted is out of the display range until it is correct, the next question word will be output. The passage of time for the words on the question can be easily determined by the shift state, which further enhances the effect of the game and the effect of learning words along with the game.

In addition, if you move the input characters and replace them by making them correspond to the unknown part of the question word, especially if you display the unknown part as a character and replace it with a character, it will make the game more interesting. The monotony of the wealth game is eliminated, and you can enjoy an interesting game, and at the same time, you can enjoy learning vocabulary along with the game.

[Brief explanation of drawings]

Fig. 1 is an external view of a speech electronic translator with a radio that employs the device of the present invention, Fig. 2 is a block diagram of the same system, Fig. 3 is a flowchart showing the processing procedure in the MPU, and Fig. 4 is a diagram for game keys. Flowcharts, FIGS. 5, 6, and 7 are flowcharts for the □↓ key, □→ key, and □← key, respectively. FIG. 8 is a flowchart showing the movement processing procedure in the key wait state, and FIG. 9 1 to 16 are diagrams showing display examples and keys to be partially operated. 1 is a display section, 3 is a mode changeover switch, 4 is a game key, 5 is a character insertion key, 6 is a right shift key, 7 is a left shift key, 8 is a character input key,
MPU is a microprocessor unit, and VC is a voice synthesis control unit.

Claims (1)

[Scope of Claims] 1. An incomplete form of an unknown question word in which some characters of the question word are unknown is displayed, and the user inputs characters corresponding to the partially unknown part of the unknown question word. In a game device that determines whether the completed word inputted above is correct or incorrect with the question word related to the unknown question word, and adds the score based on the determination of the correct answer, (1) at least two lines of display means for displaying a display and a display of characters corresponding to the partially unknown part on different lines; (3) Shifting the input characters inputted by the user and displayed on the displaying means and the unknown part of the unknown question word to be shifted in the one direction by the operation of a replacement key; (4) a score addition means that adds a score when the answer is correct based on the comparison between the completed word and the word on the question; Compare the above completed word with the above question word, and if the answer is correct, display another unknown question word in which some of the next letters are unknown, and if the answer is incorrect, display the unknown part again. A means for returning to a character input state that shows the user the input of the corresponding character, or when the above unknown test word is shifted out of the display range due to the shift of the above unknown test word, another unknown test word different from the above unknown test word is displayed. A game device comprising: a control means having means for displaying question words; 2. The above-mentioned substitution means moves the input character, and when it corresponds to a part of the unknown part of the displayed unknown question word, the unknown part and the input character can be replaced. Range 1
The gaming device described in Section 1. 3. The game device according to claim 1 or 2, wherein a part of the unknown part of the unknown question word is displayed as a character, and the character is replaced with an input character.