JP5291682B2 - GAME DEVICE, GAME DEVICE CONTROL METHOD, AND PROGRAM - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a game apparatus etc. suitable for preventing a player from loading other people's data. <P>SOLUTION: In the game apparatus 300 in which a player is presented with a quiz and is asked to answer the quiz, a saving portion 301 saves a game state and a history of answers of the player and a generating portion 302 which, when they are saved in the saving portion 301, generates an option that matches the history and an option that does not match the history and presents the generated option that matches the history and option that does not match the history to him or her, and when the option that matches the history is selected by the player, the saved game state is loaded. <P>COPYRIGHT: (C)2012,JPO&amp;INPIT

Description

  The present invention relates to a game device, a game device control method, and a program suitable for preventing a player from loading other people's data.

  In an information processing device such as a personal computer or a game device, one of general methods for identifying a user is to input the user name and password, and whether or not the pre-registered user name and password match. There is a technique to identify. The user name and password are often a combination of letters, numbers, symbols, etc., but they are identified using graphics to make the user name and password more intuitive and easy for the user to remember. Techniques to do this have also been developed.

  For example, in Patent Document 1, if the shape of a figure input by a user matches the shape of a figure associated with a user name within an input range associated in advance, the identification is recognized as a correct user. A method is disclosed. As a result, the user can be identified by a procedure that is intuitive and easy for the user to understand.

JP 2010-44600 A

  By the way, there is a demand for an information processing apparatus such as a game apparatus to allow a user (player) to smoothly suspend / resume a game by simply using an easy-to-understand password. For example, in order to prevent a malicious user (player) from loading another person's data, it is necessary to set a complicated password that requires high security. However, for example, to prevent accidental loading of other people's data, a password that is intuitive and easy to understand for the user is automatically set without the user setting, even without high security. An identification method that is generated is required.

  The present invention solves the above-described problems, and an object of the present invention is to provide a game device, a game device control method, and a program suitable for preventing a player from loading another person's data. .

  In order to achieve the above object, a game apparatus according to a first aspect of the present invention is a game apparatus that presents and solves a problem to a player, and includes a save unit, a generation unit, and a load unit.

  A game that presents a problem to the player and is answered typically includes a game that presents a problem to the player, such as a quiz game or a so-called brain training game. In addition, a game that presents a problem to the player and is answered can be a karaoke game, for example, and the music to be sung by the player can be regarded as a problem, and the player can sing as an answer to the problem. In addition to these games, in action games and shooting games, the stage to be cleared by the player is set as the task presented, and the answer to the task is that the player clears the stage. In role playing games and simulation games, It is also possible to use the boss character to be defeated by the player as the task presented and to answer the task as the player defeats the boss character.

  The save unit saves the game state and the player's answer history.

In other words, the save unit saves in the storage medium the game state including information such as how many tasks have been answered and how many points have been earned, and the answer history of the player.
Here, the player's answer history corresponds to, for example, in the quiz / brain training game, among the contents answered by the player for the presented task, the contents of the answers answered before the game is saved. . For example, in a karaoke game, it corresponds to the names of some songs sung by the player before being saved. Furthermore, in action games and shooting games, it corresponds to several stages that the player played or cleared before being saved, and in role playing games and simulation games, the player fought before being saved. Or equivalent to some defeated boss characters.

  When the saving unit performs saving, the generation unit generates an option that matches the history and an option that does not match the history.

Here, the option that matches the history means an option that matches one of the answer history of the player, that is, the answer to some of the tasks presented before being saved.
Conversely, an option that does not match the history means an option that does not match any of the answers to some of the questions presented before being saved.

  The loading unit presents options that match the generated history and options that do not match the history, and loads a saved game state when an option that matches the history is selected by the player.

  For example, prepare one option that matches the history, three options that do not match the history, and a total of four options, and ask the player the question "Which did you answer the last time?" Present. When the option that matches one history is correctly selected, the saved game state is loaded. In other words, the choice that matches the history plays the role of a so-called password, and for the player who played last time, he usually remembers the option answered last time and can load the game, but has not played the previous time Since the player does not know which option was answered last time, the game cannot be loaded.

  With such a configuration, it is possible to use an option that matches the history, that is, an easy-to-understand password that should be known to the player who played last time without having to set the player himself. As a result, it is possible to comfortably prevent the player from loading another person's data.

In the game device of the present invention,
The challenge is a selection problem that lets you select the correct option from multiple options.
The option that matches the history is the option that was last selected by the player.
It is also possible.

  That is, the game in the game device of the present invention presents a selection problem consisting of a plurality of, for example, 2 to 4 choices to the player as a problem, and the player normally proceeds by selecting one of the correct choices. It may be a game to be played. Such a selection problem is typically seen in, for example, quiz games and brain training games.

At this time, the option selected last by the player among the plurality of options presented in the selection problem may be an option that matches the history. That is, the option (not necessarily the correct option) selected by the player for the selection problem presented immediately before saving may be an option that matches the history.
That is, at this time, when the saving unit saves, the generation unit generates the option last selected by the player and the option not selected by the player, and the load unit is selected last by the generated player. The choices and other choices are presented, and the saved game state is loaded when the last choice selected by the player is selected.

  The option selected last by the player is more likely to remain in the impression than the other options selected by the player last time. Therefore, it is assumed that the password for resuming the game will be easier for the player to understand.

In the game device of the present invention,
Multiple selection questions are prepared in advance,
The generation unit generates an option that does not match the history by extracting from the options associated with a plurality of selection questions prepared.
It is also possible.

  That is, by extracting the options that do not match the history from the selection questions prepared in advance, it is possible to save the trouble of generating the options that do not match the history. For example, if 100 selection questions composed of four options are prepared in advance, 400 options are stored in the storage medium of the game device. At this time, for example, if the player has selected one option at a time for the 10-question question in the previous play, these 10 options are options that match the history, and options that do not match the history. It is out of the candidate. That is, the generation unit extracts an option that does not match the history from the remaining 390 options.

In the game device of the present invention,
Each of the choices associated with multiple choice questions is classified into one of several groups,
The generation unit generates an option that does not match the history by extracting from other options classified into a group in which the last selected option is classified.
It is also possible.

  That is, the options are classified into a group of similar options, for example, those classified as “fruit”, those classified as “animal”, and those classified as “stationery”. . Then, an option that does not match the history is selected from those that are classified into the same group as the last selected option (the option that matches the history).

  As a result, the option that matches the history presented by the load unit and the option that does not match the history are constituted by similar options, and thus are appropriate as selection questions to be answered by the player.

In the game device of the present invention,
The save part saves the game state including the score,
The loading unit loads the saved game state with a reduced score when an option that matches the history is not selected by the player.
It is also possible.

  That is, if the player does not select an option that matches the history against the option presented by the load unit, the saved game state is not loaded, but loaded, but at that time a kind of penalty is given. It is to give and load. Here, as a way of giving a penalty, the score (score) obtained in the game played so far is reduced (decreases the score).

  With such a configuration, without strict security up to preventing other people's save data from being loaded, by imposing the penalty by imposing a penalty, it is possible to illegally use other people's save data Deterrence against advancing can be used.

  In order to achieve the above object, a control method for a game device according to a second aspect of the present invention is a control method that is executed by a game device including a save unit, a generation unit, and a load unit that presents and answers a problem to a player. In this case, a save process, a generation process, and a load process are provided.

