JP3860822B2 - Game system - Google Patents

Description

  The present invention relates to a game system, and more particularly to a game system that questions a problem and receives an answer.

In the quiz game machine, there is a problem that the frequency of the same problem being raised increases as the player plays the quiz game many times, the quiz game becomes obsolete, and the player's interest rapidly decreases. As countermeasures, for example, the quiz problem presented by the quiz game machine is appropriately updated or the game screen is devised. For example, in the quiz game machine described in Patent Document 1, a game screen having a story property is advanced according to the number of correct answers of the player so that the player can enjoy the story property in addition to solving the quiz problem. I am trying to keep my interest lasting.
Japanese Patent Laid-Open No. 2003-38850 (FIGS. 12-15)

  However, when updating a quiz problem to prevent the quiz game from becoming obsolete, it is necessary to continue to create a new quiz problem in a short period of time so as not to be late for the player's playing experience. Cost. When the game screen having a story characteristic is advanced according to the number of correct answers of the player as in Patent Document 1, the variety of game screens can be provided to the player in addition to the variety of quiz problems. It may be possible to prevent the quiz game from becoming obsolete as compared to the case of updating only the game screen, but if the game screen is not continuously updated, the quiz game will become obsolete eventually, so it takes a lot of effort to update the game screen .

  An object of the present invention is to provide a new means for sustaining the interest of a player in a game system in which a question is given and an answer is received.

Game system according to the first invention, an input unit for accepting an input from the outside, and output means for outputting voice or image, and the common data section, a first storage means for storing a plurality of branch data portion, said A question setting means for setting up a problem that is a combination of any one of a common data portion and a plurality of branch data portions, wherein one of the common data portion and the plurality of branch data portions is read from the first storage means , after said common data section is output to the output means, the is temporarily stops the output to the output means, a problem question means the branching data portions read the after a predetermined time has elapsed Ru is output to the output means, Is provided.

  In this game system, when displaying a question sentence, after outputting the common data part, the output is temporarily stopped and the problem is branched, so it is difficult to predict the answer when the common data part is output . That is, even if the player knows the answers to all the branching problems, it is difficult to grasp the subject or the subject is misunderstood only by outputting the common data part, and even if a plurality of similar questions are given. The difficulty of the quiz game can be dramatically increased.

By giving such a branch problem, it is possible to add a new kind of difficulty to the quiz game, diversify the difficulty, and effectively prevent the quiz game from becoming obsolete. Combining diversification of difficulty due to the branch problem and problem update can reduce the frequency of problem updates required to suppress the staleness of the quiz game.
The game system according to a second aspect is the game system according to the first aspect, wherein the first storage means includes first problem data obtained by combining any one of the common data portion and a plurality of branch data portions, and the common data. Storing the second problem data combining a portion and a branch data portion combined with the first problem data among the plurality of branch data portions, and the common data portion and the plurality of branch data portions, Remember. Reading one of the common data portion and the plurality of branch data portions by the question setting means from the first storage means means reading the first or second question data.

In this game system, each branch problem is treated as a first and second problem data as an individual problem in the same way as a normal problem, and when each problem data is read and output, it is output after outputting the common data part. Is temporarily stopped and the branch data portion is output. Since the data of each branch problem is handled as individual problem data like a normal problem, the problem data can be easily managed.
A game system according to a third aspect is the game system according to the first or second aspect , wherein the output means includes a display means for displaying an image, and the output means displays the display on the output means. It is to let you.

  In this game system, when displaying a question sentence, a common data portion is displayed, and then a pool is placed to branch the question. Therefore, it is difficult to predict an answer when the common data portion is displayed. That is, even if the player knows the answers to all the branching problems, it is difficult to grasp the subject or the subject is misunderstood only by outputting the common data part, and even if a plurality of similar questions are given. The difficulty of the quiz game can be dramatically increased.

A game system according to a fourth invention is the game system according to any one of the first to third inventions , wherein the common data portion includes a stop sign at the end, and the problem questioning means outputs the output to the output means. The temporary stop is when the stop sign is detected.
In this game system, the display of the read problem data can be branched by referring to the stop sign included in the read problem data. In other words, it is only necessary to read the problem data of the branch problem in the same way as the problem data without the branch, and to control the branch display at the stage of processing the stop sign. The branch problem is stored in a special area or there is no branch. There is no need to perform special control in managing problem data, such as adding a flag indicating. Therefore, management of problem data including writing and reading of problem data is easy.

The game system according to a fifth aspect is the game system according to the fourth aspect, wherein the common data portion and the branch data portion are text data, and the stop sign is text data of special characters.
In this case, since the problem data is text data and the stop sign is special character text data, the problem data can be easily managed and the problem data can be easily input.

A game system according to a sixth aspect of the present invention is the game system according to any of the third to fifth aspects, wherein the branch data portion includes a first half portion and a second half portion, and the problem questioning means displays the first half portion. After that, the screen is switched to display the latter half.
In this case, after branching, the screen is further switched to display the problem. For example, by displaying the part that becomes the answer of the common data part before switching the screen, switching the display here, and displaying the question part for which another answer is requested on a new screen, it is possible to indicate to the player that the subject matter has changed. Easy to recognize.

A game system according to a seventh aspect is the game system according to any one of the first to sixth aspects, wherein the first storage means further stores an answer to a question and inputs the question via the input means. Correctness / incorrectness determination means for determining the correctness / incorrectness of the answered answer in comparison with the answer stored in the first storage means, and a second answer history storing the answer history for each question of the player in association with the identification information of the player. Storage means, and problem selection means for selecting a branch data portion to be given to the player with reference to the answer history corresponding to the identification information of the player,
In this case, since the branching question to be given is selected based on the answer history of the player, the same question can be prevented from being given frequently. If a new branch problem can be selected according to the history of the solved branch problems, the difficulty level can be dramatically improved with a small increase in the number of problems.

A game program for causing a computer to function as the game system according to the eighth invention stores input means for receiving external input, output means for outputting sound or images, a common data portion, and a plurality of branch data portions. A first storage means, and a problem assignment means for asking a problem that is a combination of any one of the common data portion and the plurality of branch data portions , wherein the common data portion and the plurality of branch data portions are After reading from the first storage means and outputting the common data portion to the output means, the output to the output means is temporarily stopped, and the read branch data portion is output to the output means after a predetermined time has elapsed. includes a problem question means that, a.
Game system control method according to the ninth invention, the input means, an input step of accepting an external input, an output unit, and an output step of outputting a sound or image, the problem question means, common data part, From the first storage means for storing a plurality of branch data portions, the common data portion and the plurality of branch data portions are read out, the common data portion is output to the output means, and then to the output means And a problem questioning step of causing the output means to output the read branch data portion after a predetermined time has elapsed.
A game system according to a tenth aspect of the present invention is a first memory for storing input means for receiving external input, output means for outputting sound or images, a common data portion, a plurality of branch data portions, and an answer to a problem. Means for asking a problem that is a combination of any one of the common data portion and the plurality of branch data portions, wherein the common data portion and the plurality of branch data portions are the first After reading out from the storage means and outputting the common data portion to the output means, the output to the output means is temporarily stopped, and after the elapse of a predetermined time, the read branch data portion is output to the output means And the correctness / incorrectness of the answer input via the input means for the question is determined by comparing with the answer stored in the first storage means Erroneous decision means, wherein at least one of the branch data portions includes a first half portion and a second half portion, and when the problem questioning means outputs the branch data portion, the first half portion is displayed. The screen is switched to display the latter half.
A game system according to an eleventh aspect of the present invention stores an input means for receiving an input from the outside, an output means for outputting sound or an image, a common data portion, a plurality of branch data portions, and a problem answer. Storage means, and a problem assignment means for asking a problem which is a combination of any one of the common data portion and the plurality of branch data portions, wherein any one of the common data portion and the plurality of branch data portions is the first 1. After reading from the storage means, outputting the common data portion to the output means, temporarily stopping output to the output means, and outputting the read branch data portion to the output means after a predetermined time has elapsed And the correctness / incorrectness of the answer inputted via the input means for the question is judged by comparing with the answer stored in the first storage means Correct answer judgment means and second storage means for storing the answer history for each question of the player in association with the identification information of the player, wherein the question answering means is the answer history stored in the second storage means Based on, select the question to be asked.

  According to the present invention, in a game system in which a question is given and an answer is received, the player's interest is maintained by branching the question halfway and giving the question.

