JP2014167544A - Language learning game machine and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a language learning game which can be intuitively played even by a player whose grammar acquisition level is low, and allow the player to effectively learn grammar through the play.SOLUTION: A language learning game machine 1 for completing a sentence by using a plurality of cards 7 includes: a recognition unit 214 for recognizing a type and a position of a connection symbol 72 showing possibility/impossibility of connection based on the type of a part of speech allocated to the card 7; a determination unit 216 for performing determination whether two cards 7 are connectable or not based on the type and the position of the connection symbol 72; a connection unit 217 for connecting the two cards 7 when the two cards 7 are connectable; a completion determination unit 215 for determining whether or not composition by the cards 7 is completed; and a calculation unit 222 for calculating the sum of scores 76 allocated to the cards when the composition is completed.

Description

  The present invention relates to a language learning game machine and program capable of learning grammar through a competitive game.

  For beginners with a low level of language proficiency, learning grammar is often painful, which is a major factor in reducing language learning motivation. For this reason, it is desirable to have teaching materials that can be easily learned and enjoyable at any time without pain. In addition, a language learning game in which language can be learned through various games such as a card game is more preferable because the language can be learned happily through the game.

  Among these language learning games, especially games for mobile phones and personal computers can be played anywhere, such as on the go, reducing the psychological and time burden of language learning. it can.

  However, all of these commercially available language learning games are mainly based on word learning, and there are currently no commercially available ones that can learn grammar. Although Patent Literature 1 describes a language learning game for mobile phones and personal computers as a game for learning English grammar, it is disclosed how it can be programmed and implemented. It is not made at all and is not marketed.

JP 2011-34032 A

  Although the language learning game described in Patent Document 1 is not disclosed to the extent that it can be carried out, the outline of the language learning game cannot be played unless it is a player who has mastered English grammar to some extent. It is not something that a beginner with a low level of mastery can easily learn.

  Therefore, it is preferable that there is a language learning game that can be played intuitively even by a player with a low level of grammar acquisition and can effectively acquire grammar through the play.

  In addition, it is preferable to be a language learning game with high game characteristics in order to make learning more enjoyable and realize a high learning effect by continuously using the player without getting bored.

  Accordingly, the present invention has been devised in view of the above-described problems, and language learning that can be played intuitively even by beginners, can improve game characteristics, and can achieve high learning effects. An object is to provide a game machine and a program.

  In order to solve the above-mentioned problems, the present inventor has invented a competitive language learning game machine and program that can be played intuitively through symbols and the like that assist in the creation of English sentences and have high game characteristics. .

  The language learning game machine according to the present invention is a language learning game machine that completes a sentence using a plurality of cards each assigned a word and a score, and assigned to the card. A recognition unit that recognizes the type and position of a connection symbol that indicates whether connection is possible based on the type of part of speech, and a determination unit that determines whether the two cards can be connected based on the type and position of the connection symbol And when the two cards are connectable, a connection unit that connects the two cards, a completion determination unit that determines whether or not writing by the card is completed, and when writing is completed, A calculating unit that calculates the total of the scores assigned to the cards.

  The language learning game machine according to the present invention further includes a replacement unit that replaces the replacement target card with a replacement candidate card that can be connected in the same manner as the replacement target card to be replaced among the connected cards. It is further provided with the feature.

  The language learning game machine according to the present invention further includes an attack power recognizing unit that recognizes the attack power of the replacement candidate cards, and further replaces the replacement candidate cards with each other. A comparison unit that compares the attack powers of the replacement candidate cards, and when the replacement candidate card is singular, the replacement unit replaces the replacement symmetric card with the replacement candidate card, and a plurality of the replacement candidate cards The comparison unit compares the attack power of the plurality of replacement candidate cards, and the replacement unit replaces the replacement target card with the replacement candidate card that maximizes the attack power. It is characterized by that.

  Further, the language learning game machine according to the present invention is further provided with an attack power and a defense power assigned to each of the cards, an attack power recognition unit for recognizing the attack power of the replacement candidate card, and the replacement A defense level recognizing unit that recognizes the defense level of the target card, and a comparison unit that compares the attack strength of the replacement candidate cards and compares the defense level of the replacement candidate card and the replacement target card. And when the replacement candidate card is singular, the comparison unit compares the attack power of the replacement candidate card with the defense strength of the replacement target card, and the replacement unit includes the attack power. Is replaced with the replacement candidate card when the replacement candidate card exceeds the defensive ability, and when there are a plurality of replacement candidate cards, the comparison unit includes a plurality of replacement candidate cards. And comparing the attack power of the replacement candidate card with the maximum attack power with the replacement target card, and comparing the attack power of the replacement candidate card with the maximum attack power, The replacement unit replaces the replacement target card with the replacement candidate card when the attack power of the replacement candidate card having the maximum attack power exceeds the defense power.

  Further, in the language learning game machine according to the present invention, auxiliary information indicating whether or not connection is possible based on a grammar between specific cards is further assigned to each of the cards, and the determination unit includes the connection symbol. In addition to the type and position, it is determined based on the auxiliary information whether or not the two cards can be connected.

  Further, in the language learning game machine according to the present invention, for each of the cards, a drawing unit indicating whether or not connection is possible based on the type of part of speech between the specific cards is assigned, and the determination unit includes In addition to the type and position of the connection symbol and the auxiliary information, it is determined whether or not the two cards can be connected based on the drawing unit.

  The program according to the present invention is a program for causing a computer to execute a language learning game for completing a sentence using a plurality of cards each assigned a word and a score, and assigned to the cards. A recognition step for recognizing the type and position of a connection symbol indicating whether connection is possible based on the type of part of speech, and a determination step for determining whether the two cards are connectable based on the type and position of the connection symbol And when the two cards are connectable, a connecting step of connecting the two cards, a completion determining step of determining whether or not writing by the card is completed, and when writing is completed, A calculation step of calculating a total of the scores assigned to the cards.

  The program according to the present invention further includes a replacement step of replacing the replacement target card with a replacement candidate card that can be connected in the same manner as the replacement target card to be replaced among the connected cards. Features.

  The program according to the present invention further assigns an attack power to each of the cards, an attack recognition process for recognizing the attack power of the replacement candidate cards, and an attack power between the replacement candidate cards. A comparison step for comparing, and when the replacement candidate card is singular, in the replacement step, the replacement symmetric card is replaced with the replacement candidate card, and there are a plurality of replacement candidate cards. Is characterized in that, in the comparison step, attack power is compared for a plurality of replacement candidate cards, and the replacement target card is replaced with the replacement candidate card having the maximum attack power.

  Further, the program according to the present invention further assigns an attack power and a defense power to each of the cards, an attack power recognition step for recognizing the attack power of the replacement candidate card, and the replacement target card A defense level recognition step for recognizing defense level, and a comparison step for comparing the attack strength between the replacement candidate cards and comparing the defense strength of the replacement candidate card and the replacement target card, When the replacement candidate card is singular, in the comparison step, the attack power of the replacement candidate card is compared with the defense strength of the replacement target card, and in the replacement step, the comparison step As a result of comparison, if the attack power exceeds the defensive power, the replacement candidate card is replaced with the replacement candidate card, and the replacement candidate When there are a plurality of cards, the comparison step compares the attack powers of the plurality of replacement candidate cards, selects the replacement candidate card having the maximum attack power, and maximizes the attack power. The attack power of the replacement candidate card is compared with the defense power of the replacement target card, and the attack power of the replacement candidate card that maximizes the attack power is the defense power in the replacement step. The replacement target card is replaced by the replacement candidate card when the number exceeds.

  Further, in the program according to the present invention, auxiliary information indicating whether or not connection is possible based on a grammar between specific cards is further assigned to each of the cards, and in the determination step, the type and position of the connection symbol In addition, based on the auxiliary information, it is determined whether or not the two cards can be connected.

  In the program according to the present invention, a drawing unit indicating whether or not connection is possible based on the type of part-of-speech between the specific cards is assigned to each of the cards. In addition to the position and the auxiliary information, it is determined whether or not the two cards can be connected based on the drawing unit.

  According to the present invention having the above-described configuration, even a beginner can play intuitively, improve game characteristics, and realize a high learning effect.