In the saving process, the saving unit saves the game state and the player's answer history.
In the generation step, when the generation unit performs saving, the generation unit generates an option that matches the history and an option that does not match the history.
In the loading process, the loading unit presents options that match the generated history and options that do not match the history, and loads a saved game state when an option that matches the history is selected by the player. .

  In order to achieve the above object, a program according to a third aspect of the present invention is configured to cause a computer to function as the above game device and to cause the computer to execute each step of the above control method.

  The program of the present invention can be recorded on a computer-readable information storage medium such as a compact disk, flexible disk, hard disk, magneto-optical disk, digital video disk, magnetic tape, and semiconductor memory.

  The program can be distributed and sold via a computer communication network independently of the computer on which the program is executed. The information storage medium can be distributed and sold independently from the computer.

  According to the present invention, it is possible to provide a game device, a game device control method, and a program suitable for preventing a player from loading other people's data.

It is a mimetic diagram showing the outline composition of the typical information processor with which the game device concerning the embodiment of the present invention is realized. It is explanatory drawing which shows the external appearance of a controller. It is a mimetic diagram showing the outline composition concerning the game device of the present invention. In Embodiment 1, it is the figure which showed a mode that the subject was shown to a player. In Embodiment 1, it is the figure which showed a mode that a game was saved and interrupted after a player answers the last. In Embodiment 1, it is the figure which showed a mode that the choice which matches a log | history was acquired from the log | history of a player's answer. In Embodiment 1, it is the figure which showed a mode that the subject was shown at the time of loading. In Embodiment 1, it is the figure which showed a mode that the choice was classified into the some group. In Embodiment 1, it is the figure which showed a mode that the subject comprised by the option classified into the same group at the time of loading is shown. 4 is a flowchart showing a flow of game processing according to the game device of the first embodiment. 4 is a flowchart showing a flow of a loading process according to the game device of the first embodiment. (A), (b) is the figure which showed a mode that the score reduced and loaded in Embodiment 2. FIG. 10 is a flowchart showing a flow of a loading process according to the game device of the second embodiment. In Embodiment 3, it is the figure which showed a mode that the subject was shown to a player. In Embodiment 3, it is the figure which showed a mode that the choice which matches a log | history was acquired from the log | history of the song name which the player selected. In Embodiment 3, it is the figure which showed a mode that the subject was shown at the time of loading. 10 is a flowchart illustrating a flow of game processing according to the game device of the third embodiment. 10 is a flowchart showing a flow of a loading process according to the game device of Embodiment 3.

  Embodiments of the present invention will be described below. In the following, for ease of understanding, an embodiment in which the present invention is realized using a game information processing device will be described. However, the embodiment described below is for explanation, and the present invention is described. It does not limit the range. Therefore, those skilled in the art can employ embodiments in which these elements are replaced with equivalent ones, and these embodiments are also included in the scope of the present invention.