(1) Configuration (Overall configuration)
FIG. 1 is a schematic configuration diagram of a game system according to the present invention. This game system includes a terminal device 1 installed in each store and a server 2 to which the terminal device 1 is connected via a network. In the figure, four terminal devices 1 installed in each store are illustrated, but the number of terminal devices 1 installed in each store is not limited to four. Further, the number of terminal devices 1 installed in each store may be different. The network is a public line such as ADSL or ISDN, a wireless communication system, the Internet, or a combination of these as appropriate.

(Terminal device and server)
FIG. 2 is a hardware configuration diagram of the terminal device 1 and the server 2.
The terminal device 1 includes a CPU 100, a recording medium 101, a network communication unit 102, a drawing control unit 103, a monitor 104, a sound processing unit 105, a speaker 105, an external input / output control unit 107, an external device control unit 108, a touch panel 109, and a card. A reader 110 is provided.

The CPU 100, the recording medium 101, the network communication unit 102, the drawing control unit 103, the sound processing unit 105, and the external input / output control unit 107 are connected to each other via an external bus. The network communication unit 102 is connected to the server 2 and other terminal devices 1 via the network.
The CPU 100 reads out the image, sound, and game control program stored in the recording medium 101 based on the operating system (OS) stored in the recording medium 101. Some or all of the read image, sound, control program, and the like are held in the work area of the recording medium 101. Then, the CPU 100 controls the control program stored in the work area, the display object polygon, texture, various data such as image data including other character information, audio data, and the like, which will be described later. Processing is executed based on the detection signal.

The touch panel 109 is disposed on the screen of the monitor 104, detects the pressing of the player, and outputs a detection signal to the external device control unit 108. The touch panel 109 is used for inputting an answer to a quiz question described later from the player. The card reader 110 reads data from a card in which player authentication information and the like are recorded.
The external input / output control unit 107 converts various detection signals output from the touch panel 109 and the card reader 110 into digital signals for processing and outputs them to the CPU 100. Also, the external input / output control unit 107 converts command information for each device output from the CPU 100 into a control signal and outputs the control signal to the card reader 110 and the touch panel 109. The input / output of this signal is performed within a predetermined time division period, for example.

  The drawing processing unit 103 processes image data based on a drawing instruction from the CPU 100 and provides the processed image data to the monitor 104. For example, position calculation in a pseudo three-dimensional space, light source calculation processing, and the like are performed. At the same time, based on the calculation result, a writing process of image data to be drawn into the video RAM of the drawing processing unit 103, for example, a writing (pasting) process of texture data to an area of the video RAM designated by a polygon is performed. Then, a desired image is displayed on the monitor 104. The audio playback unit 105 outputs a desired message, BGM, or the like to the speaker 105 in accordance with an instruction from the CPU 100. The network communication unit 102 transmits and receives information necessary for executing the quiz game to and from the server 2.

  The server 2 includes a CPU 200, a recording medium 201, and a network communication unit 202. The CPU 200 reads out images, sounds, and game control programs stored in the recording medium 201 based on an operating system (OS) stored in the recording medium 201, and progress necessary for progress of the quiz game in the terminal device 1. Processing information is created and the results of the quiz game received from the terminal device 1 are stored. The network communication unit 202 transmits progress process information necessary for the progress of the quiz game in the terminal device 1 and receives the result of the quiz game received from the terminal device 1.

(Data stored in the recording medium of the terminal device)
FIG. 3 is a configuration example of data stored in the recording medium 101.
The recording medium 101 stores an OS 1000, a game control program 1001, and a game data storage unit 1035.
The OS 1000 is an operating system (OS) for operating the CPU 100. The CPU 100 is operated by the OS 1000, reads the game control program 1001, and controls the progress of the quiz game by executing the game control program 1001. Various game data stored in the game data storage unit 1035 is used by the game control program 1001.

The game control program 1001 includes a master program 1002 for causing the terminal device 1 to function as a master terminal device, and a slave program 1024 for causing the terminal device 1 to function as a slave terminal device.
(Master program)
The master program 1002 includes a player information update unit 1003, a Q & A update unit 1004, a qualifying stage progress control unit 1005, and a final stage progress control unit 1013. The master program 1002 further includes a qualifying quiz questioning unit 1005, an answer receiving unit 1007, a correct / incorrect determination unit 1008, a point assigning unit 1009, a dropped player determining unit 1010, a qualifying master determining unit 1011, and a preparation result transmitting unit 1012. The master program 1002 includes a genre / system selection unit 1014, a final quiz determination unit 1015, a final quiz questioning unit 1016, an answer reception unit 1017, a correct / incorrect determination unit 1018, a point awarding unit 1019, a rank calculation unit 1020, and a score point award. Unit 1021, experience value calculation unit 1022, and final result transmission unit 1023.

The player information update unit 1003 updates player information (see FIG. 11) stored in a player information storage unit 1036 described later.
The Q & A update unit 1004 receives from the server 2 Q & A update information for updating quiz question data / answer data (hereinafter referred to as Q & A data), and stores the Q & A data stored in the Q & A storage unit 1037 described later. Update.

(Preliminary stage progress controller)
The qualifying stage progress control unit 1005 controls the qualifying quiz questioning unit 1005, the answer receiving unit 1007, the correct / incorrect determination unit 1008, the point granting unit 1009, the dropped player determining unit 1010, the qualifying master determining unit 1011 and the preparation result transmitting unit 1012. Control the progress of the quiz game in the qualifying stage.

  In the qualifying stage, when a player requests participation in an online tournament, as shown in FIG. 36, four groups are combined into four groups, and the first to third qualifying stages are executed for each group. In the qualifying stage, one of the four terminal devices in one group is determined as the master terminal device, and the master terminal device executes the master program so that its own master terminal device and the other three slave devices. The first to third qualifying quiz games are executed on the terminal device.

  In the first to third qualifying stages of the qualifying stage, the qualifying quiz questioning unit 1006 has its own terminal device 1 that is a master terminal device and other terminal devices 1 that are slave terminal devices connected via a network. The problem data stored in the Q & A information storage unit 1037 is read out, and the read out problem data is presented. The qualifying quiz questioning unit 1006 reads the problem data from the Q & A information storage unit 1037 based on the identification information of the qualifying question questions transmitted from the server 2.