It is a block diagram which shows the hardware constitutions of the game machine for language learning which concerns on embodiment of this invention. It is a functional block diagram which shows the functional structure of the game machine for language learning of FIG. It is a schematic diagram which shows the example of the card | curd displayed on the display of the game machine for language learning of FIG. It is a schematic diagram which shows a mode that an English sentence is completed using the card | curd of FIG. It is a flowchart which shows the information processing at the time of performing a language learning game with the game machine for language learning concerning this embodiment. It is a flowchart which shows the information processing at the time of performing a language learning game with the game machine for language learning which concerns on the modification of this invention.

  Hereinafter, a language learning game machine and a program as embodiments of the present invention will be described in detail. In the present embodiment, a communication type language learning game machine in which English is assumed as a language to be learned and a plurality of players participate via their language learning game machines will be described as an example.

  FIG. 1 is a block diagram showing a hardware configuration of a language learning game machine 1 according to an embodiment of the present invention. As shown in FIG. 1, the language learning game machine 1 includes a control unit 2, a storage unit 3, a display 4, an operation unit 5, and a communication unit 6.

  The control unit 2 includes a CPU 21 that controls the entire control unit 2, a ROM 23 that stores a control program that operates on the CPU 21, and a RAM 25 that temporarily stores various data. The entire language learning game machine 1 is controlled.

  The memory | storage part 3 memorize | stores various information, such as a word card mentioned later used for the language learning game performed with the game machine 1 for language learning.

  The display 4 displays information necessary for the progress of the game such as a word card when the language learning game is being executed.

  The operation unit 5 is an operation part such as a keyboard provided for various operations by a player who operates the language learning game machine 1. In the present invention, the display 4 and the operation unit 5 may be integrated by using the display 4 as a touch panel.

  The communication unit 6 transmits and receives information between the language learning game machines 1 operated by a plurality of players. Information transmission / reception may be performed by wireless communication via an antenna (not shown), or may be performed by wired communication via a communication cable.

  Next, a functional configuration used for information processing of the language learning game machine 1 will be described. FIG. 2 is a functional block diagram showing a functional configuration of the language learning game machine of FIG. FIG. 3 is a schematic diagram showing an example of the card 7 displayed on the display 4 of the language learning game machine 1.

  The control unit 2 develops a control program stored in the ROM 23 in the RAM 25 and executes the control program in the RAM 25, thereby executing a reading unit 211, a display unit 212, and a recognition unit for executing an information processing procedure shown in FIG. Unit 214, completion determination unit 215, determination unit 216, connection unit 217, attack power recognition unit 218, defense power recognition unit 219, comparison unit 220, replacement unit 221, calculation unit 222, reception unit 223, order determination unit 224, order It functions as a recognition unit 225 and a measurement unit 226.

  The reading unit 211 reads various information related to the word card or the like stored in the storage unit 3 from the storage unit 3.

  The display unit 212 displays various information necessary for the player to play the game, such as information about the card 7 read from the reading unit 211 on the display 4.

  The recognizing unit 214 recognizes the type of the connection symbol 72 (see FIG. 3) indicating whether or not the connection assigned to the word card 7 is possible and the position on the word card 7.

  The completion determination unit 215 determines whether or not the English sentence is grammatically correct and the composition has been completed based on the information about the correctness of the grammar of the word card 7 stored in association with the auxiliary information 75 (described later). To do.

  The determination unit 216 uses two types of information on the correctness of English grammar associated with the type and position of a connection symbol 72 (see FIG. 3) described later and display information of an auxiliary symbol 75 (see FIG. 3) described later. It is determined whether or not the word card 7 can be connected.

  In the present invention, the present invention is not limited to this, and information related to whether or not two cards can be connected is further associated with the display information of the drawing unit 71, and the determination unit 216 also determines two word cards based on the information. It is good also as an aspect which determines the propriety of the connection of 7. FIG.

  The connection unit 217 connects the two word cards 7 when the two word cards 7 can be connected. Here, the connection means that one card and another card are juxtaposed and displayed on the display 4 via the display unit 212.

  The attack power recognition unit 218 recognizes the attack power of each card 7.

  The defensive power recognition unit 219 recognizes the defensive power of each card 7.

  When the player gives an instruction to the language learning game machine 1 to replace one word card 7 with another word card 7 (replacement candidate card) via the operation unit 5, the comparison unit 220 replaces Compare the attack strength and defense strength of each target card.

  The replacement unit 221 replaces the replacement target card with the replacement candidate card when the attack power of the replacement candidate card is greater than the replacement target card (replacement target card) as a result of the comparison by the comparison unit 220. This replacement is performed by displaying a replacement candidate card on the display 4 via the display unit 212 instead of the replacement target card.

  When the composition is completed using the word card 7, the calculation unit 222 calculates the total of the scores 76 described in each word card 7 constituting the sentence.

  The accepting unit 223 accepts various commands to the language learning game machine 1 performed by the player operating the operation unit 5.

  The order determination unit 224 determines the card draw order for each player. This determination is performed by, for example, the order determination unit 224 included in any one of the plurality of language learning game machines 1 participating in the game. The determined draw order is transmitted to another language learning game machine 1 via the communication unit 6.

  The order recognizing unit 225 determines whether or not the drawing order of the own device.

  As will be described later, the measurement unit 226 determines whether or not the drawing from the field card has been performed a predetermined number of times.

  Next, the word card 7 used in the language learning game by the language learning game machine 1 described above will be described. FIG. 3 is a schematic diagram showing an example of the card 7 displayed on the display 4 of the language learning game machine 1.

  As shown in Table 1, the word card 7 is a card corresponding to a large number of English words such as I, am, and beatiful. The word card 7 includes, for each English word, a drawing unit 71, a connection symbol 72, a phonetic symbol 73, a meaning 74, auxiliary information 75, a score 76, an attack power 77 and a defense that are associated with each other and stored in the storage unit 3. It is configured with a force 78.

  In the drawing unit 71, an image 711 and an English word 712 are displayed. The image 711 changes according to the type of the English word 712, and an image that gives a hint in the order of words at the time of English creation is used.

  In the game according to the present embodiment, an item corresponding to each part of the armor of medieval Europe is drawn as the image 711, the helmet represents the subject, the armor represents the verb, the gait represents the complement, and the foot represents the object.

  In the card shown in FIG. 3, the English word is I, which is the subject word. An image 711 of the cocoon is drawn along with I. By looking at the image 711 of the bag, the player can intuitively understand that the word card 7 can be placed at the top of the English sentence at the time of writing.

  Then, a third sentence type sentence (subject, verb, complement) can be created by arranging the armor and armor, and the armor in order from head to foot according to intuition. Similarly, a fourth sentence type sentence (subject, verb, object) can be created by arranging in line with the helmet, armor, and foot according to intuition.

  In this way, by arranging words while referring to the image 711, even an English beginner can intuitively create a basic English sentence.

  In the present embodiment, it is possible to arrange intuitively with reference to the image 711, but it is limited to affirmative sentences. When creating a negative sentence using a negative word or a question sentence using a question word or the like The image 711 cannot be applied to. However, even in that case, the player can intuitively play even when creating a negative sentence or a question sentence by referring to a connection symbol 72 described later.

  In the present embodiment, it is assumed that the information displayed on the drawing unit 71 is used as an auxiliary to English composition when the player visually observes it. However, the present invention is not limited to this, and the display information of the drawing unit 71 is associated with information indicating the type of part of speech that is used by the determination unit 216 to determine whether or not the connection is possible based on the type of part of speech of the two word cards 7. It may be an embodiment.

  The connection symbol 72 is a symbol indicating whether rough connection is possible based on the part of speech between the word cards 7, and a plurality of types shown in Table 2 are used.

  Whether or not the word cards 7 can be connected is determined based on the position and type of the connection symbol 72. That is, when the two word cards 7 are juxtaposed, and the connection symbol 72 that can be connected is disposed at the opposite position of both cards, these two word cards 7 are connectable. . The determination as to whether or not this connection is possible is performed by the determination unit 216 described above (see FIG. 2).

  In the present embodiment, the information indicating whether or not the connection is possible indicated by the connection symbol 72 is merely a rough indication of the order of connections that can be taken between parts of speech. For example, in the word card 7 of Table 1, “my friend” is a noun and can be the subject. “Want” is a verb. For example, in the case of the third sentence type, since a verb comes after a noun, “my friend” and “want” can be connected by a connection symbol.

  However, since “my friend” is a third person singular singular noun, the following verb must be correctly a verb of the third person singular present tense, such as “wants”, and “my friend” and “want” "Cannot be connected grammatically.

  Therefore, in the present embodiment, the connection symbol 72 is used to determine whether or not a rough connection is possible based only on the type of part of speech, ignoring grammatical matters such as verb usage and singular or plural nouns. Then, auxiliary information 75 described later is used to determine whether or not connection is possible based on the grammar.

  The phonetic symbol 73 is a phonetic symbol indicating the pronunciation of the English word 712. In the example of FIG. 3, the pronunciation of I is shown as the phonetic symbol 73.

  The meaning 74 indicates the meaning of the English word 712. In the example of FIG. 3, “I” which is the meaning of I is shown.

  The auxiliary information 75 is a description of the item shown in the image 711, and through this, a story is given to the game and a hint is given to the player indicating whether or not the connection between the specific word cards 7 is possible.

  In the example of FIG. 3, the supplementary information 75 includes the text “Cyclops spear. Used in combination with death armor with personal characteristics, or general armor with no triad characteristics.” This sentence is intended to give the game a narrative that is a fantasy story based on the world view of medieval Europe, and also gives hints of English grammar when using the subject I.

  For example, for the part indicating the name of the item shown in the image 711, “Cyclops Trap”, a hint indicating that I is the subject of the first person because Cyclops is the first giant to appear in Greek mythology. It has become.

  “Death armor with personal characteristics” corresponds to am shown in Table 1, which is a verb that am uses with the subject of the first person, and indicates the grammatical matter that the meaning is “is”. Hint, I suggests that you can connect to it.

  In addition, “general movement armor that does not have the trinomial characteristic” corresponds to the want etc. shown in Table 1, but this is a grammatical matter that the want is a general verb that is not a verb used with the subject of the third person singular. The hint indicates that I can connect to this.

  Further, the auxiliary information 75 is not only information for providing hints of English composition to the player, but is also used for determining whether the created English grammar is correct or not, which can be recognized by the determination unit 216 of the game machine 1. Information (information on whether or not a connection is possible based on word usage) is associated. The information provided for determining the correctness of the grammar is information provided only for processing by the determination unit 216 of the game machine 1, and is information that cannot be visually recognized by the player.

  The score 76 indicates a score given to the player when the composition is completed, and the total score 76 of each word card 7 included in the completed English sentence is given to the player.

  The attack power 77 is a value used for determining whether or not replacement is possible when another player tries to replace the word card 7 constituting the English composition.

  The defense strength 78 is a value used for determining whether or not the replacement can be performed when another player tries to replace the word card 7 constituting the English composition.

  Next, an English composition using the above-described word card 7 will be described. It is a schematic diagram which shows a mode that an English sentence is completed using the card | curd of FIG.

  In the example shown in FIG. 4, an English sentence “I am beautiful” is configured by connecting three words of a word card 7 </ b> A indicating I, a word card 7 </ b> B indicating am, and a word card 7 </ b> C indicating beatiful. .

  Here, between the word cards 7A and 7B, the connectable connection symbols 721A and 724B are provided at positions facing each other, so that these word cards 7A and 7B can be connected. . Similarly, between the word cards 7B and 7C, connectable connection symbols 722B and 725C are provided at opposing positions so that the word cards 7B and 7C can be connected. .

  Here, in the auxiliary information 75A of the word card 7A, it is suggested that I can be connected to the verb used together with the subject of the first person. However, in the example shown in FIG. 4, I is connected to the corresponding am. This also shows that the word cards 7A and 7B can be connected.

  Similarly, the auxiliary information 75B of the word card 7B describes that the word card 7B can be used together with the hand, but the word card 7C describes the hand in the image 711C and the auxiliary information 75C includes “beat full”. It can be seen that the word cards 7 </ b> B and 7 </ b> C can be connected also from the fact that it is described as “hand”.

  As described above, according to the language learning game machine according to the present invention, even a beginner who is unfamiliar with English grammar can intuitively arrange the word cards 7 based on the information shown in the image 711 and the auxiliary information 75. You can complete correct English sentences and learn English grammar through the process of writing.

  That is, according to the language learning game machine according to the present invention, the grammar, which has been difficult to acquire in the conventional language learning and is a major factor that reduces the motivation for learning, is motivated for language learning through an intuition-based game. Regardless of the size, you can easily learn happily.

  Next, how a language learning game is executed by the language learning game machine according to the present embodiment will be described. In this game, each player is handed a word card as a hand, and each player uses this hand to complete an English sentence, and the number of points given according to the types of word cards that make up the completed English sentence Compete.

  FIG. 5 is a flowchart showing information processing when a language learning game is executed by the language learning game machine of FIG.

  First, the reading unit 211 of the language learning game machine 1 reads out a predetermined number of word cards 7 as hand cards of the player who operates the player from the storage unit 3 at random, and the display unit 212 reads out the card. The hand card thus displayed is displayed on the display 4 (step S1). The number of word cards 7 to be read can be arbitrarily set.

  Next, the recognizing unit 214 recognizes the type and position of the connection symbol of the read hand card (step S2).

  Next, the order determination unit 224 determines the draw order of each player. Here, “draw” refers to an operation of newly replenishing a hand card from a predetermined number of word cards 7 (field cards) that can be read by the reading unit 212 separately from the hand card. It should be noted that a predetermined number of word cards 7 may be read at random by the reading unit 212 at the start of the game to form a field card, or the reading unit 212 may randomly select the word cards 7 from the storage unit 3 for each draw. It is good also as a field card by reading until the number of is reached.

  In this embodiment, it is assumed that the drawing order is determined by any one of the language learning game machines of a plurality of players participating in the game, but is determined by other methods. May be.

  Next, it is judged by the order recognition unit 225 whether or not it is the drawing order of the own machine (step S4). The recognition of the draw order is performed through transmission / reception of information regarding the execution status of the draw with other machines.

  When the player's own drawing order is set (step S4: Yes), the player gives an instruction to the game machine 1 to discard 0 to 5 unnecessary hand cards via the operation unit 5. This instruction is accepted by the accepting unit 223 of the game machine 1, and the display unit 212 erases unnecessary hand cards from the hand cards displayed on the display 4 according to the instructions (step S5). When the number of unnecessary cards included in the instruction is zero, this erasure is not performed.

  Next, the reading unit 211 newly reads out the number of hand cards equal to the number of hand cards discarded in step S5 from the storage unit 3, whereby the card is drawn (step S6). The drawn hand card is displayed on the display 4 by the display unit 212.

  Here, the player tries to create an English sentence based on the hand card. At this time, the player can intuitively determine whether or not the hand card can be connected based on the type and position of the connection symbol 72 of the word card 7, the image 711 and the auxiliary information 75. Of course, a player with a high level of English proficiency may connect a hand card according to English grammar while referring to the word 712.

  On the other hand, in the present embodiment, the game machine 1 determines whether or not the word card 7 can be connected according to the type of part of speech, based on the type and position of the connection symbol 72, unlike the determination procedure of the player. Specifically, based on the type and position of the connection symbol 72 recognized by the recognition unit 214, the determination unit 216 roughly determines whether or not connection is possible.

  When English composition is possible, and the accepting unit 223 accepts an English text creation instruction from the player (step S7: Yes), the connecting unit 217 assumes that a plurality of word cards 7 are connected in order. Associate with. The display unit 212 displays English by displaying the associated word card 7 on the display 4 (step S8). At this time, the display unit 212 similarly instructs the other game machines 1 to display English sentences via the communication unit 6.

  When the English text created in this way is displayed on the other game machine 1, the other players examine whether or not the displayed English text can be edited by replacing the card.

  As an example of this editing, English text created by a player is arranged based on the type and position of the connection symbol, but there is a grammatical error, and the cause of the error contained in the English text It is possible to correct some of the cards (replacement target cards) to correct English sentences by replacing them with other cards (replacement candidate cards) in their hand. In addition, the English sentence is grammatically correct, but by replacing any word card that makes up the English sentence (also the replacement target card) with your hand card (also the replacement candidate card), the same grammatically correct sentence Can be mentioned.

  When the receiving unit 223 receives an editing instruction from the game machine 1 of another player via the communication unit 6 (step S9: Yes), and receives an editing instruction from a plurality of game machines 1 (Step S10: Yes), the attack power recognition unit 218 recognizes the attack power of a plurality of replacement candidate cards included in the editing instruction, and the comparison unit 220 compares the attack powers (Step S11). A replacement candidate card is selected (step S12).

  Next, the replacement unit 221 replaces the replacement target card with a replacement candidate card (step S13). At this time, the display unit 212 deletes the replacement target card from the display 4 and displays a replacement candidate card at the same position as the card. Also, the connection unit 217 connects the other word card 7 displayed before the replacement and the replacement candidate card.

  Next, the completion judging unit 215 completes the composition of the English text after the replacement by the replacement candidate card based on the information on the correctness of the grammar of the word card 7 stored in association with the auxiliary information 75. It is determined whether or not (step S14).

  If the English sentence is grammatically correct and the composition has been completed (step S14: Yes), the calculation unit 222 calculates the total score 76 of the score 76 of each word card 7 constituting the replaced English sentence (step S15). The total score is displayed on the display 4 via the display unit 212 and stored in the storage unit 3 as a score of the player who finally completed the English sentence using the hand card (step S16).

  When the English sentence is completed and the total points of the card are calculated and added, the number of hands of each player will be reduced, but at this time, the hand that has been reduced by each player will be newly drawn. (Step S17), each player's hand is always a predetermined number. The hand drawing at this time is performed in the same manner as in step S6 described above.

  Next, the measurement unit 226 determines whether or not the field card remains, that is, whether or not the drawing from the field card has been performed a predetermined number of times (step S18).

  If no field card remains (step S18: No), the game ends. On the other hand, if the field card remains (step S18: Yes), the process returns to step S4, and a fall is received until the player's turn comes around.

  In addition, when it is not possible to create a sentence in the above-described step S7 (step S7: No), the process returns to step S4, and a fault is received until the turn of the aircraft arrives.

  If no editing is performed by another player in step S9 (step S9: No), the process proceeds to step S14, where it is determined whether the English text is grammatically correct and the composition is completed. .

  If the composition is not completed in step S14 (step S14: No), each word card 7 constituting the English sentence is returned to each player (step S19), and the process proceeds to step S18. When the word card 7 is returned, the display unit 212 displays the returned word card 7 on the display 4.

  In step S10, when an editing instruction from a single game machine 1 is received (step S10: No), the process proceeds to step S13, where replacement target cards are replaced and displayed by replacement candidate cards.

  By the way, when the game machine 1 is not in the draw order of its own machine (step S4: No), the English sentence created by another player as described above can be edited.

  If the reception unit 223 of the game machine 1 does not receive an editing command from the player via the operation unit 5 (step S20: No), the process returns to step S4 and waits until the player's turn comes around. .

  On the other hand, when the receiving unit 223 receives an editing command from the player (step S20: Yes), the receiving unit 223 further receives a selection command for a hand to be a replacement candidate card from the player via the operation unit 5 (step S21). ).

  Next, if the correct English text is created through the same processing as the above-described steps S10 to S13 and the editing by the replacement candidate card of the own machine is successful (step S22: Yes), the total is the same as in steps S15 to S17. Points are calculated (step S23), points are added (step S24), and a card is drawn (step S25).

  And it returns to step S4 again, and it waits until its own turn comes around.

  The series of processes described above is performed until no field card is used. The game ends when there are no more field cards, the score earned for each player is counted, and the ranking is announced.

  According to the above-described language learning game machine 1 according to the present embodiment, language learning is performed through a game with a game where the ranking is determined by the score, so that the concentration of the player is increased and the learning efficiency is increased. Can do. In addition, since even beginners can play intuitively through connection symbols and auxiliary information, the psychological burden on the start and continuation of language learning can be reduced, and language acquisition can be made easier. .

  The present invention is not limited to the above-described embodiment, and various modifications can be made. For example, in the language learning game according to the procedure described with reference to FIG. 5, each player creates their own English sentences. However, in the present invention, this is not restrictive, and all players create a common English sentence. It may be a game. In the following, a language learning game according to a modified example in which players create a common English sentence will be described.

  FIG. 6 is a flowchart showing information processing when a language learning game according to a modification is executed.

  First, the reading unit 211 of the language learning game machine 1 reads out a predetermined number of word cards 7 as hand cards of the player who operates the player from the storage unit 3 at random, and the display unit 212 reads out the card. The hand card thus displayed is displayed on the display 4 (step S31). The number of word cards 7 to be read can be arbitrarily set.

  Next, the recognition unit 214 recognizes the type and position of the connection symbol of the read hand card (step S32).

  Next, the reading unit 211 reads the starting point card that is the starting point of the composition, and the display unit 212 displays the starting point card on the display 4 (step S33). One starting card is displayed for each sentence. That is, the player creates as many sentences as the number of displayed starting cards. The number of starting cards can be set arbitrarily.

  Next, the recognition unit 214 recognizes the type and position of the connection symbol 72 of the starting card (Step S34).

  Next, the order determining unit 224 determines the draw order of each player in the same manner as in step S3 of FIG. 5 described above (step S35).

  Next, the order recognizing unit 225 determines whether or not it is the drawing order of its own device (step S36) in the same manner as in step S4 of FIG. 5 described above.

  When it is the drawing order of the own device (step S36: Yes), the reading unit 211 newly reads a hand card from the storage unit 3, and the card is drawn (step S37). The drawn hand card is displayed on the display 4 by the display unit 212.

  Here, the player tries to create an English sentence based on the hand card. Also in this modification, the player can intuitively determine whether or not the hand card can be connected based on the type and position of the connection symbol 72 of the word card 7, the image 711, and the auxiliary information 75. Further, a player with a high level of English proficiency may connect a hand card according to English grammar while referring to the word 712.

  On the other hand, also in this variation, the determination unit 216 determines whether or not the game machine 1 can connect the word card 7 based on the type and position of the connection symbol 72 recognized by the recognition unit 214.

  If English writing is possible, and the receiving unit 223 receives an English text creation instruction using a hand card from the player (step S38: Yes), the display unit 212 erases the hand card and the connection unit 217 The same card is connected as if it was connected to another connectable word card 7 included in the English sentence currently being created.

  Next, the completion determination unit 215 stores the grammatical correctness between the word cards 7 stored in association with the auxiliary information 75, so that the English text after replacement by the replacement candidate card is grammatically correct and the composition is correct. It is determined whether or not it is completed (step S39).

  If the composition is not completed in step S39 (step S39: No), the display unit 212 displays the hand card used in step S38 on the display 4 (step S54), and the turn of the own machine is completed. The process returns to S36 and waits until the next turn comes.

  On the other hand, when the composition is completed in step S39 (step S39: Yes), the display unit 212 displays the hand card used in step S38 on the display 4 as it is for the own device. On the other hand, the display unit 212 generates control information to be displayed (back side display) on the display 4 in such a form that the contents described in the hand card cannot be visually recognized for other devices, and this information is transmitted via the communication unit 6. Is transmitted to the other device (step S40).

  In this way, when the English sentence in which the last associated word card 7 is displayed on the reverse side is displayed on the other game machine 1, the other players are placed on the displayed word card 7 (replacement target card) on the reverse side of the displayed English sentence. On the other hand, whether or not a replacement (attack) is possible with his / her hand card (replacement candidate card) is examined.

  When the accepting unit 223 accepts an attack from another game device 1 via the communication unit 6 (step S41: Yes), and accepts an attack from a plurality of game devices 1 (step S41) (S42: Yes), the display unit 212 displays the word card 7 displayed on the reverse side on the display 4 in a normal display, that is, in a form in which the description can be visually recognized (step S43).

  Next, the attack power recognition unit 218 recognizes the attack power of a plurality of replacement candidate cards included in the attack, and the comparison unit 220 compares the attack powers (step S44), and the replacement candidate with the highest attack power. A card is selected (step S45).

  Then, the display unit 212 displays the selected replacement candidate card (strongest card) having the highest attack power on the display 4 (step S46).

  Next, the defense level recognition unit 219 recognizes the defense level of the replacement target card, and the comparison unit 220 compares the defense level of the replacement target card with the attack strength of the strongest card (step S47). Replacement is possible when the attack strength of the strongest card exceeds the defense strength of the replacement target card.

  As a result of the comparison by the comparison unit 220, if the replacement is possible (step S48: Yes), the replacement unit 221 replaces the replacement target card with the strongest card. Specifically, the replacement unit 221 causes the display unit 212 to display the strongest card instead of the replacement target card (step S49), and causes the connection unit 217 to display other cards that were displayed before replacement. The English composition is completed by connecting the word card 7 and the strongest card.

  Next, the score 76 is totaled for all the word cards 7 included in the completed English sentence by the calculation unit 222, the total score is calculated (step S50), and the total score finally completes the English sentence using the hand card. The player's score is displayed on the display 4 via the display unit 212 and stored in the storage unit 3 (step S51).

  Then, the display unit 212 erases the completed English sentence from the display 4, and the reading unit 211 reads the word card 7 as a new start card from the storage unit 3, and the display unit 212 reads the read start card. The erased English text is displayed at the position where it was displayed on the display 4 (step S52).

  Next, the measuring unit 226 determines whether or not the field card remains, that is, whether or not the drawing from the field card has been performed a predetermined number of times (step S53).

  If no field card remains (step S53: No), the game ends. On the other hand, when the field card remains (step S53: Yes), the process returns to step S36, and a fall is received until the turn of the own device comes around.

  In step S41 described above, if there is no attack from another machine (step S41: No), the hand card that has been displayed on the reverse side by the display unit 211 is normally displayed (step S55), and the process proceeds to step S47. . In step S47 and subsequent steps, the same processing as described above is performed on the assumption that the normally displayed hand card is the strongest card.

  If an editing instruction is received from the single game machine 1 in step S42 (step S42: No), the process proceeds to step S47. After step S47, the same process as described above is performed with the replacement candidate card received from the single game machine 1 as the strongest card.

  By the way, if the game machine 1 is not in the draw order of the game machine 1 (step S36: No), the game machine 1 proceeds to step S56 and can attack English sentences created by other players as described above.

  If the accepting unit 223 of the game machine 1 does not receive an attack command from the player via the operation unit 5 (step S56: No), the process returns to step S36 and waits until the player's turn comes around. Is called.

  On the other hand, when the receiving unit 223 receives an attack command from the player (step S56: Yes), the receiving unit 223 further receives a selection command for a hand to be a replacement candidate card from the player via the operation unit 5 (step S57). ).

  Next, through the same processing as in steps S42 to S47 described above, when correct English text is created and the attack by the replacement candidate card of the own machine is successful (step S58: Yes), the total score is calculated in the same manner as in step S50. Calculation is performed (step S59), and points are added (step S60) in the same manner as step S51.

  And it returns to step S36 again and waits until the turn of an own machine comes around.

  If the attack is not successful in step S58 (step S58: No), the replacement candidate card 58 is erased from the display 4 by the display unit 212 (step S61), and the process returns to step S36 again. Wait until the turn comes around.

  The series of processes described above is performed until no field card is used. The game ends when there are no more field cards, the score earned for each player is counted, and the ranking is announced.

  Even with the language learning game machine according to the above-described modification, the language learning is performed through a game with a competitiveness in which the ranking is determined by the score, so that the concentration of the player can be enhanced and the learning efficiency can be enhanced. . In addition, since even beginners can play intuitively through connection symbols and auxiliary information, the psychological burden on the start and continuation of language learning can be reduced, and language acquisition can be made easier. .

  By the way, in embodiment mentioned above and its modification, the attack power and defensive power were added to the word card, and editing and attack by other players were made possible, and game nature was raised, but in this invention The attack power and defense power are not essential components.

  Therefore, it is possible to play a game using a word card excluding the attack power and the defense power. In this case, although editing and attack by other players cannot be performed, it is possible to compete for scores, so that it can be a battle game that also attracts the player's interest.

  In addition, the language learning game machine determines whether or not the connection between the cards is possible using a connection symbol, and determines whether the grammar is correct or not using information related to the grammar associated with the auxiliary information. Not limited to this, it may be determined only by the connection symbol whether or not connection is possible. Thereby, the required grammatical accuracy can be reduced, and a language learning game that is easier for beginners to play can be provided.

  In the above-described embodiment and its modifications, only the word card is used. However, the present invention is not limited to this, and a game may be added with a special card having a specific function. Examples of special cards include cards that allow you to exchange any number of cards with cards that have already been erased (cards that have been discarded), cards that can be considered to have forcibly completed the English text you are creating, and card cards from other players Cards that can take any card from the card, cards that can add any card from the word cards included in English completed by other players to your hand, displayed in the stage of composing English Examples include cards that return all cards to field cards.

  In the above-described embodiment and its modifications, each player plays a battle game using their own game machine. However, the present invention is not limited to this, and a plurality of games are played using a single game machine. It is good also as a game which is played by performing an operation of these players alternately. Further, each player may perform a game operation using a terminal such as a personal computer connected to the server via the Internet or the like, and the server may be responsible for various functions shown in FIG.

  Further, in the above-described embodiment and its modified examples, description has been made by taking English as an example of language, but the present invention is not limited to this, and is not limited to this, but French, German, Italian, Spanish, Portuguese, Russian, It is good also as a game for learning other languages, such as Chinese and Korean.

  Note that the games described in the above-described embodiment and its modifications are all executed by a game program being executed by a terminal machine such as a game machine or a personal computer that performs information processing, but are created using paper or the like. By using the word card, it is possible to play a similar game without using a terminal. In this case, the player himself / herself will be responsible for connection / non-compliance, grammatical correctness / recognition, comparison and comparison of attack power and defense power, and counting of points.

  Even through such a game without using a game machine, language learning is performed through a game having a winning and deciding order based on the score, so that the concentration of the player can be increased and the learning efficiency can be improved. In addition, since even beginners can play intuitively through connection symbols and auxiliary information, the psychological burden on the start and continuation of language learning can be reduced, and language acquisition can be made easier. .