(Embodiment 1)
FIG. 1 is a schematic diagram showing a schematic configuration of a typical information processing device in which a game device according to an embodiment of the present invention is realized. Hereinafter, a description will be given with reference to FIG.

  The information processing apparatus 100 includes a CPU (Central Processing Unit) 101, a ROM 102, a RAM (Random Access Memory) 103, an interface 104, a controller 105, an external memory 106, an image processing unit 107, and a DVD-ROM. (Digital Versatile Disc ROM) drive 108, NIC (Network Interface Card) 109, audio processing unit 110, and microphone 111.

  When a DVD-ROM storing a game program and data is loaded into the DVD-ROM drive 108 and the information processing apparatus 100 is turned on, the program is executed, thereby realizing the game apparatus and the like of the present embodiment. Is done.

  The CPU 101 controls the overall operation of the information processing apparatus 100 and is connected to each component to exchange control signals and data. Further, the CPU 101 uses arithmetic operations such as addition / subtraction / multiplication / division, logical sum, logical product, etc. using an ALU (Arithmetic Logic Unit) (not shown) for a storage area called a register (not shown) that can be accessed at high speed. , Logic operations such as logical negation, bit operations such as bit sum, bit product, bit inversion, bit shift, and bit rotation can be performed. In addition, the CPU 101 itself is configured so that saturation operations such as addition / subtraction / multiplication / division for multimedia processing, vector operations such as trigonometric functions, etc. can be performed at a high speed, and those provided with a coprocessor. There is.

  The ROM 102 records an IPL (Initial Program Loader) that is executed immediately after the power is turned on, and when this is executed, the program recorded on the DVD-ROM is read out to the RAM 103 and execution by the CPU 101 is started. The The ROM 102 stores an operating system program and various data necessary for operation control of the entire information processing apparatus 100.

  The RAM 103 is for temporarily storing data and programs, and holds programs and data read from the DVD-ROM and other data necessary for game progress and chat communication. In addition, the CPU 101 provides a variable area in the RAM 103, performs an operation by directly operating the ALU on the value stored in the variable, and temporarily stores the value stored in the RAM 103 in a register. Performs an operation on the register and writes the result back to the memory.

  The controller 105 connected via the interface 104 receives an operation input performed when the user executes the game.

  FIG. 2 is an explanatory diagram showing the appearance of the controller 105. Hereinafter, a description will be given with reference to FIG.

  On the left side of the controller 105, there are arranged an ↑ button 201, a ↓ button 202, a ← button 203, and a → button 204 that are used to perform an operation input indicating up, down, left, and right.

  On the right side, a ○ button 205 used to input a decision operation, a × button 206 used to input a cancel operation, a Δ button 207 used to input an instruction such as a menu display, A square button 208 used for inputting other instructions is arranged.

  In the center, in addition to the SELECT button 209 and the START button 210, an ANALOG button 211 for instructing start / stop of analog input and an indicator 212 for displaying whether the analog input is valid or invalid are arranged. .

  In addition, joysticks 213 and 214 for inputting an instruction with a size in a direction not limited to up, down, left, and right are arranged at the lower center.

  Further, an L1 button 215, an L2 button 216, an R1 button 217, and an R2 button 218 that can be used for inputting various instructions are disposed above.

  Each button 201-208, 215-218 of the controller 105 is provided with a pressure sensor, and when analog input is enabled, it can detect which button is pressed, The magnitude of the pressure of the user's pressing operation can be obtained in 256 steps from 0 to 255.

  The joysticks 213 and 214 of the controller 105 are provided with strain gauges and can detect how much they are bent in which direction.

  Returning to FIG. 1, the external memory 106 detachably connected via the interface 104 stores data indicating game play status (past results, etc.), game progress data, and network battles. Chat communication log (record) data and the like are stored in a rewritable manner. The user can record these data in the external memory 106 as appropriate by inputting an instruction via the controller 105.

  A DVD-ROM mounted on the DVD-ROM drive 108 stores a program for realizing the game and image data and audio data associated with the game. Under the control of the CPU 101, the DVD-ROM drive 108 performs a reading process on the DVD-ROM loaded therein, reads out necessary programs and data, and these are temporarily stored in the RAM 103 or the like.

  The image processing unit 107 processes the data read from the DVD-ROM by an image arithmetic processor (not shown) included in the CPU 101 or the image processing unit 107, and then processes the processed data on a frame memory ( (Not shown). The image information recorded in the frame memory is converted into a video signal at a predetermined synchronization timing and output to a monitor (not shown) connected to the image processing unit 107. Thereby, various image displays are possible.

  The image calculation processor can execute a two-dimensional image overlay calculation, a transmission calculation such as α blending, and various saturation calculations at high speed.

  Also, polygon information arranged in the virtual three-dimensional space and added with various texture information is rendered by the Z buffer method, and the polygon arranged in the virtual three-dimensional space from the predetermined viewpoint position is determined in the direction of the predetermined line of sight It is also possible to perform high-speed execution of operations for obtaining rendered images.

  Further, the CPU 101 and the image arithmetic processor cooperate to draw a character string as a two-dimensional image in the frame memory or draw it on the surface of each polygon according to the font information that defines the character shape. Is possible. The font information is recorded in the ROM 102, but it is also possible to use dedicated font information recorded in the DVD-ROM.

  The NIC 109 is used to connect the information processing apparatus 100 to a computer communication network (not shown) such as the Internet, and is based on the 10BASE-T / 100BASE-T standard used when configuring a LAN (Local Area Network). To connect to the Internet using an analog modem, ISDN (Integrated Services Digital Network) modem, ADSL (Asymmetric Digital Subscriber Line) modem, cable television line A cable modem or the like and an interface (not shown) that mediates between these and the CPU 101 are configured.

  The audio processing unit 110 converts audio data read from the DVD-ROM into an analog audio signal, and outputs the analog audio signal from a speaker (not shown) connected thereto. Further, under the control of the CPU 101, sound effects and music data to be generated during the progress of the game are generated, and sound corresponding to this is output from the speaker.

  When the audio data recorded on the DVD-ROM is MIDI data, the audio processing unit 110 refers to the sound source data included in the audio data and converts the MIDI data into PCM data. If the compressed audio data is in ADPCM format or Ogg Vorbis format, it is expanded and converted to PCM data. The PCM data can be output by performing D / A (Digital / Analog) conversion at a timing corresponding to the sampling frequency and outputting it to a speaker.

  Furthermore, a microphone 111 can be connected to the information processing apparatus 100 via the interface 104. In this case, the analog signal from the microphone 111 is subjected to A / D conversion at an appropriate sampling frequency so that processing such as mixing in the sound processing unit 110 can be performed as a PCM format digital signal.

  When the information processing apparatus 100 is used as a karaoke apparatus, audio data read from a DVD-ROM or audio data acquired from a computer communication network via the NIC 109 is used as accompaniment data, and audio input from the microphone 111 is used. The audio processing unit 110 mixes the accompaniment data and the singing data with the data as singing data, and outputs it from the speaker. Moreover, it is possible to output sound using headphones (not shown) or earphones (not shown) instead of the speakers.

  In addition, the information processing apparatus 100 uses a large-capacity external storage device such as a hard disk so as to perform the same function as the ROM 102, the RAM 103, the external memory 106, the DVD-ROM mounted on the DVD-ROM drive 108, and the like. You may comprise.

  Further, it is possible to adopt a form in which a keyboard for accepting a character string editing input from a user, a mouse for accepting various position designations and selection inputs, and the like are connected. In addition, a general-purpose personal computer can be used instead of the information processing apparatus 100 of the present embodiment.

  The information processing apparatus 100 described above corresponds to a so-called “consumer video game apparatus”, but the present invention can be realized as long as it performs image processing to display a virtual space. Therefore, the present invention can be realized on various computers such as a mobile phone, a portable game device, a karaoke apparatus, and a general business computer.

  For example, a general computer includes an CPU, a RAM, a ROM, a DVD-ROM drive, and an NIC as in the information processing apparatus 100, and an image processing unit having a simpler function than the information processing apparatus 100. In addition to having a hard disk as an external storage device, a flexible disk, a magneto-optical disk, a magnetic tape, and the like can be used. Further, not the controller 105 but a keyboard or a mouse is used as an input device.

  FIG. 3 is a schematic diagram showing a schematic configuration according to the game device of the present invention. The game apparatus 300 of the present invention is typically realized by the information processing apparatus 100 described above. Hereinafter, the general configuration will be described with reference to this figure.

  The game device 300 includes a save unit 301, a generation unit 302, and a load unit 303. The game apparatus 300 further includes a storage unit 304 realized by a function of the external memory 106, for example, and stores the game state played by the player, the current time, the game results, and the like.

  The saving unit 301 saves the game state and the player's answer history. That is, the save unit 301 stores the current game state stored in the RAM 103 or the like and the player's answer history so that the game played by the player can be interrupted and then resumed from the time when the game was interrupted. Is saved in the storage unit 304. That is, for example, the CPU 101 functions as such a saving unit 301 in cooperation with the RAM 103.

  When the saving unit 301 saves, the generation unit 302 generates an option that matches the history and an option that does not match the history. That is, based on the player's answer history saved in the storage unit 304 by the save unit 301, an option that matches the history and an option that does not match the history are generated. That is, for example, the CPU 101 functions as such a generation unit 302 in cooperation with the RAM 103.

  The loading unit 303 presents options that match the generated history and options that do not match the history, and loads a saved game state when an option that matches the history is selected by the player. That is, when resuming the game that the player has interrupted, the load unit 303 first presents the player with options that match the history generated by the generating unit 302 and options that do not match the history. At this time, for example, the image is displayed on the monitor through the image processing unit 107 or output to the speaker through the audio processing unit 110. Then, the player selects one from the options presented to the load unit 303. At this time, when the player selects an option that matches the history, the game state saved in the storage unit 304 is loaded. That is, for example, the CPU 101 functions as such a load unit 303 by cooperating with the RAM 103 and the image processing unit 107 or the audio processing unit 110.

  FIG. 4 is a diagram illustrating a situation in which the task is presented to the player in the present embodiment. The game apparatus 300 according to the present embodiment typically displays a game screen 400 as shown in the figure on a monitor through the image display unit 107, thereby presenting a problem to the player.

  In FIG. 4, a selected question sentence 401 is displayed as an assignment in the upper part of the game screen 400, and four options 402a to 402d corresponding to the selected question sentence 401 are displayed in the lower part. In other words, in the present embodiment, the problem presented to the player is a selection problem that causes a correct option to be selected from a plurality of options 402. In FIG. 4, four options 402a to 402d are displayed as a plurality of options 402. However, the present embodiment is not limited to this, and there are two, three, or five or more options. Also good. In FIG. 4, the selection question (the selection question sentence 401 and the four choices 402 a to 402 d) is displayed to the player by using the monitor of the game apparatus 300. In the present embodiment, the selection question is displayed on the monitor. For example, the selection problem may be presented by outputting sound through a speaker through the sound processing unit 110.

  The player selects any one of the choices 402 considered to be correct answers for the displayed selection question sentence 401. That is, normally, the correct option 402 for the selected question sentence 401 is arranged in any one of the four options 402a to 402d, and the non-correct answer option 402 is arranged in the remaining three. In FIG. 4, selection marks 403a to 403d are arranged on the left side of the respective options 402a to 402d. These selection marks 403a to 403d represent figures of “◯”, “×”, “Δ”, and “□”, and the ○ button 205, X button 206, Δ button 207, and □ button 208 of the controller 105, respectively. Are associated with each other. When the player selects any one of the options 402 that seems to be the correct answer, the player presses the buttons 205 to 208 of the controller 105 corresponding to the selection marks 403a to 403d associated with the respective options 402a to 402d (press operation) To select).