In the first to third qualifying stages of the qualifying stage, the answer receiving unit 1007 receives from its own terminal device 1 that is a master terminal device and other terminal devices 1 that are slave terminal devices connected via a network. , Accepts answers to questions. Each terminal device detects a press on the touch panel 109 by the player and receives an answer.
The correct / incorrect determination unit 1008 compares the answer received by the answer receiving unit 1007 with the corresponding answer data stored in the Q & A information storage unit 1037. If the two match, the correct / incorrect determination unit 1008 determines that the answer is correct. If not, it is determined that the answer is incorrect.

If the answer is correct as a result of the determination by the correctness determination unit 1008, the point awarding unit 1009 gives points to the player of the terminal device 1 that has accepted the answer.
The dropped player determination unit 1010 compares the points acquired by the player every time the first to third preliminary rounds are completed, and determines the player with the fewest points as the dropped player.

The qualifying master determining unit 1011 becomes the master terminal device in the subsequent qualifying when the dropped player determining unit 1010 determines that the terminal device that is the master terminal device is the dropped player as a result of the first or second qualifying. The other terminal device 1 (the terminal device 1 of another player who has passed the current qualifying) is determined.
The player information update unit 1003 updates the points of the player at the final stage every time each qualifying of the first to third qualifying ends. Also, the player information update unit 1003 is a player information storage unit based on the winning points determined by the final ranking, the cumulative scores of tournaments (including the first to third qualifying rounds and finals), the number of players versus the number of players, and the experience value calculated from the final ranking. The contents of the player information 1036 are updated, and whether or not the rank varies depending on the experience value is calculated. If the rank of the player information varies, the rank is also updated.

The qualifying result transmission unit 1012 transmits the player information of the terminal devices 1 of the same group updated by the player information update unit 1003 to the server 2.
(Final Stage Progress Control Section)
The final stage progress control unit 1013 includes a genre / system selection unit 1014, a final quiz determination unit 1015, a final quiz questioning unit 1016, an answer reception unit 1017, a correctness determination unit 1018, a point awarding unit 1019, a rank calculation unit 1020, and a score calculation unit. The unit 1021, the experience value calculation unit 1022, and the final result transmission unit 1023 are controlled to proceed with the final stage quiz game. As shown in FIG. 36, the final stage progress control unit 1013 includes one terminal device that has passed the first to third qualifiers in each group, in this example, a total of four units T1, T8, T11, and T14. Control the progress of the final stage quiz game.

  The genre / system selection unit 1014 presents a genre / system selection screen as shown in FIG. 37 on the monitor 104 of the terminal device 1 (including the master itself) in the same group, and each terminal device 1 (including the master itself). The selection of a genre and a method is accepted from. In this embodiment, the genre includes animation, sports, entertainment, and trivia. The method is a question and answer method for quizzes, including xx quizzes, four-choice quizzes, sequential quizzes, four-letter words, and typing, and the difficulty increases sequentially from xx to typing. Stars in categories determined by the genre / method indicate the level of difficulty. The star on the left side of the page is the beginner level, and the intermediate and advanced levels are shown in order toward the right. If the difficulty level is selected by the selected genre / method, and a predetermined score is obtained with a quiz of the selected genre / method / difficulty level as will be described later, the star mark is outlined.

  The final quiz determination unit 1015 determines three quiz questions from the genre / method received by the genre / method selection unit 1014. The final quiz determination unit 1015 determines the question to be asked based on the answer history of the four players stored in the player information storage unit 1036. For example, the final quiz determination unit 1015 determines a branch problem that can be set by referring to the answer history when a branch problem to be described later is set.

The final quiz questioning unit 1016 determines the question determined by the final quiz determining unit 1015 from the terminal device 1 that is the master terminal device and the other terminal devices 1 that are slave terminal devices connected via the network. Ask questions.
The answer accepting unit 1017 accepts an answer to the question from the player of the terminal device 1 that is the master terminal device and the player of the other terminal device 1 that is the slave terminal device connected via the network. Each terminal device detects a press on the touch panel 109 by the player and receives an answer.

The correctness determination unit 1018 compares the answer to the question received by the answer reception unit 1017 with the corresponding answer data stored in the Q & A information storage unit 1037. If both match, the correctness determination unit 1018 determines that the answer is correct. If they do not match, it is determined that the answer is incorrect.
If the answer is correct as a result of the determination by the correctness determination unit 1018, the point awarding unit 1019 gives points to the player of the terminal device 1 that has accepted the answer.

The rank calculation unit 1020 compares the points of the four players for all 12 questions, and gives the four players the first rank (win), second rank (second place), third rank, and fourth rank.
The winning point assigning unit 1021 assigns points (points) according to the ranks to the four players. The players belong to student dormitories or leagues according to their ranks, and the winning points are used for the student dormitory to compete with the total points of the players belonging to the student dormitories.

The experience value calculation / giving unit 1022 calculates an experience value using the tournament score (point converted value), the number of players (point converted value), and the final ranking (point converted value) according to the experience value calculation formula shown in FIG. ,Give. The calculation of the experience value will be described later in detail.
The player information update unit 1003 has four player points for 12 questions in the final stage, the points determined by the final ranking, the cumulative scores of tournaments (including the 1st to 3rd preliminary rounds and finals), the number of players, the final ranking The content of the player information in the player information storage unit 1036 is updated with the experience value calculated from the above, and whether or not the rank varies according to the experience value is calculated. If the rank of the player information varies, the rank is also updated.

The final result transmission unit 1023 transmits the player information of the four players updated by the player information update unit 1003 to the server 2.
(Slave program)
The slave program 1024 includes a preparation stage progress control unit 1025, a tournament reception unit 1026, a genre / method selection unit 1027, a preparation quiz questioning unit 1028, an answer reception unit 1029, a correctness determination unit 1030, a point assignment unit 1031, and a pass determination unit 1032. , A player information update unit 1033 and a preparation result transmission unit 1034 are included.

(Preparation stage progress control part)
The preparation stage progress control unit 1025 includes a tournament reception unit 1026, a genre / method selection unit 1027, a preparation quiz questioning unit 1028, an answer reception unit 1029, a correctness determination unit 1030, a point assignment unit 1031, a pass determination unit 1032 and a player information update unit. 1033, the preparation result transmission unit 1034 is controlled to control the progress of the preparation stage quiz game.

When the tournament reception unit 1026 receives a participation request for an online tournament (consisting of a preparation stage, a qualifying stage, and a final stage) from the player, the tournament reception unit 1026 transfers the participation request to the server 2.
The genre / system selection unit 1027 displays a genre / system selection screen (FIG. 37) on the monitor 104, and accepts the selection of the genre / system from the player. Each terminal device detects a press on the touch panel 109 by the player and receives an answer.

The preparatory quiz determination unit 1041 determines the problem belonging to the genre / system selected by the genre / system selection unit 1027 from the Q & A information storage unit 1037 based on the answer history of the player information stored in the player information storage unit 1036. A predetermined number is determined.
The preparatory quiz questioning section 1028 questions the questions determined by the preparatory quiz determining section 1041.

The answer accepting unit 1029 accepts the player's answer to the question. The answer receiving unit 1029 detects the pressing of the player on the touch panel 109 and receives the answer.
The correct / incorrect determination unit 1030 compares the player's answer received by the answer receiving unit 1029 with the corresponding answer data stored in the Q & A information storage unit 1037. If both match, the answer is determined to be correct. If not, it is determined as an incorrect answer.