1 Language learning game machine 2 Control unit 21 CPU
211 Reading Unit 212 Display Unit 214 Recognition Unit 215 Completion Determination Unit 216 Determination Unit 217 Connection Unit 218 Attack Strength Recognition Unit 219 Defense Strength Recognition Unit 220 Comparison Unit 221 Replacement Unit 222 Calculation Unit 223 Reception Unit 224 Order Determination Unit 225 Order Recognition Unit 226 Measuring unit 23 ROM
25 RAM
3 storage unit 4 display 5 operation unit 6 communication unit 7 word card 71 drawing unit 711 image 712 English word 72 connection symbol 73 phonetic symbol 74 meaning 75 auxiliary information 76 score 77 attack power 78 defense power

Claims (12)

A language learning game machine that completes a sentence using a plurality of cards each assigned a word and a score,
A recognition unit for recognizing the type and position of a connection symbol indicating whether connection is possible based on the type of part of speech assigned to the card;
A determination unit that determines whether the two cards can be connected based on the type and position of the connection symbol;
When two cards can be connected, a connection unit for connecting the two cards;
A completion determination unit for determining whether or not the composition by the card is completed;
A calculation unit that calculates the total of the scores assigned to each of the cards when the composition is completed;
A game machine for language learning, characterized by comprising:   The language according to claim 1, further comprising a replacement unit that replaces the replacement target card with a replacement candidate card that can be connected in the same manner as the replacement target card to be replaced among the connected cards. A game machine for learning. Further attack power is assigned to each of the cards,
An attack power recognizing unit that recognizes the attack power of the replacement candidate card;
A comparison unit for comparing the attack power of the replacement candidate cards;
Further comprising
When the replacement candidate card is singular, the replacement unit replaces the replacement symmetric card with the replacement candidate card,
When there are a plurality of replacement candidate cards, the comparison unit compares the attack power of the plurality of replacement candidate cards, and the replacement unit replaces the replacement candidate card with the maximum attack power. Replace the target card,
The language learning game machine according to claim 2. Each of the cards is further assigned an offensive power and defense power,
An attack power recognizing unit that recognizes the attack power of the replacement candidate card;
A defense level recognition unit for recognizing the defense level of the replacement target card;
A comparison unit that compares the attack power of the replacement candidate cards and compares the replacement candidate card and the defense power of the replacement target card;
Further comprising
When the replacement candidate card is singular, the comparison unit compares the attack power of the replacement candidate card with the defense power of the replacement target card, and the replacement unit has the attack power of the replacement card. When the defensive power is exceeded, the replacement target card is replaced by the replacement candidate card,
When there are a plurality of replacement candidate cards, the comparison unit compares the attack power of the plurality of replacement candidate cards, selects the replacement candidate card having the maximum attack power, and determines that the attack power is the maximum. The replacement candidate card is compared with the replacement target card, and the replacement unit performs the replacement when the attack power of the replacement candidate card having the maximum attack power exceeds the defensive power. Replacing the replacement target card with a candidate card;
The language learning game machine according to claim 2. Auxiliary information indicating whether or not a connection based on the grammar among the specific cards is further assigned to each of the cards,
The determination unit determines whether two cards can be connected based on the auxiliary information in addition to the type and position of the connection symbol.
The language learning game machine according to claim 1, wherein the game machine is for learning language. For each of the cards, a drawing unit indicating whether or not connection based on the type of part of speech between the specific cards is further assigned,
The determination unit determines whether or not two cards can be connected based on the drawing unit in addition to the type and position of the connection symbol and the auxiliary information.
The language learning game machine according to any one of claims 1 to 5, wherein the game machine is used for language learning. A program for causing a computer to execute a language learning game that completes sentences using a plurality of cards each assigned a word and a score,
A recognition step for recognizing the type and position of a connection symbol indicating whether or not connection is possible based on the type of part of speech assigned to the card;
A determination step of determining whether the two cards can be connected based on the type and position of the connection symbol;
A connection step of connecting the two cards when the two cards are connectable;
A completion judging step for judging whether or not the composition by the card is completed;
A calculation step of calculating a total of the scores assigned to the cards when the composition is completed;
A program comprising:   8. The program according to claim 7, further comprising a replacement step of replacing the replacement target card with a replacement candidate card that can be connected in the same manner as the replacement target card to be replaced among the connected cards. . Further attack power is assigned to each of the cards,
An attack recognition process for recognizing the attack power of the replacement candidate card;
A comparison step for comparing the attack power of the replacement candidate cards;
Further comprising
When the replacement candidate card is singular, in the replacement step, replace the replacement symmetric card with the replacement candidate card,
When there are a plurality of replacement candidate cards, the comparison step compares the attack power of the plurality of replacement candidate cards, and replaces the replacement target card with the replacement candidate card that maximizes the attack power. ,
The program according to claim 8, wherein: Each of the cards is further assigned an offensive power and defense power,
An attack recognition process for recognizing the attack power of the replacement candidate card;
A defensive power recognition step for recognizing the defensive power of the replacement target card;
A comparison step of comparing the attack power between the replacement candidate cards and comparing the replacement candidate card and the defense power of the replacement target card;
Further comprising
When the replacement candidate card is singular, in the comparison step, the attack power of the replacement candidate card is compared with the defense strength of the replacement target card, and in the replacement step, the comparison step As a result of the comparison, if the attack power exceeds the defensive power, replace the replacement target card with the replacement candidate card,
When there are a plurality of replacement candidate cards, the comparison step compares the attack powers of the plurality of replacement candidate cards, selects the replacement candidate card having the maximum attack power, and maximizes the attack power. The attack power of the replacement candidate card is compared with the defense power of the replacement target card, and the attack power of the replacement candidate card that maximizes the attack power in the replacement step is The replacement target card is replaced by the replacement candidate card when the defense power is exceeded.
The program according to claim 8, wherein: Auxiliary information indicating whether or not a connection based on the grammar among the specific cards is further assigned to each of the cards,
In the determination step, it is determined whether or not the two cards can be connected based on the auxiliary information in addition to the type and position of the connection symbol.
The program according to any one of claims 7 to 10, wherein: For each of the cards, a drawing unit indicating whether or not connection based on the type of part of speech between the specific cards is further assigned,
In the determination step, in addition to the type and position of the connection symbol and the auxiliary information, it is determined whether or not the two cards can be connected based on the drawing unit.
The program according to any one of claims 7 to 11, characterized in that:

Images