Specifically, in FIG. 4, with respect to the selection question sentence 401 “What is the prefecture located in the northernmost part of Japan?”, The player gives the correct answer among the displayed four choices 402 a to 402 d.
(A) When the user thinks that the option 402a is “Tokyo”, press the ○ button 205 of the controller 105 corresponding to the “◯” of the selection mark 403a;
(B) When it is considered that the option 402b is “Osaka Prefecture”, the X button 206 of the controller 105 corresponding to the “X” of the selection mark 403b is pressed,
(C) When it is thought that “Okinawa Prefecture” is the option 402c, the Δ button 207 of the controller 105 corresponding to “Δ” of the selection mark 403c is pressed,
(D) When it is considered that the option 402d is “Hokkaido”, the □ button 208 of the controller 105 corresponding to the “□” of the selection mark 403d is pressed.

  Typically, when the option 402 selected by the player is a correct answer, for example, the score 404 displayed on the upper right in the game screen 400 in FIG. 4 is added, and when the option is not a correct answer, a score is obtained. 404 is not added, and the score as it is is maintained or deducted. In the game apparatus 300 according to the present embodiment, such selection questions are displayed in order, such as the first question and the second question, and each time the player selects an option 402 that seems to be the correct answer, the correct answer The more you have, the higher the score and the more you play the game.

  In the game apparatus 300 that presents and answers a selection question to such a player in the present embodiment, the save unit 301 saves the game state and the answer history of the player. That is, in order to allow the player to temporarily suspend the game and then resume the game from the point of interruption, information such as how many questions have been answered and the current score 404 is displayed. The included game state is saved in the storage unit 304 configured by the external memory 106, for example. Here, at this time, the player's answer history, that is, the option 402 answered (selected) by the player for the selection question presented up to the time of saving is also saved at the same time. Hereinafter, it will be specifically described with reference to FIG. 5A.

  FIG. 5A is a diagram illustrating a state in which the game is saved and interrupted after the player answers the last answer in the present embodiment. As in FIG. 4, a “question 15” selection question sentence 401 and four choices 402 a to 402 d are displayed on the game screen 400. Here, in this figure, the player selects the option 402a “Tokyo” from the four options 402a to 402d (highlighted with a thick frame), and then saves the game and interrupts the game. Is shown.

  Such saving may be performed by the player instructing to save according to his / her own intention, or may be automatically saved (auto-save). Typically, each time the answer to the selection question is completed, the options 402 answered (selected) by the player are automatically and sequentially saved together with the game state as the player's answer history.

  When saving is performed in this way, the saving unit 301 saves the player's answer history in the storage unit 304 together with the current game state. For example, in FIG. 5A, the current game state means that the player answers up to the fifteenth question immediately before saving, the value of the score 404 at that time, etc. It is information necessary to be able to resume. The player's answer history that is saved at the same time is an option 402 that the player answers (selects) the selection question presented before saving. When the game is loaded to resume the game, the generation unit 302 generates an option that matches the history and an option that does not match the history in order to generate a load problem using the saved answer history. Specifically, this will be described with reference to FIGS. 5B and 5C.

  FIG. 5B is a diagram illustrating a state in which an option that matches the history is acquired from the history of the answer of the player in the present embodiment. In this figure, the answer from the first question to the fifteenth question (that is, the option 402a “Tokyo” selected in FIG. 5A) is shown as the answer history of the player. That is, here, the player shows a situation in which the player answers the 15-question question before interrupting the game, and the history of the answer is saved in the storage unit 304 in this manner. .

  FIG. 5B shows a state in which the last option selected by the player is acquired from the 15 answers. That is, in the present embodiment, among the answers to the 15 questions selected by the player, the option 402a selected as “Tokyo” at the end is the option that matches the history.

  Note that the option that matches the history is not limited to the option 402 selected last by the player, for example, the option 402 that is selected earliest or the option 402 that is the answer that determines the outcome of the game. Any characteristic option 402 may be used. In this case, the generation unit 302 acquires such a characteristic option 402 as an option matching the history from the saved player answer history.

  FIG. 5C is a diagram illustrating a situation in which a task is presented during loading in the present embodiment. This figure shows a state after the game is interrupted in the state of FIG. 5A described above. First, in order to restart the interrupted game, the player starts an instruction to load the game.

  When a load instruction is given, the load unit 303 presents a load problem by combining options 502 that match one history and options 503a to 503c that do not match three histories. That is, as shown in FIG. 5B described above, as the option 502 that matches the history, the option 402a “Tokyo” that is the option that the player last selected from the answer history is acquired. Then, one option “Tokyo” and three other options (options that do not match the history) are combined. As a result, a loading problem as shown in the game screen 400 of FIG. 5C is presented.

  In the game screen 400 of FIG. 5C, a question “What did you choose last?” Is displayed as a load question sentence 501 at the top. As options corresponding thereto, an option 502 (here “Tokyo”) matching one history and options 503a to 503c (here “Kirin”, “apple”, “ "Pencil") is displayed at the bottom of the game screen 400.

  Further, selection marks 403a to 403d are arranged on the left side of these four options 502 and 503a to 503c. These selection marks 403a to 403d represent the figures “O”, “X”, “Δ”, and “□” as in FIG. 4, and the O button 205, X button 206, and Δ of the controller 105, respectively. The button 207 and the square button 208 are associated with each other. The player selects what appears to be correct with respect to the displayed load question sentence 501 from the displayed four choices 502, 503a to 503c, and associates them with the respective choices 502, 503a to 503c. The buttons 205 to 208 of the controller 105 corresponding to the selected selection marks 403a to 403d are pressed.

  In FIG. 5C, among the four options 502 and 503a to 503c, the option 502 matching the history is arranged at the top, but this is an example, and the option 502 may be arranged second from the top. It can be equally probable that it is arranged third from the top or arranged at the bottom. It is usually determined randomly at which of these four positions the option 502 that matches the history is arranged.

  In a state where such a load problem is presented, if the option selected by the player is the option 502 matching the history, that is, the option “Tokyo”, the saved game state is loaded. On the other hand, if the option selected by the player is any of the options 503a to 503c that do not match the history, that is, “Kirin”, “Apple”, and “Pencil”, the game state is not loaded in this embodiment.

  That is, if the player who is trying to load is the same player as the player who saved, it is normal that the option 502 matching the history, that is, the last selected option was “Tokyo”. It is supposed to remember, so it should be able to load. On the other hand, if the player trying to load is not the same player as the player who saved, it cannot be determined which is the option 502 that matches the history. Therefore, the option 502 that matches this history serves as a kind of password, and can prevent another person's save data from being loaded.

  In the present embodiment, a plurality of selection questions are prepared in advance, and the generation unit 302 generates the options 503a to 503c that are extracted from the options 402 associated with the prepared selection questions and do not match the history. You may do it.

  That is, “Kirin”, “Apple”, and “Pencil”, which are the options 503a to 503c that do not match the history in FIG. 5C, are not generated at all, but are prepared in advance as game data and sequentially presented to the player. Suppose that it is extracted from the options 402 constituting the selection problem to be performed. A plurality of selection problems are prepared here, and are recorded in advance on a DVD-ROM mounted on the DVD-ROM drive 108 together with various data for realizing the game.

  For example, if 100 selection questions composed of four options 402a to 402d and a selection question sentence 401 are prepared in advance, 400 options 402 are stored in the DVD-ROM. At this time, if, for example, the player has selected the options 402 one by one for the selection question of 10 questions in the previous play, these 10 options 402 are included in the history as options 502 that match the history. The candidate 503a-503c which does not match is excluded from the candidates. That is, the generation unit 302 extracts the options 503a to 503c that do not match the history from the remaining 390 options 402.

  With such a configuration, it is possible to save the trouble of generating the options 503a to 503c that do not match the history for presenting the load problem.

  Furthermore, in this embodiment, each of the choices 402 associated with a plurality of selection questions prepared is classified into one of a plurality of groups, and the generation unit 302 classifies the last selected choice 402. The options 503a to 503c that do not match the history may be generated by extracting from the other options 402 classified into the group.

  That is, the options 402 are grouped into a group of similar options 402 such as those classified as “fruit”, those classified as “animal”, and those classified as “stationery”, for example. Classify. Then, the options 503a to 503c that do not match the history are selected from those that are classified into the same group as the option 402 that is selected last (the option 502 that matches the history).

  FIG. 6 is a diagram illustrating a state in which the options 402 are classified into a plurality of groups in the present embodiment. In this figure, four groups are shown: a group 601a representing “prefecture”, a group 601b representing “fruit”, a group 601c representing “animal”, and a group 601d representing “stationery”. The “prefecture” group 601a is classified into options 402 such as “Hokkaido”, “Tokyo”, “Aichi”, and the “fruit” group 601b includes “apple”, “mandarin orange”, “grape” , Etc., and “Animal” group 601c is classified into “Kirin”, “Hippo”, “Rabbit”, etc., and “Stationery” group 601d includes “Pencil”, “Eraser”. ”,“ Protractor ”, etc. are classified.

  In FIG. 6, four groups 601a to 601d are shown as groups into which the option 402 is classified. However, in the present embodiment, the number is not limited to four and may be classified into any number of groups.

  Here, for example, when the option 502 matching the history (for example, the option 402 selected last by the player) is the option 402 “Tokyo”, the group into which the option 402 “Tokyo” is classified is In FIG. 6, it is classified into a “prefecture” group 601a. Therefore, the options 503a to 503c that do not match the history for configuring the load problem are also extracted from the options 402 classified into the “prefecture” group 601a. This will be described with reference to FIG.

  FIG. 7 is a diagram illustrating a situation in which, in the present embodiment, a problem composed of options 402 classified into the same group is presented at the time of loading. This figure is basically the same as the situation where the load problem shown in FIG. 5C is presented. After the game is interrupted in the state shown in FIG. 5A, the player can restart the interrupted game. Begins with an instruction to load the game. Then, the load unit 303 combines the option 502 that matches one history (here, the option 402 selected last by the player) and the options 503a to 503c that do not match three histories, as shown in FIG. A loading problem as shown in the game screen 400 is presented.

  However, in FIG. 5C, “Tokyo” that is an option 502 that matches the displayed history and “Kirin”, “apple”, and “pencil” that do not match the history are connected to each other. The options 402 do not have any. However, in FIG. 7, “Tokyo”, which is an option 502 that matches the displayed history, and “Aichi Prefecture”, “Kagoshima Prefecture”, and “Osaka Prefecture”, which are the options 503 a to 503 c that do not match the history, are all the same. The options 402 are classified into the “prefecture” group 601a in FIG. In other words, the options 503a to 503c that do not match the history are extracted and generated from the same group as the group 601 into which the options 502 that match the history are classified.