If the correctness determination unit 1030 determines that the answer is correct, the point awarding unit 1031 gives points to the player.
The pass determination unit 1032 compares the player's points for the genre / method quiz selected by the player with the pass reference points, and gives a pass certificate to the player if the score points of the player are equal to or higher than the pass reference points. .

In the player information storage unit 1036, the player information update unit 1033 updates the genre / system to which the pass certificate is given and the system one level higher than the genre to a genre / system that the player can select. Update the number and answer history.
The preparation result transmission unit 1034 transmits the player information updated by the player information update unit 1033 in the player information storage unit 1036 to the server 2.

(Game data storage)
The game data storage unit 1035 includes a player information storage unit 1036, a Q & A information storage unit 1037, a character 1038, a mascot character information storage unit 1039, and an experience value / rank calculation data storage unit 1040.
The player information storage unit 1036 stores player information including data shown in FIG. As shown in FIG. 11, the player information includes player ID, password (PW), player name, selectable genre / method, answer history, number of passing certificates, cumulative value of points, experience value, player rank. , An ID for identifying a character representing the player on the game screen (screen of the monitor 104), an ID for identifying a mascot character representing the pet of the player on the game screen, and a case where the player belongs to a student dormitory Includes the student dormitory and the league to which the player belongs.

  FIG. 12 is an example of selectable genre / system data included in the player information in the player information storage unit 1036. Here, the selectable genre / system data of the player ID “U001” is taken as an example. The genres and methods that can be selected include genres, methods, and difficulty levels. The genre includes, for example, anime, sports, entertainment, and trivia. The methods include, for example, ◯ × quiz, four-choice quiz, order guessing quiz, typing quiz and four-letter word quiz. The difficulty level includes, for example, beginner level, intermediate level, and advanced level. In the example of FIG. 12, the player ID “U001” is the beginner level / intermediate level of the anime ○ × quiz, the beginner level / intermediate level / advanced level of sports, the elementary level of sports four choices, and the beginner level of entertainment ○ ×. You can choose between intermediate level, trivia ○ × beginner level and intermediate level.

FIG. 13 is a data configuration example of an answer history. The answer history is stored for each player. That is, there is an answer history for each player ID. Here, a data example of the answer history of the player ID “001” is given.
The answer history has correct / incorrect data for each player ID “001” for each quiz group ID, sub ID, genre, method, and difficulty level for specifying a branch problem when the quiz is a branch problem. . The branch problem in which the right / wrong column is blank is a problem that has not yet been answered. When the qualifying quiz determining unit, the final quiz determining unit, and the preparatory quiz determining unit determine a branching question to be given to the player ID “001”, the branching question to be set is determined based on the answer history of the player ID “001”. . For example, in the case of the branch problem group with group ID = 1, since the problem with sub ID = 0 has been answered in the past, the branch problem with sub ID = 1 is presented. In the case of a branch problem group with group ID = 2, since the answer is for sub ID = 0, sub ID = 2 is given, but sub ID = 2, 3 is not given. In the case of group ID = 3, since sub ID = 0 is answered, sub ID = 1 is given, but sub ID = 2 is not given. In the case of group ID = 4, no answer is given for sub ID = 0, so sub ID = 0 is given, but sub ID = 1 is not given.

The answer history is stored and stored for the questions answered in any of the preparation, qualifying, and final stages.
The Q & A information storage unit 1037 stores Q & A information in which quiz question data and answer data are associated with each other. 14 to 17 are configuration examples of Q & A data. The Q & A data includes a group ID, a sub ID, a genre / method / difficulty, question data, and answer data. The question data and the answer data are specified by the group ID and the sub ID. The problem data includes a common data portion and a branch data portion. The common data portion is data common to each branch problem of the branch problem group specified by the same group ID. The branch data portion is data different from each other in each branch problem of the branch problem group specified by the same group ID. A data structure example and a screen display example of the branch problem will be described in detail later.

  The character information storage unit 1038 stores a character ID and a character image specified by the character ID in association with each other. The character is an image that embodies the player itself in the game space. The mascot character information storage unit 1039 stores a mascot character ID and a mascot character image specified by the mascot character ID in association with each other. The mascot character is an image that embodies the player's pet in the game space.

  In the example of FIGS. 18 and 19, the image stored in association with the character ID “C1” (FIG. 11) of the player ID “U001” is below the character images of “Student 10th grade” and “Leon”. It is displayed. Further, an image stored in association with the mascot character ID “M1” (FIG. 11) with the player ID “U001” is displayed so as to overlap the character image with the character ID “C1”.

  In the experience value / rank calculation data storage unit 1040, as shown in FIGS. 33 to 34, the player's tournament scores are converted into score points for the first qualifying, the second qualifying, the third qualifying, and the final. Are stored, a table for converting the number of opponents to the number of opponents points, and a table for converting the final rankings to the final ranking points. These tables are called experience value calculation data. The experience value / rank calculation data storage unit 1040 stores rank calculation data for calculating a rank corresponding to the experience value as shown in FIGS. 31 and 32.

(Data stored on the server's recording medium)
The recording medium 201 stores an OS 2000, a game control program 2001, and game data 2022.
The OS 2000 is an operating system (OS) for operating the CPU 200. The CPU 200 is operated by the OS 2000 and reads the game control program 2001 and the game data 2022.

  The game control program 2001 includes a tournament receiving unit 2002, a preparation stage processing unit 2003, a preparation result receiving unit 2005, a preparation player information updating unit 2005, a qualifying stage processing unit 2007, a qualifying combination unit 2008, a first qualifying master determining unit 2009, a qualifying Quiz determining unit 2010, qualifying quiz progress processing information transmitting unit 2011, qualifying result receiving unit 2012, ranking calculating unit 2013, winning point calculating unit 2014, experience value calculating unit 2015, qualifying player information updating unit 2016, final stage processing unit 2016, A final master determination unit 2017, a final quiz progress process information transmission unit 2018, a final result reception unit 2019, a final player information update unit 2020, and a tournament result transmission unit 2021 are included.

  The tournament reception unit 2002 receives the tournament participation request transmitted by the tournament reception unit 1026 of the terminal device 1. The tournament reception unit 2002 continues the reception for a predetermined time until the number of terminal devices participating in the tournament reaches 16 (16 players). The tournament reception unit 2002 ends the tournament participation reception when there are 16 participating terminal devices or when a predetermined time has elapsed.

(Preparation stage processing)
The preparation stage processing unit 2003 controls the preparation result reception unit 2005 and the preparation player information update unit 2006 to execute the preparation stage process executed by the terminal device 1.
The preparation result reception unit 2005 receives the player information on which the preparation result transmitted from the preparation result transmission unit of the terminal device 1 has been reflected.

The preparation player information update unit 2006 updates the player information stored in the player information storage unit 2023 with the player information received by the preparation result reception unit 2005. The player information updated here includes the number of passing certificates, selectable genres / methods, and answer history.
(Qualifying stage processing)
The qualifying stage processing unit 2007 includes a qualifying combination unit 2008, a qualifying master determining unit 2009, a qualifying quiz determining unit 2010, a qualifying quiz progress processing information transmitting unit 2011, a qualifying result receiving unit 2012, a rank calculating unit 2013, a winning point calculating unit 2014, The experience value calculation unit 2015 and the qualifying player information update unit 2016 are controlled to execute the qualifying stage process.

  When the tournament accepting unit 2002 accepts a maximum of 16 units (when less than 16 units, the CPU of the server 2, the other terminal device 1 or the like substitutes for the player) in the qualifying combination unit 2008, FIG. As shown, four groups of four terminals, one group of terminal devices T1 to T4 (first group), T5 to T8 (second group), T9 to T12 (third group), and T13 to T16 (fourth group). Combine.

The qualifying master determination unit 2009 determines a master terminal device for each of the first to fourth groups combined in the qualifying combination unit 2008. In FIG. 36, the letter “M” is attached to the master terminal device. In this example, the master terminal apparatus is determined as T4 for the first group, T8 for the second group, T12 for the third group, and T16 for the fourth group.
The qualifying quiz determining unit 2010 determines a question to be asked in the qualifying stage from the first to the third qualifying for each group fighting the qualifying. The qualifying quiz determination unit 2010 refers to the answer history of the player information of all the players in the group, and determines a question to be given at the qualifying stage. For example, if 6 questions are asked in each qualifying session, the number of questions to be assigned in the 1st to 3rd qualifying sessions per group is 6 * 3 = 18 questions.

  The qualifying quiz progress processing information transmission unit 2011 transmits information necessary for the qualifying quiz progress processing to the master terminal device of each group determined by the qualifying master determination unit 2009. This information includes “matching player specifying information”, “master terminal information”, “preliminary quiz question identification information”, and “player information”. “Competing player identification information”, “master terminal information”, and “player information” are included. “Competing player identification information” is information (player ID, user name, character ID, mascot ID, etc.) for identifying a player who is an opponent in the same group, and information for identifying a terminal device operated by the player (terminal device) Authentication information, etc.). “Master terminal information” is information that identifies which terminal device is the master among the terminal devices of the same group. “Preliminary quiz question identification information” includes (group ID) (sub ID) (genre) (method) (difficulty) as shown in FIGS. The qualifying quiz assignment section 1005 of the master terminal device reads out the problem data from the Q & A data storage section 1037 based on the “preliminary assignment question identification information”, and gives a question to players in the same group.

The qualifying result reception unit 2012 receives player information reflecting the result of the qualifying stage from the qualifying result transmission unit 1012 of the master terminal device.
Upon receiving the results of each player in the qualifying from the four groups of master terminal devices, the rank calculating unit 2013 does not advance to the final stage according to the result of the qualifying (becomes a dropped player before the third qualifying) Ranking players from 5th to 16th. For example, the ranking is as follows. For the four players who dropped out in the first qualifying, 13th to 16th places are awarded according to the points earned in the qualifying of each player. For the four players who dropped out in the second qualifying, 9th to 12th places are awarded according to the points earned in the qualifying of each player. For the four players who dropped out in the third qualifying, 5th to 8th places are awarded according to the points acquired in the qualifying of each player.

The winning point calculation unit 2014 calculates the winning points of each player according to the ranks calculated by the rank calculating unit 2013 and gives them to the players.
The experience value calculation unit 2015 calculates an experience value using the tournament score (point conversion value), the number of people to be played (point conversion value), and the final ranking (point conversion value) according to the experience value calculation formula shown in FIG. Give. The calculation of the experience value will be described later in detail.

  The qualifying player information updating unit 2015 updates the contents of the player information in the player information storage unit 2023 with the points in the qualifying stage of the 5th to 16th players, the winning points determined by the final ranking, the experience value, and the answer history. The qualifying player information update unit 2015 further calculates whether or not the rank varies depending on the experience value, and also updates the rank when the rank of the player information varies.

The final stage processing unit 2017 includes a final master determination unit 2018, a final quiz progress processing information transmission unit 2019, a final result reception unit 2020, and a tournament result transmission unit 2022.
The final master determination unit 2018 determines one master terminal device from among the terminal devices of the four players who advance to the final stage. In the example of FIG. 36, T14 is determined as the master terminal device among T1, T8, T11, and T14 that advance to the final stage.

  The final quiz progress process information transmission unit 2019 transmits the final quiz progress process information to the master terminal device determined by the final master determination unit 2018. The final quiz progress processing information includes “matching player specifying information”, “master terminal information”, and “player information”. Also, the final quiz progress processing information transmission unit 2019 transmits “matching player identification information” and “master terminal information” to slave terminal devices other than the master terminal device.

The final result reception unit 2020 receives the final result (the points at the final stage of the final stage player, the points determined by the final ranking, and the experience value) from the final result transmission unit 1023 of the master terminal device.
The final player information update unit 2021 updates the player information stored in the player information storage unit 2023 based on the final result received by the final result reception unit 2020. The tournament result transmission unit 2022 totals the results of the 16 players who participated in the tournament at the final stage and transmits them to the 16 participating terminal devices T1 to T16.

Since the game data storage unit 2022 has the same configuration as the game data storage unit 1035 of the terminal device, the description thereof is omitted.
(Experience value calculation)
The experience value calculation assigning units 1022 and 2015 use the tournament score (point converted value), the number of interpersonal players (point converted value), and the final ranking (point converted value) according to the experience value calculation formula shown in FIG. Calculate and grant.

  As shown in FIG. 33, the tournament score is a point obtained by converting the scores in the first and second preliminary rounds and the finals. For the players who participated in the final, these points are accumulated conversion points at each stage of the final and first to third qualifying rounds. In addition, for the players who have dropped out in the first to third qualifying rounds, the converted points scored in the stage until dropping out are accumulated points. The number of interpersonal battles is determined by the number of human players who do not include the number of players who participated in the tournament (maximum 16 people) that the CPU of the computer, for example, the CPU 200 of the server 3 has replaced the player. Points converted to are used. The conversion points for the number of interpersonal players are added to the conversion points for the tournament score. The final rank is the final rank of the tournament of the 1st to 3rd preliminary rounds and the final. Players who dropped out in the first qualifying are given 13th to 16th according to the points scored in the first qualifying. Players who dropped out in the second qualifying are given 9th to 12th according to the points scored in the first and second qualifying. Players who dropped out in the third qualifying are given fifth to eighth places according to the points scored in the first, second and third qualifying. The final ranking points are converted according to the table of FIG. The experience value is used to promote the rank of the player.

  As shown in FIGS. 31 and 32, the rank is determined by the accumulated experience value. In this quiz game space, each player belongs to a school and belongs to a student dormitory or a league according to the rank. The rank is the lowest for the trainees 10 in FIG. 32, and all the players start the quiz game from this rank. The rank is higher on the page of FIG. 32, and the ranks up to level 1 of the Great Mage belong to the student dormitory. The rank of the Great Mage 1st grade is sage, and the sage and higher belong to the league. In FIG. 31, the rank is higher on the page, and up to the Kongo Ken is promoted only by experience values. The wise king, wise emperor and wise god above the Kongo sage are the Kongo sage and the first player of each league weekly ranking belongs. There are league A to league C in the league, and league C, league B, and league A become the top leagues in order. In the league, players are replaced every week. In leagues B and C, a predetermined number of players with the highest results for one week are promoted to the next higher league. In leagues A to C, a predetermined number of players with lower grades for one week are demoted to the next lower league. The wise god is given to the player when the rank of King Kongo is ranked first in the league A. The wise emperor is given to the player when the rank of the Kongo sage ranks first in the league B for one week. The wise king is given to the player when the Kongo sage rank is ranked first in League C for the week.