As another example, for example, if the option 502 that matches the history is an “apple” classified in the “fruit” group 601b in FIG. 6, the option 503a that does not match the history configured as a load problem. ˜503c are extracted from the options 402 such as “mandarin orange”, “banana”, “peach”, and the like, which are classified into the same “fruit” group 601b.
Further, for example, when the option 502 matching the history is “Kirin” classified in the “animal” group 601c in FIG. 6, the options 503a to 503c that do not match the history configured as the load problem are the same. It is extracted from the options 402 such as “Hippo”, “Elephant”, “Lion”, etc., classified in the “Animal” group 601c.
Furthermore, for example, when the option 502 matching the history is “pencil” classified in the “stationery” group 601d in FIG. 6, the options 503a to 503c that do not match the history configured as the load problem are the same. It is extracted from the options 402 such as “pencil”, “protractor”, “ruler”, etc., classified in the “stationery” group 601d.

  With such a configuration, the option 502 that matches the history presented as a load problem and the options 503a to 503c that do not match the history are configured by similar options 402 classified into the same group, so the player answers. It will be an appropriate task.

  FIG. 8 is a flowchart showing a flow of game processing according to the game device 300 of the first embodiment of the present invention. The flow of game processing realized in the game apparatus 300 in this embodiment will be described below.

  When the game is started, the game apparatus 300 first displays a selection question after performing various initial settings (step S101). That is, the selection question composed of the selection question sentence 401 and the options 402a to 402d as shown in FIG. 4 described above is displayed on the game screen 400 of the game device 300 by displaying the selection question on the monitor by the image processing unit 107, for example. To do.

  Here, as a method of starting the game, the game is started by loading the data saved in the past by the player through the loading process (FIG. 9) described later, that is, by answering the presented loading problem. Alternatively, the game may be started completely without going through a load process described later, that is, without loading the saved data.

  Next, the game device 300 accepts a selection input from the player (step S102). That is, here, the player selects any one of the choices 402 that are considered to be correct answers to the selection question sentence 401 in the presented selection question. In that case, typically, it selects by pressing any of the buttons 205-208 of the controller 105, and the game device 300 receives the pressing operation.

  Then, game device 300 determines whether the correct answer has been selected based on the received selection input (step S103). That is, it is determined whether or not the correct option 402 is selected by the player among the options 402 constituting the presented selection problem. When it is determined that the correct answer has been selected (step S103; YES), the game device 300 increases the score 404 in the game (step S104). That is, for example, the score 404 displayed at the upper right of the game screen 400 in FIG. On the other hand, when it is determined that the correct answer has not been selected (step S103; NO), the score 404 is not increased. Here, the score 404 may not be changed, or a process of lowering the score 404 may be performed. In other words, if the correct choice 402 is selected for the selection question sentence 401 presented by the player, more points 404 can be earned, but if the correct option 402 cannot be selected, the score 404 cannot be earned.

  Thereafter, the game device 300 saves the option 402 selected by the player in the history (step S105). In other words, the save unit 301 saves the option 402 selected and input in step S102 in the storage unit 304 formed of a storage medium such as the external memory 106, for example. This saved option 402 is used to generate a load problem in a load process (FIG. 9) described later.

  Furthermore, in the game apparatus 300, the save unit 301 saves the current game state (step S106). Here, the state of the game played by the player up to the present time, that is, the information on how many questions have been answered, the acquired score 404, and the like are saved in the storage unit 304 including a storage medium such as the external memory 106, for example. . Here, although it is described that the current game state is automatically saved, in this embodiment, the game is not automatically saved, but is saved when the player issues a save instruction to the game apparatus 300. You may do it.

  Then, the game device 300 determines whether to end the game (step S107). In other words, an input as to whether or not to end the game is accepted from the player, and if the input is to be ended according to the input (step S107; YES), the process ends. On the other hand, when the player inputs that the game is to be continued without ending (step S107; NO), the process returns to step S101. That is, the process proceeds to a process in which the next selection problem is displayed.

  By performing the game process in such a flow, the player answers the selection questions presented one by one, and the save unit 301 of the game apparatus 300 saves the answer history together with the game state. To go. On the other hand, processing when loading is described below with reference to FIG.

  FIG. 9 is a flowchart showing the flow of the loading process related to the game device 300 according to the first embodiment of the present invention. The flow of the load process realized in the game apparatus 300 in this embodiment will be described below.

  In this flowchart, the loading process is normally started by giving an instruction to the game device 300 to load a game that the player has saved in the past in order to resume a game that the player has interrupted in the past.

  When the loading process is started, the game device 300 first loads the player's answer history (step S201). That is, the player's answer history saved in step S105 in FIG. 8 is read. In the player's answer history, for example, information of the options 402 group selected in the play saved by the player is stored.

  Next, based on the read answer history of the player, the generation unit 302 of the game device 300 generates an option 502 that matches the history (step S202). The option 502 that matches the history is, for example, the option 402 that was last selected by the player, the option 402 that was selected the earliest in the saved play, or the selection that determines the outcome of the game. There are various examples. In step S202, an option 502 that matches the history as described above is acquired from the history of the answer of the player, that is, the options 402 selected by the player in the saved play.

  Here, the game device 300 extracts the options 402 classified into the group 601 into which the options 502 matching the history are classified from the options 402 associated with the prepared selection problem (step S203). That is, here, first, the group 601 into which the option 502 matching the history generated in step S202 is classified is specified. Then, the options 402 classified into the specified group 601 are extracted from the options 402 constituting the selection problem that can be presented in the game. For example, if there are 12 options 402 classified into the group 601 into which the options 502 matching the history are classified among the 80 options 402 constituting the selection problem that can be given in the game, here, these 12 options The option 402 is extracted.

  Then, based on the extracted option 402, the generation unit 302 of the game device 300 generates an option 503 that does not match the history (step S204). That is, here, for example, when it is necessary to generate three options 503 that do not match the history, three are selected and generated from the 12 options 402 extracted in the above example. .

  Here, the game device 300 generates a load problem from the option 502 that matches the history and the option 503 that does not match the history (step S205). That is, for the load problem sentence 501, a load problem is generated by combining the option 502 that matches the history generated in step S202 and the option 503 that does not match the history in step S204.

  Then, the loading unit 303 of the game device 300 displays the generated loading problem (step S206). That is, by displaying the load problem composed of the load problem sentence 501 as shown in FIG. 7 and the corresponding options 502, 503a to 503c on the monitor by the image processing unit 107, for example, It is displayed on the game screen 400.

  Next, the game device 300 accepts a selection input from the player (step S207). That is, here, one of the presented load problem options 502, 503a to 503c is selected as one that seems to be an option 502 that matches the player history. In that case, typically, it selects by pressing any of the buttons 205-208 of the controller 105, and the game device 300 receives the pressing operation.

  Then, based on the accepted selection input, game device 300 determines whether option 502 that matches the history has been selected (step S208). If it is determined that the option 502 that matches the history is selected (step S208; YES), the game state is loaded (step S209), and the game is started (step S210). That is, the player can resume the interrupted game safely.

  On the other hand, if it is determined that the option 502 that matches the history has not been selected (step S208; NO), this flowchart displays that it cannot be loaded (step S211) and ends. That is, the player has failed to resume the interrupted game.

  With this configuration, in this embodiment, the option 502 matching the history is used as a so-called password, so that the player can be prevented from loading other people's data. In the present embodiment, the player selects an easy-to-understand password for the player by making the option 502 that matches the history the option 402 that is likely to remain in the player's impression, such as the option 402 last selected by the player at the time of saving. It can be used without having to set. As a result, it is possible to comfortably prevent the player from loading another person's data.