(Problem data display)
[○ × Quiz]
FIG. 14 is a first configuration example of Q & A data, and shows an example of branch problem data in the case of a xx quiz. In the figure, the upper and lower Q & A data are the Q & A of the branch problem. The upper and lower problem data is composed of a common data portion and a branch data portion. Here, for convenience of explanation, the common data portion and the branch data portion are displayed in separate columns, but the common data portion and the branch data portion are not stored separately, but are integrated text data. It is remembered.

  In FIG. 14, data representing the same content is stored in the common data portion, and includes a special character “*” (stop sign) at the end indicating the end point of the common data portion and stopping the process. The branch data part is data after “*” and is different from each other in the upper and lower branch problems. As answer data, different data is usually stored for each branch problem. In the text data of the problem data, characters other than the stop indicator are full-width characters, and the stop indicator is inserted as a single-byte special character.

  When the integrated text data is a branching problem, the common data is displayed when it is displayed on the monitor 6 by the qualifying quiz questioning part 1006, the final quiz questioning part 1016, and the preliminary quiz questioning part 1028 (hereinafter referred to as the questioning part). While the part is sequentially processed from the beginning for each unit text (for example, one character), the half-width special character “*” is detected, and the boundary between the common data part and the branch data part is detected. After a predetermined time elapses after displaying the common data portion (after the accumulation of the predetermined time), the branch data portion is displayed. According to the display of such a question part, when the common data part is displayed and the pool is placed, it is not possible to know which branch data part will be displayed next, and the problem effectively provides a branch in the middle. it can. If the number of problems with the same common data portion but different branch data portions is increased, the number of branches to branch after the accumulation increases, so the difficulty level can be easily increased, and the obsolescence of the problem can be effectively suppressed.

  FIGS. 18 to 20 are examples in the case where the upper and lower problem data of FIG. 14 are displayed on the monitor 104. In FIG. 18, the common data portion is displayed as the display image 501 and a predetermined time (for example, 0.5 second) is set. In FIG. 19, the branch data portion of the upper problem data in FIG. Displayed as 502a. On the other hand, in FIG. 20, after the screen of FIG. 18, a predetermined amount of time is left and the branch portion of the problem data in the lower part of FIG. 14 is displayed as the display image 502b. Thus, the difficulty of the quiz can be improved by displaying the question sentence so that the question sentence branches and the correct answer branches while having a common problem part. Further, since a pool is placed before the question sentence branches, there is also an effect of increasing the player's sense of tension by confusing how the question sentence branches.

[Four Choice Quiz]
FIG. 15 is a second configuration example of Q & A data, and shows an example of branch problem data in the case of a four-choice quiz. Four Q & A data from the first stage to the fourth stage are stored. The five Q & A data are the branch problems of the same branch problem group having the same group ID and different sub IDs. In the case of a four-choice quiz, the question data includes answer option data. The common data portion is common to the four Q & A data from the first stage to the fourth stage. The branch data includes a first half part and a second half part.

In the first stage problem data, data up to the end of the problem sentence is stored in the first half. In this case, the latter half of the branch data portion does not exist. As a delimiter between the common data portion and the branch data portion, “*” is included as text data at the end of the common data portion.
In the second stage problem data, a problem sentence that follows the common data part, which is a notice that changes the subject matter of the problem, is stored. In this case, the latter half of the branch data portion exists, and a question sentence having a different meaning from the common data portion is stored. The common data part and the first half part and the latter half part of the branch data part are described in separate columns for convenience of explanation, but are stored as integrated text data.

  In the example of FIG. 15, after displaying the common data portion, the reservoir is put, and after that, the content that completes the question sentence or the content that becomes a notice of branching is displayed, the display is switched, and the content of the problem with a different meaning is displayed. indicate. The display is switched when there are four line breaks in the question text display. Specifically, a special character representing a line break is inserted in the question sentence that is text data, and the special character is detected four times. It can also be realized by inserting a special character indicating display switching into a question sentence which is text data.

  In the case of displaying the second level question data in FIG. 15, the common data portion is first displayed (FIG. 21, display image 501), and after storing a predetermined time, the contents including the answer to the common data portion. Then, the content that is a branch problem whose meaning changes is displayed (FIG. 22, display image 502), the screen is switched, and the content different from the common data portion is displayed (FIG. 23, display image 503a).

  In the case of displaying the third level question data in FIG. 15, the common data portion is first displayed (FIG. 21, display image 501), and after storing a predetermined time, the contents including the answer of the common data portion. Then, the content that is a branching problem that changes the subject is displayed (FIG. 22, display image 502), the screen is switched, and the content different from the common data portion is displayed (FIG. 24, display image 503b).

[Typing quiz]
FIG. 16 is a third example of the Q & A data configuration example, and shows an example of branch problem data in the case of a typing quiz. Examples of screen display of the problem data in the third row in FIG. 25 are shown in FIGS.
First, the display image 501 of the common data portion is displayed (FIG. 25), and after a predetermined time is left, the content including the answer of the common data portion and the content that is a branching problem that changes the meaning is displayed (FIG. 25). 26, display image 502), and the screen is switched to display contents different from the common data portion (FIG. 27, display image 503).

  In the case of this screen example, at the time of displaying the common data portion of FIG. 25, the meaning of the common data portion is estimated and a part of the wrong answer “pistol” is input. Then, notice the first half of the branch data part, notice it, delete the “pistol” character, and when the second half of the branch data part is displayed, somehow follow the original intention (second half of the branch data part) Typing the answer. Thus, by providing a plurality of branch problem groups having the same common data portion, the difficulty level of the quiz game can be increased as compared with the case of only the problem that does not branch.

Moreover, the difficulty level of the quiz game can be increased more effectively by displaying the branch data portion after placing the pool after displaying the common data portion.
[Four letter words quiz]
FIG. 17 is a fourth example of the Q & A data configuration example, taking a branch problem in the case of a four-letter word quiz as an example. Examples of screen display of problem data in the lower part of the figure are shown in FIGS.

First, the display image 501 of the common data portion is displayed (FIG. 28), and after storing a predetermined time, the display image 502 “pistol but” of the first half of the branch data portion is displayed (FIG. 29), The display is switched, and the display image 503 of the latter half of the branch data portion is displayed (FIG. 30).
In the case of this screen example, at the time of displaying the common data portion of FIG. 28, the meaning of the common data portion is estimated and a part of the wrong answer “pistol” is input. After that, although noticed by looking at the display of the first half of the branch data portion, the erroneous character string “pistol” cannot be corrected even when the second half of the branch data portion is displayed.

(Problem data display flow)
FIG. 38 is a flowchart of a process in which the qualifying quiz questioning part 1006, the final quiz questioning part 1016, and the preparatory quiz questioning part 1028 display problem data on the monitor 104.
In S11, the problem data is displayed as unit data from the top. Here, the unit data is one text. Taking the case of FIG. 28 as an example, this corresponds to displaying the first character “Man” of the question sentence.

In S12, it is determined whether or not the character to be displayed next is one-byte “*”. If it is not one-byte “*”, the process returns to S11 to display one more question sentence. The display for each character is repeated until half-width “*” is detected in S12. If half-width “*” is detected, the process proceeds to S13.
In S13, the display of the question sentence is stopped, that is, a predetermined time is left in the display state of FIG. 28, and then the process proceeds to S14 to display the first character of the first half part of the branch data part. In FIG. 29, this corresponds to displaying the first character “wa” in the first half of the branch data portion.

In S15, it is determined whether or not a special character representing a line feed has been detected four times, and if it has not been detected four times, the process returns to S14 to further display the first half of the branch data portion. The display for each character is repeated until the line feed character is detected four times in S15, and if the line feed character is detected four times, the process proceeds to S16.
In S16, the screen is switched. In the example of FIG. 29, it corresponds to switching from the screen of FIG. 29 to FIG.

In S17, the first character in the latter half of the branch data portion is displayed. This corresponds to displaying “le” in FIG. Thereafter, the display for each character is repeated until the end character is detected in S18, and when the end character is detected in S18, the display of the problem data is ended.
[Flow of quiz game]
Hereinafter, a flow of quiz game processing in which the game system of the present embodiment proceeds will be described with reference to FIGS.

The game system according to the present embodiment includes a preparation stage for providing a single game performed by a player alone on a terminal device, and a qualifying stage and a final stage for providing a battle game that competes with other players who operate other terminal devices. .
When the terminal devices T1 to T4 receive the online tournament participation request and transfer it to the server 2 (S100), the server 2 accepts the participation request.

  At that time, the authentication process of the player who requested the participation is performed. Here, when the player inserts the card into the card reader 110 and the player ID is recorded on the card, personal authentication is performed according to the player ID. For example, in the personal authentication, whether or not the player ID recorded on the card and the password input from the touch panel 109 matches the player ID and password included in the player information stored in the player information storage unit 2023 of the server 2. Can be done with. Also, the authentication process can be performed by a password input by the player.

When T1 to T4 accept the participation request for the online tournament, the progress control of the preparation stage is started (S101).
In the progress control of the preparation stage, a genre / method selection screen is displayed, the selection of the genre / method is received from the player (S102), and the answer history of the player information is referenced to store the Q & A data storage for problems with a small number of questions. The data is read from the unit 1037 and the question is given (S103). The question is executed by displaying characters on the monitor 104. An answer is received from the player for the given question (S104), and it is determined whether or not the accepted answer matches the answer data corresponding to the question stored in the Q & A data storage 1037. Points are given (S106). The processes of S103 to S106 are repeated until a predetermined number of problems are completed. After asking a predetermined number of questions, it is determined whether or not the points obtained by the player are equal to or greater than a predetermined point. The selectable genre / method, number of pass certificates, and answer history included in the player information are updated (S108). Until the time limit expires, the processing of S102 to S108 is repeated. When the time limit has elapsed, the question of the qualifying quiz is terminated, and the training result (player information) is transmitted (S109).

  When the server 2 receives transmission of the preparation result (player information) from the terminal devices T1 to T4, the server 2 updates the player information in the player information storage unit 2023. The server 2 executes the preparation stage process of S203 to S204. As shown in FIG. 36, the 16 terminal devices T1 to T16 that have accepted the participation request are combined into 4 groups (S203), and one master terminal device is determined from the 4 terminal devices in each group. Then, referring to the answer history of the player information of the 16 participating players, a quiz to be given for qualifying is determined (S204), and qualifying quiz progress processing information is transmitted to each terminal device (S205). The master terminal device is sent with battle player specifying information, master terminal information, qualifying quiz identification information, and player information, and the slave terminal device is sent with battle player specifying information and master terminal information.

  When each of the terminal devices T1 to T4 receives the qualifying quiz progression process information, the master terminal device T4 executes the first qualifying stage progression control (S111). The master terminal device T4 reads out the problem data stored in the Q & A data storage unit 1037 based on the preliminary quiz identification information received from the server 2, and presents the problem by displaying the problem sentence on the monitor 104 (S112). . The master terminal device T4 displays a question sentence on the screen of its own monitor 104 and accepts an answer from the player. The slave terminal devices T1 to T3 first receive the problem data via the network (S113), receive the answer input from the player, and transmit it to the master terminal device T4 (S114). When the master terminal device T4 receives an answer from each player (S115), the master terminal apparatus T4 determines whether or not the received answer matches the answer data stored in the Q & A data storage unit 1037 (S116). If so, points are given (S117). The master terminal device T4 repeats the processing of a predetermined number of questions (for example, 6 questions) S112 to S117, and then compares the player's points for the predetermined number of questions, and determines the player with the fewest points as the dropped player (S118). ). The master terminal device T4 updates the player information based on the result of the first qualifying (S119). If the master terminal device T4 itself is a dropped player, any of the other terminal devices T1 to T3 in the same group (in this example, the terminal device T3) is newly determined as the master terminal device, and the master holding information (Preliminary question identification information, player information) is transmitted to the new master terminal device T3 (S120). The terminal device T3 receives the master holding information from the terminal device T4 and becomes a new master terminal device (S121).

  Thereafter, the terminal device T3 that newly becomes the master terminal device executes the second qualifying stage progress control process including the processes of S123 to S130 in the same manner as the processes of S112 to S119 in the first qualifying stage (S122). ). Even in the second qualifying stage, the master terminal device T3 becomes a drop-off player, and the terminal device T2 is newly determined as the master terminal device (S131).

  The terminal device T2 that has newly become the master terminal device receives the master holding information (S132), and in the third qualifying stage comprising the processing of S134 to S141, similarly to the processing of S112 to S119 in the third qualifying stage. A progress control process is executed (S133). The master terminal device T4 transmits to the server 2 player information reflecting the results of the respective players in the first to third qualifiers and the results of the first to third qualifiers.

  The server 2 receives the qualifying result transmitted from the master terminal device T4 (S207), and based on the qualifying result, calculates the ranking of the 12 players who do not advance to the final stage from 5th to 16th (S208). The experience values of 12 players are calculated on the basis of the converted points of the qualifying score, the number of players, the final ranking (S209). Further, based on the player information and experience value received from each terminal device, the player information of the 12 players stored in the player information storage means 2023 is updated (S210). Thereafter, the qualifying results are totaled and transmitted to each terminal device (S211). Each terminal device displays the total result of the qualifying.

  Thereafter, the server 2 executes a final stage process S212 including S213 to S214. First, one master terminal device is determined from the four terminal devices 213 that advance to the final stage. In this example, the terminal device T14 is determined as the master terminal device. Next, the final quiz progress process information is transmitted (S214). When the master terminal device T14 and the slave terminal devices T1, T8, T11 receive the final quiz progress processing information (S145), the master terminal device T14 executes the final stage progress control including S146 to S161 (S145). The master terminal apparatus T14 requests T1, T8, and T11 to select a genre / system via the network, and displays a genre / system selection screen on the screen of its own monitor 104 (S147). Upon receipt of the genre / system selection screen (S148), T1, T8, T11 accepts the selection of the genre / system from the player, and transmits the selected genre / system to the master terminal device T14 (S149). The master terminal device T14 receives the selection of the genre / system from its own monitor 104, and also receives the selection of the genre / system from the T1, T8, T11 via the network (S147). The master terminal device T14 determines a question to be given based on the genre / method received the selection and the answer history included in the player information in the player information storage unit 1036 (S150). The determined problem data is read from the Q & A data storage unit 1037.

  The master terminal device T4 questions the problem by transmitting the problem read from the Q & A data storage unit 1037 on the screen of its monitor 104 and to T1, T8, and T11 (S151). In T1, T8, and T11, when the problem data is received (S152), it is displayed on the monitor 104, and the answer to the problem accepted from the player is transmitted to the server 2 (S154). The master terminal device T4 receives the answer received via the network from T1, T8, and T11 and the answer inputted to itself (S153). Then, it is determined whether or not the accepted answer of each player matches the answer data of the question stored in the Q & A data storage unit 1037, and if both match, a point is given (S156). The processes of S151 to S156 are repeated until a predetermined number of questions (12 questions in this example) are given, and when the predetermined number of questions is completed, the ranking of the four players is ranked first based on the results of the final stage. The calculation is made at the fourth place (S157), and points are awarded to each player according to the rank (S158). Also, the experience values of the four players are calculated based on the scores through the first to third qualifying and final stages, the number of interpersonal battles, and the final ranking (S159). Thereafter, the player information is updated by reflecting the results of the final stage and the player's experience value in the player information (S160), and the updated player information of the four players is transmitted to the server 2 as a result of the final stage ( S161).

  Upon receiving the final stage result (player information) (S215), the server 2 updates the information of the four players who participated in the final stage (S216), and displays the tournament result including the final stage for each terminal device T1 to T1. It transmits to T16 (S217). Upon receiving the tournament result from the server 2, each terminal device T <b> 1 to T <b> 16 displays the tournament result on the monitor 104 screen.