(Embodiment 2)
Next, Embodiment 2 of the present invention will be described. In the first embodiment, the game state cannot be loaded when the player cannot select the option 502 that matches the history at the time of loading. In the present embodiment, even when the player cannot select the option 502 that matches the history during loading, the game state can be loaded, but at that time, the score 404 of the game is reduced.

  That is, in this embodiment, the save unit 301 saves the game state including the score 404, and the load unit 303 displays the saved game state when the option 502 matching the history is not selected by the player. The score 404 is decreased and loaded. Hereinafter, this will be specifically described with reference to FIG.

  FIG. 10 is a diagram showing a state where the score 404 is decreased and loaded in the present embodiment. First, FIG. 10A shows a state in which a load problem is presented by a player instructing a load in order to resume a game that has been interrupted, as in FIG. 5C described above. Here again, as in FIG. 5C, a load question sentence 501 “What did you choose last?”, An option 502 (here “Tokyo”) that matches one history, and three Options 503 a to 503 c (here, “Kirin”, “Apple”, “Pencil”) that do not match the history are displayed in the game screen 400.

  In this state, FIG. 10A shows a state where the player selects an option 503a that does not match the history “Kirin” (displayed with a thick frame). That is, here, the player selects the option 502 that matches the history because he / she does not know or forgot that the option selected last before the game was interrupted was “Tokyo”. Indicates a situation that did not exist. At this time, the game is loaded in a state as shown in FIG.

  FIG. 10B is the same as the game screen 400 in which the “15th question” selection question is presented to the player shown in FIG. 4 and FIG. 5A described above. As a selection question of the “question”, a selection question sentence 401 “What is the most populous prefecture in Japan?” And four corresponding options 402a to 402d are displayed. Then, selection marks 403a to 403d corresponding to the options 402a to 402d are displayed, respectively, and a score 404 is displayed on the upper right in the game screen 400.

  However, in FIG. 10B, the score 404 is reduced to “0 point” (the portion surrounded by the dotted line). That is, in FIG. 4 and FIG. 5A immediately before the game is interrupted, the score 404 shown in the game screen 400 is “1240 points”, but in FIG. Since it was not selected, the score 404 was decreased and the game resumed.

  In this embodiment, when the score 404 is decreased, the score 404 may be set to “0 point” as shown in FIG. 10, or may not be uniformly set to “0 point” but 100 points from the score 404 at the time of interruption. It is also possible to reduce the number of points, for example, by halving the score 404 at the time of interruption.

  FIG. 11 is a flowchart showing the flow of the loading process according to the game apparatus 300 of the present embodiment. The flow of the load process realized in the game apparatus 300 in this embodiment will be described below.

  The flowchart in this figure basically follows the flowchart (FIG. 9) of the load process in the first embodiment, but the flow after NO is determined in step S208 is different (dotted line portion in FIG. 11). On the other hand, when it is determined in step S208 that the option 502 matching the history is selected from the player, the load process of the present embodiment is the same as the load process of the first embodiment described above. That is, in the processing in steps S201 to S210, as in the above-described first embodiment, after reading the player's answer history, the option 502 matching the history and the option 503 not matching the history are generated, and the load problem Is displayed, and when the option 502 matching the history is selected from the player, the game state is loaded and the game is started.

  On the other hand, when it is determined in step S208 that the option 502 matching the history is not selected from the player (step S208; NO), in the present embodiment, unlike the first embodiment, first the game state is loaded. (Step S301). Then, the score 404 included in the loaded game state is decreased (step S302), and the game is started (step S210). In other words, in the present embodiment, the game state is loaded for the presented load question sentence 501 regardless of whether the player selects the option 502 that matches the history. However, when the option 502 matching the history is not selected from the player, the score 404 is decreased and the game is restarted, for example, the score 404 is set to “0” in FIG. 10 described above. That is, the game is resumed with a so-called penalty imposed on the player.

  With such a configuration, in the second embodiment, strict security up to preventing other people's save data from being loaded is not provided, and by imposing a penalty, the player's motivation is reduced, so that the other person's save data is saved. It can be used to exert a deterrent against advancing the game illegally.

(Embodiment 3)
Next, a third embodiment of the present invention will be described. In the first and second embodiments, the problem presented to the player is a selection problem that causes a correct option to be selected from a plurality of options, and assumes a so-called quiz / brain training game. In the present embodiment, description will be made on the assumption of a so-called karaoke game that presents a task for a player to sing a song instead of a quiz / brain training game that presents such a selection problem as a task.

That is, the game apparatus 300 in the present embodiment is a game apparatus 300 that presents to a player a task to be answered by making a song sing.
The save unit 301 saves the game state and the history of song names answered by the player singing,
When the save unit 301 saves, the generation unit 302 generates an option 502 that matches the history and an option 503 that does not match the history,
The loading unit 303 presents an option 502 that matches the generated history and an option 503 that does not match the history, and loads the saved game state when the player selects the option 502 that matches the history. .

  FIG. 12 is a diagram illustrating a situation in which a task is presented to the player in the present embodiment. The game apparatus 300 according to the present embodiment presents a game to sing a song to the player by displaying a game screen 400 as shown in the figure on a monitor through the image processing unit 107, for example.

  In FIG. 12, a song selection instruction 1201 is displayed at the top of the game screen 400, and a plurality of song names 1202a to 1202c are displayed at the bottom. Specifically, the song selection instruction 1201 prompts the player to select a song by displaying a sentence “Please select a song name you want to sing”. The player selects a song he / she wants to sing from among the displayed song names 1202a to 1202c in accordance with the music selection instruction 1201.

  In FIG. 12, the frame of “AAA” of the song name 1202b is highlighted thickly. For example, when the player presses the ○ button 205 of the controller 105 in this state, the song name 1202b of “AAA” is selected. It will be. This bold frame highlight is moved up and down by pressing the ↑ button 201 and the ↓ button 202 of the controller 105, and “ZZZ” of the song name 1202a arranged above and below “AAA” of the song name 1202b. And “BBB” of the song name 1202c can be selected.

  Here, in FIG. 12, only three song names 1202 a to 1202 c are displayed in the game screen 400, but usually more song names 1202 can be selected. For example, in FIG. 12, when the highlight is on the song name 1202a or the song name 1202c, when the ↑ button 201 or the ↓ button 202 of the controller 105 is further pressed, the displayed song names 1202 are all in the game screen 400. May be scrolled to display another song name 1202.

  Note that the music selection method performed through the game screen 400 as shown in FIG. 12 is an example, and the present embodiment is not limited to this. For example, instead of displaying a screen such as the game screen 400 on the monitor, the player may select a song by inputting a number associated with the song name so that the player can see it on a general karaoke apparatus.

  With such a configuration, the player selects a song name 1202 that the player sings according to the displayed music selection instruction 1201. The game apparatus 300 of the present embodiment saves the song name 1202 selected in this way as a history, and generates an option 502 that matches the history and an option 503 that does not match the history based on the history. Then, the loading problem constituted by them is presented when the player loads the game thereafter. Hereinafter, a description will be given with reference to FIGS. 13A and 13B.

  FIG. 13A is a diagram showing a state in which an option that matches the history is acquired from the history of the song name selected by the player in the present embodiment. In this figure, as the history of the song name selected by the player, the song names from the first song to the fifth song and the score obtained when singing each song are displayed. That is, the situation here is a situation in which the player selects and sings five song names before interrupting the game, and the history is saved in the storage unit 304 in this manner.

  And in FIG. 13A, the song name which is the highest score is acquired from among the song names of such five songs. That is, in this embodiment, the song name “AAA”, which is the highest score (here, 100 points) among the five question song names selected by the player, is the option 502 that matches the history.

  FIG. 13B is a diagram illustrating a situation in which a task is presented at the time of loading in the present embodiment. This figure is basically the same as the loading problem shown in FIG. 5C. After the game is interrupted, the player loads the game to resume the interrupted game. Start from giving instructions to do. Then, as shown in FIG. 13A described above, the load unit 303 acquires the song name “AAA” that has the highest score from the history as an option 502 that matches the history. Then, one option “AAA” is combined with three other options (options that do not match the history). As a result, a loading problem as shown in the game screen 400 of FIG. 13B is presented.

  In the game screen 400 of FIG. 13B, a question “What is the song name with the highest score among the songs you sang last time?” Is displayed as a load question sentence 501 at the top. As options corresponding thereto, an option 502 (here “AAA”) that matches one history, and options 503a to 503c (here “XXX”, “YYY”, “ZZZ”) that do not match three histories. ") Is displayed at the bottom of the game screen 400.

  In the present embodiment, the option name 502 that matches the history may be the song name 1202 that gives the highest score, and is not limited to this, and the song name 1202 that is likely to remain in the player's impression is displayed by the player. The last selected song name 1202 or the song name 1202 with the lowest score may be used.

  The player selects the one that seems to be correct (the option 502 that matches the history) from the four options 502 and 503a to 503c for the load problem sentence 501, and the associated selection marks 403a to 403d. Is selected by pressing the buttons 205 to 208 of the controller 105 corresponding to. When the option 502 that matches the history is selected, the load unit 303 loads the saved game state.

  In the present embodiment, each of the song names 1202 is classified into one of a plurality of groups 601, and the generation unit 302 is classified into a group 601 into which song names 1202 that are options 502 matching the history are classified. Alternatively, an option 503 that does not match the history may be generated by extracting from other song names 1202. That is, the option 502 that matches the history constituting the load problem and the options 503a to 503c that do not match the history may be similar to each other that are classified into the same group 601. Here, when classifying the song name 1202 into the group 601, for example, it may be classified by genre such as Japanese music, Western music, popular song, etc., or may be classified by the singer of the song name 1202, etc. There are various methods of classification.

  The flow of the game process and the load process in Embodiment 3 as described above will be described below with reference to flowcharts (FIGS. 14 and 15). Here, the configuration of the flowcharts of FIGS. 14 and 15 is similar to the flowcharts (FIGS. 8 and 9) describing the game process and the load process in the first embodiment described above, but will be described again here.

  FIG. 14 is a flowchart showing a flow of game processing according to the game device 300 of the third embodiment of the present invention. The flow of game processing realized in the game apparatus 300 in this embodiment will be described below.

  When the game is started, the game apparatus 300 first displays a selection screen for the song name 1202 after performing various initial settings (step S401). That is, the game screen 400 configured by the music selection instruction 1201 and the song names 1202a to 1202c as shown in FIG. 12 is displayed on the monitor through the image processing unit 107, for example, and presented to the player.

  Here, as a method of starting the game, even if the game is started by loading the data saved in the past by passing through a loading process (FIG. 15) described later, that is, by answering the presented loading problem. Alternatively, the game may be started completely without going through a load process described later, that is, without loading the saved data.

  Next, the game device 300 accepts a selection input from the player (step S402). That is, the player selects one song name 1202 to be sung for the presented music selection instruction 1201.

  And the game device 300 raises a score based on a player's singing content (step S403). That is, here, the player sings the selected song name 1202, and the game apparatus 300 uses the provided microphone 111 or the like to capture the player's singing sound and the degree to which the player sings according to the pitch of the selected song. Determine. If the degree is high, the score is raised, otherwise the score is not raised. That is, if a player can sing well, he can get a high score, otherwise he cannot get a high score.

  Thereafter, the game device 300 saves the song name 1202 selected by the player in the history (step S404). That is, the save unit 301 saves the song name 1202 selected and input in step S402 in the storage unit 304 formed of a storage medium such as the external memory 106, for example. The saved song name 1202 is used to generate a load problem in a load process (FIG. 15) described later.

  Furthermore, in the game device 300, the save unit 301 saves the current game state (step S405). Here, the state of the game played by the player up to the present time, that is, information on how many songs have been sung, the score obtained, and the like are saved in the storage unit 304 formed of a storage medium such as the external memory 106, for example. Here, although it is described that the current game state is automatically saved, in this embodiment, the game is not automatically saved, but is saved when the player issues a save instruction to the game apparatus 300. You may do it.

  Then, the game device 300 determines whether to end the game (step S406). In other words, an input as to whether or not to end the game is received from the player, and if the input is to be ended in accordance with the input (step S406; YES), the process ends as it is. On the other hand, when the player inputs that the game is to be continued without ending the game (step S406; NO), the process returns to step S401. That is, the process proceeds to a process in which a selection screen for the next song name 1202 is displayed.

  By performing the game process in such a flow, the player selects the song name 1202 one by one and sings the song, and the save unit 301 of the game apparatus 300 stores the history of the selected song name 1202 in the game state. Save with. On the other hand, processing when loading is described with reference to FIG.

  FIG. 15 is a flowchart showing the flow of the loading process related to the game device 300 according to the third embodiment of the present invention. The flow of the load process realized in the game apparatus 300 in this embodiment will be described below.

  In this flowchart, the loading process is normally started by giving an instruction to the game device 300 to load a game that the player has saved in the past in order to resume a game that the player has interrupted in the past.

  When the loading process starts, first, the game device 300 loads the history of the song name 1202 selected by the player (step S501). That is, the history of the song name 1202 selected by the player saved in step S404 in FIG. 14 is read. In the history of the song name 1202 selected by the player, for example, information of the song name 1202 group sung in the play saved by the player is stored.

  Next, based on the history of the song name 1202 selected by the read player, the generation unit 302 of the game device 300 generates an option 502 that matches the history (step S502). The choice 502 that matches the history is, for example, the song name 1202 that was last sung by the player, or the song name 1202 that earned the highest score in the saved play, and various examples are considered. It is done. In step S502, an option 502 that matches the history as described above is acquired from the history of the song name 1202 selected by the player, that is, from the group of song names 1202 sung by the player in the saved play.

  Here, the game device 300 extracts the song names 1202 classified into the group 601 into which the choices 502 matching the history are classified from the prepared song names 1202 (step S502). That is, here, first, the group 601 into which the option 502 matching the history generated in step S502 is classified is specified. And the song name 1202 classified into the specified group 601 is extracted from the song name 1202 group which a player can select in a game. For example, among the song names 1202 that can be selected by the player in the game, if there are twelve song names 1202 classified into the group 601 into which the options 502 matching the history are classified, these twelve song names 1202 are here. Extracted.

  Then, based on the extracted song name 1202, the generation unit 302 of the game device 300 generates an option 503 that does not match the history (step S504). That is, here, for example, when it is necessary to generate three choices 503 that do not match the history, three are selected and generated from the twelve song names 1202 extracted in the above example. Become.

  Here, the game device 300 generates a load problem from the option 502 that matches the history and the option 503 that does not match the history (step S505). That is, for the load problem sentence 501, a load problem is generated by combining the option 502 that matches the history generated in step S502 and the option 503 that does not match the history in step S504.

  Then, the loading unit 303 of the game device 300 displays the generated loading problem (step S506). That is, the load problem composed of the load problem sentence 501 and the choices 502 and 503a to 503c as shown in FIG. 13B described above is displayed on the game screen 400 of the game apparatus 300 by passing the monitor through the image processing unit 107, for example. Present by displaying.

  Next, the game device 300 accepts a selection input from the player (step S507). That is, here, one of the presented load problem options 502, 503a to 503c is selected as one that seems to be an option 502 that matches the player history. In that case, typically, it selects by pressing any of the buttons 205-208 of the controller 105, and the game device 300 receives the pressing operation.

  Then, the game device 300 determines whether the option 502 that matches the history is selected based on the accepted selection input (step S508). If it is determined that the option 502 matching the history is selected (step S508; YES), the game state is loaded (step S509), and the game is started (step S510). That is, the player can resume the interrupted game safely.

  On the other hand, if it is determined that the option 502 that matches the history has not been selected (step S508; NO), the flowchart displays that loading is not possible (step S511) and ends. That is, the player has failed to resume the interrupted game.

  With such a configuration, in the third embodiment, in the karaoke game in which the player sings a song, the player loads the other person's data by using the option 502 that matches the history of the song name sung by the player as a so-called password. Can be prevented.

  In this embodiment, when it is determined that the option 502 matching the history has not been selected (step S508; NO), it may not be loaded as described above, or as in the second embodiment. The game may be loaded with a reduced score.

  In the first and second embodiments, a quiz / brain training game is assumed and a karaoke game is assumed in the third embodiment. However, in the present invention, the game is not limited to games of these genres. Any game may be used as long as it presents and answers a task. For example, in an action game or a shooter game, a stage (issue) is presented to the player and cleared (answered). For example, in a role-playing game or a simulation game, a boss character (issue) is presented to the player. The present invention can be applied by defeating (answering) it.

  As described above, it is possible to provide a game device, a game device control method, and a program suitable for preventing the player from loading other people's data.