1 is an overall configuration diagram of a game system according to the present invention. The hardware schematic block diagram of a game system. The block diagram of the data memorize | stored in the storage medium of the terminal device. The block diagram of the data memorize | stored in the storage medium of the server. Quiz game process flow (part 1). Quiz game process flow (part 2). Quiz game process flow (part 3) Quiz game process flow (part 4) Quiz game process flow (part 5) Quiz game process flow (6) The structural example of player information. 6 is a configuration example of selectable genre / system data included in player information. 3 is a configuration example of answer history data included in player information. Q & A data configuration example 1. Q & A data configuration example 2. Q & A data configuration example 3. Q & A data configuration example 4. Display example 1 of a branching problem / Ox quiz. Display example 2 of a branching problem / Ox quiz. Display example 3 of a branching problem / Ox quiz. Display example 1 of the bifurcation problem / four-choice quiz. Display example 2 of the bifurcation problem / four-choice quiz. Display example 3 of branch problem / four-choice quiz. Display example 4 of branch problem / four-choice quiz. Display example 1 of bifurcation problem / typing quiz. Display example 2 of branch problem / typing quiz. Display example 3 of branch problem / typing quiz. Display example 1 of a branch problem / four-letter word quiz. Display example 2 of branch problem / four-letter word quiz. Display example 3 of a branch problem / four-letter word quiz. Student dormitory affiliation / class (rank) League affiliation / class (rank) Experience value calculation data table 1. Experience value calculation data table 2. Experience value calculation formula. Tournament combination example. Sample screen for selecting genre / method Problem display processing flow.

Explanation of symbols

1: Terminal device 1001: Game control program 1002: Master program 1024: Slave program 1035: Game data storage unit 2: Server 2001: Game control program 2022: Game data storage unit

Claims (11)

Input means for accepting external input;
Output means for outputting sound or image;
First storage means for storing a common data portion and a plurality of branch data portions;
A question setting means for setting a problem which is a combination of any one of the common data portion and the plurality of branch data portions, wherein any one of the common data portion and the plurality of branch data portions is stored in the first storage means. reading, mixture was allowed to output the common data portions to said output means, temporarily stops the output to the output means, a problem question means the branching data portions read the after a predetermined time has elapsed Ru is output to the output means ,
A game system comprising: The first storage means combines the first problem data obtained by combining any one of the common data portion and the plurality of branch data portions with the first problem data among the common data portion and the plurality of branch data portions. Storing the second problem data in combination with a different one from the branch data part to store the common data part and the plurality of branch data parts;
2. The reading of the first or second problem data according to claim 1, wherein reading one of the common data part and the plurality of branch data parts by the question setting means is reading the first or second problem data. Game system. The game system according to claim 1 , wherein the output unit includes a display unit that displays an image, and the output unit causes the output unit to display the image. The common data portion includes a stop sign at the end;
The game system according to any one of claims 1 to 3, wherein the problem-questioning means temporarily stops the output to the output means when the stop sign is detected.   The game system according to claim 4, wherein the common data portion and the branch data portion are text data, and the stop indicator is text data of special characters. The branch data portion includes a first half and a second half, the Question presentation means, after to display the first part, and displays the second part to switch the screen to either of claims 3 to 5 The described game system. The first storage means further stores an answer to the question,
Correct / incorrect judgment means for judging whether the answer inputted through the input means with respect to the question is compared with the answer stored in the first storage means;
Second storage means for storing an answer history for each question of the player in association with the identification information of the player;
The game system according to claim 1 , further comprising problem selection means for selecting a branch data portion to be given to the player with reference to the answer history corresponding to the identification information of the player. Input means for accepting external input;
Output means for outputting sound or image;
First storage means for storing a common data portion and a plurality of branch data portions;
A question setting means for setting a problem which is a combination of any one of the common data portion and the plurality of branch data portions, wherein any one of the common data portion and the plurality of branch data portions is stored in the first storage means. reading, mixture was allowed to output the common data portions to said output means, temporarily stops the output to the output means, a problem question means the branching data portions read the after a predetermined time has elapsed Ru is output to the output means ,
A game program for causing a computer to function as a game system comprising: An input step in which the input means accepts an external input;
An output step in which the output means outputs audio or an image ;
It is problem question means, common data part, from the first storage means for storing a plurality of branch data portion reads out one of the common data portions and the plurality of branch data portion, the output the common data portions After the output to the means, to temporarily stop the output to the output means, a problem questioning step to output the read branch data portion to the output means after a predetermined time,
A game system control method including:   Input means for accepting external input;
  Output means for outputting sound or image;
  A first storage means for storing a common data portion, a plurality of branch data portions, and an answer to the question;
  A question setting means for setting a problem which is a combination of any one of the common data portion and the plurality of branch data portions, wherein any one of the common data portion and the plurality of branch data portions is stored in the first storage means. Reading, after outputting the common data portion to the output means, temporarily stopping the output to the output means, and a problem setting means for outputting the read branch data portion to the output means after a predetermined time,
  Correct / wrong judgment means for judging whether the answer inputted through the input means with respect to the question is compared with the answer stored in the first storage means,
  At least one of the branch data portions includes a first half portion and a second half portion, and the problem-answering means displays the first half portion when outputting the branch data portion, and then switches the screen to switch the second half portion. A game system that displays.   Input means for accepting external input;
  Output means for outputting sound or image;
  First storage means for storing a common data portion, a plurality of branch data portions, and an answer to the question;
  A question setting means for setting a problem which is a combination of any one of the common data portion and the plurality of branch data portions, wherein any one of the common data portion and the plurality of branch data portions is stored in the first storage means. Reading, after outputting the common data portion to the output means, temporarily stopping the output to the output means, and a problem setting means for outputting the read branch data portion to the output means after a predetermined time,
  Correct / incorrect judgment means for judging whether the answer inputted through the input means with respect to the question is compared with the answer stored in the first storage means;
  A second record for storing an answer history for each question of the player in association with the identification information of the player
With recollection means,
  The game system, wherein the question setting means selects a question to be set based on the answer history stored in the second storage means.

Images