100 Information processing apparatus 101 CPU
102 ROM
103 RAM
104 Interface 105 Controller 106 External Memory 107 Image Processing Unit 108 DVD-ROM Drive 109 NIC
110 Audio processing unit 111 Microphone 201 ↑ button 202 ↓ button 203 ← button 204 → button 205 ○ button 206 × button 207 Δ button 208 □ button 209 SELECT button 210 START button 211 ANALOG button 212 indicator 213 joystick 214 joystick 215 L1 button 216 L2 button 216 L2 Button 217 R1 button 218 R2 button 300 Game device 301 Save unit 302 Generation unit 303 Load unit 304 Storage unit 400 Game screen 401 Selection question sentence 402 (402a to 402d) Option 403 (403a to 403d) Selection mark 404 Score 501 Load problem sentence 502 Options matching the history 503 (503a to 503c) Options not matching the history 601 601a~601d) Group 1201 music selection directive 1202 (1202a~1202c) song name

Claims (7)

A game device for presenting and answering a task to a player,
A save section for saving the game state and the player's answer history;
When saved by the save unit, a generation unit that generates an option that matches the history and an option that does not match the history,
A load unit that presents options that match the generated history and options that do not match the history, and loads the saved game state when an option that matches the history is selected by the player A game apparatus comprising: The game device according to claim 1,
The problem is a selection problem that allows a correct option to be selected from a plurality of options.
The option that matches the history is the option that was last selected by the player.
A game device characterized by that. The game device according to claim 2,
A plurality of the selection questions are prepared in advance,
The generating unit extracts from the options associated with the plurality of prepared selection questions, and generates an option that does not match the history,
A game device characterized by that. The game device according to claim 3,
Each of the options associated with the plurality of prepared selection questions is classified into one of a plurality of groups,
The generation unit extracts from the other options classified into a group into which the last selected option is classified, and generates an option that does not match the history,
A game device characterized by that. The game device according to any one of claims 1 to 4, wherein:
The save unit saves the game state including the score,
The loading unit loads the saved game state with the score reduced when an option that matches the history is not selected by the player.
A game device characterized by that. A control method that is executed by a game device including a save unit, a generation unit, and a load unit that presents and answers a task to a player,
A save step in which the save unit saves the game state and the answer history of the player;
When the generation unit is saved by the save unit, a generation step of generating an option that matches the history and an option that does not match the history,
The saved game state when the load unit presents an option that matches the generated history and an option that does not match the history, and an option that matches the history is selected by the player A control method comprising: a loading step of loading A program that causes a computer to function as a game device that presents and solves a problem to a player,
The program is for the computer,
A save section for saving the game state and the player's answer history;
When saved by the save unit, a generation unit that generates an option that matches the history and an option that does not match the history,
A load unit that presents options that match the generated history and options that do not match the history, and loads the saved game state when an option that matches the history is selected by the player A program characterized by functioning as

Images