JP4620719B2 - GAME DEVICE AND COMPUTER PROGRAM - Google Patents

Description

  The present invention relates to a game device and a computer program.

There has been proposed a game apparatus in which a battle type mini-game is executed when two opponents play a card game as a main game and the card game is determined to win or lose (see Patent Document 1). In this conventionally known game device, as many fighting mini-games as the number of card types are provided.
JP 2007-75576 A

  However, in the conventional game device, information such as which mini-game the player and his / her opponent are advantageous or disadvantageous is not clearly shown, and therefore, a device is devised based on such information. It was not such a game device.

  That is, when a mini game is played in response to a predetermined condition being satisfied during the main game, the main game is played in consideration of the relationship between the support character assigned to the mini game and the mini game. It was not intended to provide a display.

  In view of such a problem, the present application considers the relationship between the support character assigned to the mini game performed in response to the predetermined condition being satisfied during the main game of the game and the mini game, and the main character. An object is to propose an improved technique for providing a display for playing a game.

The present invention corresponding to one aspect for solving the above problem is a game device having a display unit and a control unit,
Character storage means for storing a plurality of character data representing characters used in the game;
Main character reading means for reading out character data as a main character from the character storage means in accordance with a player's selection;
A support character reading means for reading out character data as a support character from the character storage means according to a player's selection;
Main character storage means for storing character data read by the main character reading means as main character data;
Support character storage means for storing the character data read by the support character reading means as support character data;
When executed by the control unit, a main game program for executing a main game using main character data and support character data stored in the main character storage unit and the support character storage unit, and the control unit Program storage means for storing a first mini game program for executing a first mini game by being executed and a second mini game program for executing a second mini game by being executed by the control unit When,
Main game execution means for reading out the main game program from the program storage means and using the main character data and support character data stored in the main character storage means and the support character storage means;
Whether the first condition for executing the first mini game or the second condition for executing the second mini game is satisfied while the main game is being executed by the main game executing means. Mini-game execution determination means for determining whether or not
When the mini game execution determining means determines that the first condition is satisfied, the first mini game program is read from the program storage means, the first mini game is executed, and the second condition is satisfied. When it is determined, mini game execution means for reading the second mini game program from the program storage means and executing the second mini game;
A game device comprising:
The character storage means, when the character data is read as a main character, the support character represented by the support character data stored in the support character storage means as a first mini game or a second Stored as containing association data to determine which of the minigames to associate with,
The main game execution means includes a support character stored in the support character storage means based on association data included in main character data stored in the main character storage means, and the first mini game or the second mini game. Display the association on the display so that the player can recognize it,
The mini game executing means associates the support character stored in the support character storage means with the currently executed mini game based on the association by the association data included in the main character data stored in the main character storage means. Association determination means for determining whether or not
When it is determined by the association determining means that the support character stored in the support character storage means is associated with the currently executed mini game, a process for preferentially treating the player in the currently executed mini game is performed. It is characterized by comprising preferential means.

  According to the present application, the main character is played while taking into consideration the relationship between the support character assigned to the mini game that is performed in response to the predetermined condition being satisfied during the main game and the mini game. By providing the display, a more strategic game device can be provided.

  Preferred embodiments of the present invention will be described below in detail with reference to the accompanying drawings.

  A basic configuration of the game apparatus 100 in the present embodiment is shown in FIG. The CPU 101 controls the entire game apparatus 100 using programs, data, and the like stored in a RAM (Random Access Memory) 102 and a ROM (Read Only Memory) 105, and controls the progress of the game corresponding to this embodiment. To do. The RAM 102 includes an area for reading the game program 111 and game data 112 stored in the internal storage device 110, and also includes a work area used when the CPU 101 executes various processes. In the present embodiment, the main game will be described as a game in which win / loss determination is performed using three types of selection targets in which relative superiority or inferiority is cyclically determined in advance, such as janken.

  The operation unit 103 functions as an input unit that receives input from a player (user). The operation unit 103 may be configured to accept inputs from a plurality of players. For example, when receiving input from two players, a group of buttons for receiving input for each player is prepared.

  In addition, the operation unit 103 corresponds to at least three types of selection targets in which a relative superiority or inferiority relationship is cyclically determined in advance, such as “goo”, “choki”, and “par” for each player. It is desirable that a selection button is provided. In the present embodiment, such buttons are referred to as goo button 103a, choki button 103b, and par button 103c, respectively. Note that these buttons may be arranged as dedicated buttons, or may be assigned to each selection target to a plurality of operation buttons included in the operation unit 103 when the game is executed. Note that “goo”, “choki”, and “par” as selection objects are merely examples, and the selection is limited to three as long as the relative dominance relationship is cyclically determined in advance. It is not a thing. For example, the relative superiority or inferiority relationship may be set cyclically for three selection targets such as “kick”, “punch”, and “throw technique”.

  The communication I / F (interface) 104 functions as an I / F for connecting to another game device via a cable or for connecting to the Internet or a LAN (local area network). The ROM 105 stores a program (for example, a boot program of the game apparatus 100, a main game program, a mini game program) and data (for example, setting data of the game apparatus 100, characters used in the game) for controlling the entire game apparatus 100. Character data representing) and the like are stored. That is, the ROM 105 functions as character storage means and program storage means. The display unit 106 includes a CRT or a liquid crystal screen as display means for displaying screen information, and displays a screen related to the game (a screen during the game and a screen for performing various settings in the game).

  The sound processing unit 107 generates BGM and sound effects based on the sound data included in the game data 112 and outputs the generated BGM and sound effects to the speaker 108.

  The internal storage device 110 is configured by a storage device capable of writing and reading, such as a hard disk and a flash memory, and stores the above-described game program 111 and game data 112. The data stored here is read out to the RAM 102 as necessary. The game program 111 is a program for controlling the entire game, and includes at least a main game program and two or more mini game programs.

  The game data 112 includes data for generating an image of each object (character, character, background screen, etc.) constituting the game screen, the above-described sound data, various parameters, and the like. That is, it includes character data representing characters used in the game. When a player tries to execute an online game by connecting the game apparatus 100 to a network, the game program 111 and the game data 112 are downloaded from a predetermined server on the network that provides the game program. Includes game programs and data.

  The card reader 113 is card information reading means for reading, for example, information recorded on a card held by the player. The card reader 113 may be configured to be able to acquire card information from a plurality of players. For example, when acquiring card information from two players, a card reader for reading the card information is prepared for each player.

  The card 114 is a card on which information that can be used when a game is executed is recorded. Reference numeral 109 denotes a bus connecting the above-described units. Processing executed in the game device 100 according to this embodiment having the above-described configuration will be described below.

  FIG. 2 is a flowchart of processing corresponding to the embodiment of the present invention. The processing corresponding to the flowchart shown in FIG. 2 is realized by the CPU 101 executing the game program 111 stored in the internal storage device 110 read into the RAM 102. Since the game program 111 includes a main game program and a mini game program, the CPU 101 functions as a main game execution means and a mini game execution means.

  In FIG. 2, in step S <b> 201, information recorded on the card 114 presented by the player is read using the card reader 113. The reading process in step S201 will be described later in detail with reference to FIG. In step S202, a map screen to be displayed on the screen is selected based on the information recorded on the card 114. A plurality of pieces of information on the map screen are included in the game data 112, and a map can be selected according to the information read from the card 114.

  For example, it is assumed that ten types of map screens are registered in the game data 112, ten types of identification information for selecting a map are set, and one of them is recorded on the card 114. In this case, since the card information read in step S201 includes one of ten types of identification information, a map screen corresponding to the identification information is selected in step S202.

  Next, in step S203, the map screen selected in step S202 is displayed on the display unit. An example of the map screen displayed here is shown in FIG. In FIG. 3, an image 301 of a character operated by the player is displayed on a screen 300. The map is configured by arranging a plurality of icons 302 indicating each event point and connecting each event point 302. On the route connecting the event points 302, any one of the goo icon 303, the choke icon 304, and the par icon 305 is displayed.

  The player can move the character 301 to a desired event point by operating a button according to the displayed icon on the operation unit 103. For example, in order to move the character 301 to the event point immediately above, the par button 103 c corresponding to the par icon 305 may be operated on the operation unit 103. Similarly, when it is desired to move to the lower left, the goo button 103a may be operated, and when it is desired to move to the lower right, the choke button 103b may be operated.

  Returning to FIG. 2, in the subsequent step S204, a moving operation using the operation unit 103 as described above is accepted. Further, in step S205, it is determined whether or not the event point 302 has been determined by operating the determination button included in the operation unit 103 in a state where the character 301 is positioned on any event point 302.

  If the event point 302 is determined (“YES” in step S205), the process proceeds to step S206, and event processing at the event point 302 is executed. In step S207, it is determined whether or not the event processing has ended. If the event processing in step S206 is completed (“YES” in step S207), the process returns to step S203, and the map screen is displayed on the display unit 106 again. On the other hand, if the event process is not completed (“NO” in step S207), the event process in step S206 is continued.

  Next, details of the card information reading process in step S201 will be described with reference to FIG.

  First, in step S401, it is determined whether main card information has been acquired. The “main card” in the present embodiment refers to a card read by the card reader 113 on the first sheet. Each card 114 stores ID information for identifying the card. In step S401, this ID information is acquired as main card information.

  When the ID information is acquired in step S401, in the subsequent step S402, character data corresponding to the ID information (main card information) is extracted from the character table included in the game data 112 as main character data, and stored in the RAM 102. Store. That is, when the CPU 101 executes the game program 111, a main character reading unit that reads character data as a main character from the character storage unit is realized, and the RAM 102 stores the character data read by the main character reading unit. It functions as main character storage means for storing as main character data. An example of the character table is as shown in FIG.

  In FIG. 5, in the character table 500, the ID information 501 recorded on the card 114 and read by the card reader 113, the character name 502 of the character assigned to the ID information, and the basic character necessary for proceeding with the game. The attack power 503, the defense power 504, the physical strength 505, the formation ID 506 for identifying the formation assigned to the character, and the character image 507 are registered. The formation will be described later with reference to FIGS. 7 and 8a. The entries in the table shown here are merely examples, and the present invention is not limited to these. Further, although omitted in FIG. 5, a map ID for selecting a map in step S202 may be further included.

  In this way, in step S402, according to the ID information read from the card 114, character information such as a corresponding character name is extracted from the character table 500 and stored in the RAM 102.

  When the main character information is extracted in step S402, a card information reading screen is displayed on the display unit 106 in step S403. An example of the card information reading screen is as shown in FIG. FIG. 6 is a diagram showing an example of a card information reading screen corresponding to the embodiment of the invention.

  In FIG. 6, on the card information reading screen 600, a character display 601 and a character name display 602 are performed based on the character name 502 and the character image 507 included in the main character information extracted in step S402. In FIG. 6, “character A” is displayed as the character name. Support character name display areas 603, 604, and 605 are areas for displaying support character names when card information of support characters is acquired.

  Also on the screen 600, a main character icon 606 indicating the main character, and a goo icon 607, a choki icon 608, and a par icon 609 indicating each support character are displayed. The support characters are assigned to the goo icon 607, the choki icon 608, and the par icon 609 from the top in the order in which the cards 114 are read. For example, when the second card 114 is read, the character specified from the ID information of the card 114 becomes a support character assigned to the goo icon 607. Similarly, the third image is assigned to the choki icon 608 and the fourth image is assigned to the par icon 609.

  Hereinafter, the support character assigned to the goo icon 607 is called “goo character”, the support character assigned to the choki icon 608 is called “choki character”, and the support character assigned to the par icon 609 is called “per character”. There is. Although not shown in FIG. 6, the image of each support character is displayed in the vicinity of the main character display 601. A display 610 indicates that the player is assigned to “1P (also referred to as Player 1)”.

  In step S404, it is determined whether or not support card information has been acquired. If it is acquired (YES in step S404), the process moves to step S405, where the information of the support character corresponding to the acquired ID information is extracted from the character table 500 and stored in the RAM 102. That is, when the CPU 101 executes the game program 111, support character reading means for reading character data as a support character from the character storage means is realized, and the RAM 102 stores the character data read by the support character reading means. It functions as support character storage means for storing as support character data. In the subsequent step S406, based on the extracted support character information, an image of the support character is displayed in the vicinity of the main character display 601, the support character name corresponding to the support character name display area is displayed, and the card information is read. Update the screen.

  In a succeeding step S407, it is determined whether or not three pieces of support card information have been acquired. If acquired ("YES" in step S407), the process proceeds to step S408. On the other hand, if three pieces of support card information have not been acquired (“NO” in step S407), the process returns to step S404 and continues.

  In step S408, formation information corresponding to the main character is acquired from the formation information table included in the game data 112 in accordance with the formation ID 506 included in the main character information. An example of the configuration of the formation information table is as shown in FIG.

  In FIG. 7, the formation information table 700 includes a formation ID 701 corresponding to the formation ID 506 registered in the character table 500, a formation name 702 which is the name of the formation assigned to the formation ID, and a formation indicating a character arrangement in the formation. An arrangement 703, an attack power bonus 704 indicating a bonus value of attack power, defense power, and physical strength according to the formation, a defense power bonus 705, and a physical strength bonus 706 are registered. The entries in the table shown here are merely examples, and the present invention is not limited to these. The formation arrangement according to this embodiment will be described with reference to FIG.

  FIG. 8a is a view for explaining a formation corresponding to the embodiment of the invention. The formation is configured as a 3 × 3 matrix, and three consecutive vertical cells are assigned to three mini-games, that is, a match-up, a transformation janken, and a shuriken janken. In FIG. 8a, numbers from 1 to 9 are assigned to each 3 × 3 cell, and a game type is assigned to each number as follows.

1, 2, 3: Splashing together 4, 5, 6: Transform janken 7, 8, 9: Shuriken janken

  Of these 1 to 9, the formation is determined depending on where the main character and the three support characters are assigned. Therefore, the 4-digit number in the formation arrangement 703 of the formation information table 700 represents the allocation position in the order of the main character, goo character, choki character, and par character. For example, in the “causal response team” with the formation ID 001, the formation arrangement 703 is “(5183)”, which is “5” for the main character, “1” for the goo character, and “1” for the choki character. 8 ”means that the per character is arranged at“ 3 ”, that is, the goo character and the per character are assigned to the mini game, and the choki character is assigned to the shuriken junken of the mini game. As described above, the formation arrangement in the formation information is information indicating which character (support character) of each of the goo, choki, and par is associated with the mini game, and which formation information is acquired is the main information. It is determined by the formation ID included in the character data. That is, the formation ID is association data for determining which of the mini-games the support character is associated with, and is included in the main character data.

  FIG. 8a shows a formation corresponding to the formation display 1112 for 1P displayed at the upper left of the main game screen as shown in FIG. 11 described later. On the other hand, the formation display 1113 for 2P (also referred to as “Player 2”) displayed on the upper right of the screen is the display shown in FIG. That is, the upper left is 1 and the lower right is 9.

  Returning to the description of the flowchart of FIG. 4, formation information based on the formation ID (association data) included in the main character data is displayed on the display unit 106 as a formation screen in step S409. That is, by executing the game program 111, the CPU 101 functions as main game execution means, and the formation screen is set so that the player can recognize the association between the support character and the mini game based on the formation ID (association data). Is displayed on the display unit 106. Thereafter, the process proceeds to step S202 in FIG.

  An example of the formation screen is as shown in FIG. In FIG. 9, the formation screen 900 displays formation information of players to play against. The formation 901 indicates the formation of the 1P character operated by the first player, and the formation 902 indicates the formation of the 2P character operated by the second player. 2P may be handled by the CPU 101 instead of the second player. Also, the attack power, defense power, and physical strength values 903 of each main character are displayed.

  In FIG. 9, for the 1P player, the main character A is “5”, the goo character B is “1”, the choki character C is “8”, and the par character D is “3”. Has been placed. For the 2P player, the main character α is set to “5”, the goo character β is “4”, the choki character γ is “2”, and the par character δ is “6” in the formation of the stop mirror water. Has been. The information of the 2P player is arbitrarily determined by the CPU 101.

  Such a formation display allows each player to be notified of the relevance between multiple mini-games and support characters, so that each player can determine which mini-game is advantageous to him / her and the other party according to the contents of the formation display. The progress of the main game can be controlled while considering the above.

  Note that information as shown in FIG. 8B is stored in the RAM 102 as information for displaying a display screen as shown in FIG. In FIG. 8b, in the table 800, first, player information 801 for identifying a player is registered. As the player information 801, numbers “1” and “2” corresponding to 1P and 2P are registered, respectively. In addition, each character name 802 and a formation arrangement 803 for each character are registered. Furthermore, the character names of the support characters are registered for each of goo, choki, and par (804, 805, 806).

  The entries in the table 800 shown here are merely examples, and the present invention is not limited to these. Furthermore, parameters such as the main character image, attack power, defense power, and physical strength, and support character images can be registered.

  Next, details of the event processing in step S206 of FIG. 2 will be described. FIG. 10 is a flowchart showing a process for receiving an operation from the player as an example of the event process in the present embodiment. The processing corresponding to the flowchart shown in FIG. 10 is realized by the CPU 101 executing the game program 111 stored in the internal storage device 110 read into the RAM 102. That is, it is realized by the CPU 101 executing the game program 111 to function as main game execution means.

  First, in step S1001, an event screen for executing the main game is displayed. An example of this event screen is shown in FIG. In FIG. 11, character images 1101 and 1102 are displayed on a screen 1100. The character images 1101 and 1102 are included in the character image 1107 of the character table 500. A meter 1103 is displayed below the screen 1100. At both ends of the meter 1103, icon groups 1104 and 1105, which are icon sets as three selection targets of goo, choki, and par, are displayed, respectively. In addition, player identification displays 1106 and 1107 are displayed below the meter 1103 to identify the character and icon group operated by the player. In addition, formation information of each player is shown in formation display 1112 and 1113.

  In the case of FIG. 11, the case where the character 1101, the icon group 1104, and the formation display 1112 are assigned to Player1, and the character 1102, the icon group 1105, and the formation display 1113 are assigned to Player2 is shown. In the present embodiment, a case where the first player plays against the second player will be described. The first player is assigned to Player 1 and the second player is assigned to Player 2. Note that the CPU 101 may take charge of either the first player or the second player instead. The physical strength values given to the characters 1101 and 1102 are displayed on the screen by physical strength meters 1108 and 1109, respectively. The initial value of the physical strength is given as the sum of the physical strength 505 of each character and a bonus value 706 based on the formation.

  When the game is started, the icon groups 1104 and 1105 start moving on the meter 1103 in the directions indicated by arrows 1110 and 1111 respectively. At this time, when any of the buttons 103a to 103c of the operation unit 103 is selected, each display of the icon groups 1104 and 1105 is switched so that the icon corresponding to the selection button is positioned at the head in the movement direction. . In the case of FIG. 11, the first player selects the goo button 103a, the goo icon is displayed as the top icon, the second player selects the choke button 103b, and the choke icon is displayed as the top icon. Is shown.

  Note that information shown in FIG. 12 is stored in the RAM 102 as information for displaying a display screen for executing the main game as shown in FIG. In FIG. 12, first, player information 1201 for identifying a player is registered in the table 1200. As the player information 1201, numbers “1” and “2” corresponding to Player 1 (1106) and 2 (1107) are registered. For the subsequent items, values for each piece of player information are registered.

  In the character name 1202, the character names of the characters 1101 and 1102 operated by Player1 and Player2 are registered. The character name registered here corresponds to the character name of the main character acquired in the flowchart of FIG.

  In the selection button 1203, the display form of the icon groups 1104 and 1105, that is, the type of the currently selected button for determining the head icon in the movement direction is registered. As shown in FIG. 11, for Player 1, the goo button 103 a is selected, so “go” is registered as the selection button 1203, and “Cho” is registered as the selection button 1203 for Player 2.

  Next, the moving speed 1204 indicates the moving speed per unit time when the icon groups 1104 and 1105 move in the directions of arrows 1110 and 1111 respectively. There are two types of speeds registered as the moving speed 1204, for example, v1 and v2. Here, the magnitude relationship of v1 <v2 is established, and in the default state, the icon groups 1104 and 1105 each move at v1. When a certain operation is accepted, the speed is changed from v1 to v2.

  The moving distance 1205 indicates the distance from the start point (or the end of the meter 1103) where the icon groups 1104 and 1105 start moving to the point where the current icon groups 1104 and 1105 are located. Note that the maximum value of the total moving distance 1205 is set to match a predetermined value. For example, assuming that the maximum value is 100, when the sum of dm1 and dm2 matches 100, the icon groups 1104 and 1105 are displayed in a collision on the meter 1103. That is, it is possible to determine whether or not the icon groups 1104 and 1105 have collided (whether or not to display collision) according to the size of the sum of dm1 and dm2.

  Next, the attack power value of each character is registered in the attack power 1206. Also, the defense level value of each character is registered in the defense level 1207. In the physical strength value 1208, the physical strength value of each character is registered. Above the screen 1100, physical strength meters 1108 and 1109 corresponding to the value of the physical strength 1208 are displayed. Values registered as initial values of the attack power 1206, the defense power 1207, and the physical strength 1208 correspond to the values displayed in the area 903 in FIG. 9 when the main character and the support character are set.

  When the screen as shown in FIG. 11 is displayed based on the information of FIG. 12 and the battle game as an event is started (“YES” in step S1002), the process proceeds to step S1003, and the icons in the screen 1100 are displayed. 1104 and 1105 are displayed as if they are moving in directions indicated by arrows 1110 and 1111. The moving speed of the icon groups 1104 and 1105 at this time is set to v1.

  Next, in step S1004, an operation for any one of the goo button 103a, the choke button 103b, and the par button 103c from the first and second players is received. If any button selection is accepted (“YES” in step S1004), the process proceeds to step S1005. In step S1005, the type of the selection button accepted in step S1004 is registered in the selection button 1203 of the table 1200 of FIG. 12, and the display is switched to the icon group 1104 or 1105 corresponding to the type of the button. For example, when the selection of the goo button 103a is received from the first player, the display is switched so that the goo icon is displayed at the head of the moving direction of the icon group 1104.

  Next, in step S1006, it is determined whether button selection has been accepted. If further button selection is accepted (“YES” in step S1006), the process proceeds to step S1007. If no further button selection has been received (“NO” in step S1006), monitoring of button selection reception is continued in step S1006.

  Next, in step S1007, it is determined whether or not the button type received in step S1006 matches the button type registered in the selection button 1203 of the table 1200 in FIG. If they match and it is determined that selection of the same button has been accepted (“YES” in step S1007), the process proceeds to step S1008. On the other hand, if it is determined that the two buttons do not match and the selection of the same button is not accepted ("NO" in step S1007), the process proceeds to step S1005 and the icon group 1104 or The display of 1105 is switched. After the determination in step S1007, the contents of the selection button 1203 in the table 1200 are updated with the type of button received in step S1006.

  In step S1008, since the same button operation has been continuously received, the moving speed is changed from v1 to v2, and the icon group 1104 or 1105 is moved at the speed of v2 and displayed on the screen 1100. . At this time, the item of moving speed 1204 in the table 1200 is updated to v2. In step S1009, it is determined again whether the button operation has been accepted. If a button operation is accepted (“YES” in step S1009), the process proceeds to step S1010. On the other hand, if the button operation is not accepted, the monitoring of the button operation reception in step S1009 is continued.

  In step S1010, the moving speed is changed from v2 to v1, and the contents of the moving speed 1204 in the table 1200 are updated from v2 to v1. In step S1011, it is determined whether or not the button operation accepted in step S1009 matches the button type registered in the selection button 1203 of the table 1200. If they match (“YES” in step S1011), the process proceeds to step S1006. On the other hand, if they do not match (“NO” in step S1011), the process returns to step S1005 to switch the display of the icon group 1104 or 1104 according to the type of the selected button.

  The process shown in the flowchart of FIG. 10 is continued until the icon groups 1104 and 1105 are displayed in a collision manner on the meter 1103 and reception of button operations is stopped. This stoppage of button operation will be described later with reference to FIG.

  In the flowchart of FIG. 10, the button type is not considered when determining whether or not the button operation is accepted in step S1009. However, when the operation of the same button as that received in step S1008 is further received, the process proceeds to step S1010, the moving speed is updated from v2 to v1, and the operation of a different button is newly accepted. The moving speed may be maintained at v2.

  As described above, the display of the icon groups 1104 and 1105 can be switched and the moving speed of the icon group 1104 can be changed and displayed on the screen 1100 in FIG. 11 based on the operation received from the player. When Player 1 or 2 is assigned to the CPU 101, the display of the icon group 1104 or 1105 can be switched and the moving speed can be changed in the same manner as when an operation from an actual player is accepted.

  Next, with reference to FIG. 13, the process of determining the win / loss in the game will be described. FIG. 13 is a flowchart showing a win / loss determination process as an example of an event process in the present embodiment. The process corresponding to the flowchart shown in FIG. 13 is realized by the CPU 101 executing the game program 111 stored in the internal storage device 110 read into the RAM 102.

  First, in step S1301, it is determined whether or not a battle game based on the display on the screen 1100 in FIG. 11 has been started. This determination step corresponds to step S1002 in FIG.

  If the battle game is started (“YES” in step S1301), the process proceeds to step S1302. In step S1302, the movement distances dm1 and dm2 between the icon groups 1104 and 1105 are calculated based on the movement speeds of the characters 1101 and 1102 registered in the movement speed 1204 of the table 1200 of FIG. The calculated dm1 and dm2 are written in the movement distance 1205 of the table 1200, and the value of the movement distance is updated.

  In the following step S1303, it is determined whether or not the sum of the movement distances dm1 and dm2 registered in the movement distance 1205 of the table 1200 matches a preset threshold value Th1. As described above, the maximum value of the sum of dm1 and dm2 matches a preset value, and the threshold value Th1 corresponds to this value.

  If the sum does not match the threshold value Th1 (“NO” in step S1303), the process returns to step S1302 to continue the movement distance calculation process. On the other hand, when the sum matches the threshold Th1 (“YES” in step S1303), the process proceeds to step S1304. In this case, on the screen 1100, for example, as shown in FIG. 14, the icon groups 1104 and 1105 are displayed in a state of colliding on the meter 1103.

  In the present embodiment, the winning / losing is determined based on the type of the leading icon when the icon groups 1104 and 1105 collide on the meter 1103. Therefore, in step S1304, reception of button operations from the player is stopped. Thereby, the processing in the flowchart shown in FIG. 10 is stopped. Therefore, after that, the content of the selection button 1203 of the table 1200 is not changed.

  In a succeeding step S1305, the registered content of the selection button 1203 of the table 1200 is acquired. As a result, the type of icon positioned at the head of the icon groups 1104 and 1105 can be acquired. In a succeeding step S1306, a win / loss determination is performed based on the registered content of the selection button 1203. This win / loss determination can be performed in the same manner as a general janken win / loss determination. In janken, relative superiority and inferiority relations are cyclically set for three selection targets. That is, “Goo” is stronger than “Choki” and weaker than “Par”. “Par” is stronger than “Goo” and weaker than “Choki”. “Choki” is stronger than “par” and weaker than “goo”.

  If the winning / losing is determined by the winning / losing determination (“YES” in step S1307), the process proceeds to step S1308. On the other hand, when winning or losing is not determined ("NO" in step S1307), the process proceeds to step S1310. The case where the winning / losing is not determined is a so-called “Aiko” case. In step S1310, the Aiko process is executed. In this Aiko process, a sprinkling process is executed as a mini-game for determining victory or defeat, and details thereof will be described later in the first embodiment.

  In a succeeding step S1308, it is determined whether or not to perform transformation (changing) junken. Details of the transformation janken will be described later in the second embodiment. In the screen of FIG. 11, the transformation janken is displayed on the meter 1103 on the meter 1103, and a player who has won with the same hand as the displayed icon is displayed. It can be executed when there is a player who has won with a defined hand.

  When the transformation chance icon is displayed on the meter 1103, the type of icon displayed as the transformation chance icon can be registered in the table 1200 of FIG. Then, when winning or losing is determined, it is determined whether or not to perform transformation janken by determining whether or not the content of the selection button 1203 on the winner side matches the icon type of the transformation chance icon. it can. Note that the conditions for performing transformation janken are not limited to this.

  If the condition for performing transformation janken is satisfied (“YES” in step S1308), the process proceeds to step S1311 and the corresponding process is executed. The process in step S1311 will be described in detail in the second embodiment. On the other hand, when the condition for performing transformation janken is not satisfied (“NO” in step S1308), the process proceeds to step S1309 to determine whether or not to perform shuriken kenken.

  Details of the shuriken janken will be described later in the third embodiment. The shuriken janken can be executed when a parameter (chakra value) related to the number of wins has reached a predetermined value, such as when the number of wins has reached a predetermined number. The parameter of the chakra value can be registered in the table 1200 of FIG. When winning or losing is determined, it is possible to determine whether or not to perform shuriken junken by determining whether or not the magnitude of the chakra value has reached a predetermined value. In addition, the conditions for performing shuriken janken are not limited to this.

  If the condition for performing shuriken junken is satisfied (“YES” in step S1309), the process proceeds to step S1312, and the corresponding process is executed. The process in step S1312 will be described in detail in the third embodiment. On the other hand, when the condition for performing shuriken junken is not satisfied (“NO” in step S1309), the process proceeds to step S1313. The processes in steps S1307, S1308, S1309, and S1310, and the processes in steps S1310, S1311, and S1312 are performed by the CPU 101 executing the game program 111. In this way, Mini-game execution determining means for determining whether any of the conditions for executing the mini-game is satisfied, and a mini-game for reading the mini-game program and executing the mini-game when it is determined that the condition is satisfied A game execution means is realized.

  In subsequent step S1313, a damage value (Ddm) to be given to the character who has become the loser is calculated based on the win / loss determination. The damage value can be calculated according to a predetermined calculation condition. For example, a simple difference between the attack power 1206 and the defense power 1207 set for each character in the table 1200 may be used, or a weight (for example, doubled) is added to the value of the attack power 1206 to provide the defense power 1207. You may take the difference. Alternatively, different weights may be assigned to “goo”, “choki”, and “par”, and the difference from the opponent's defense power 1207 may be obtained by multiplying the value of the attack power 1206 by the weight of the winner.

  In addition, when winning or losing is determined in the mini game in steps S1310, S1311, and S1312, additional damage may be given. The damage value calculation method including these is not a characteristic technical matter of the present invention, and a known technique can be adopted, and further description is omitted in this document.

  In the subsequent step S1314, the calculated damage value Ddm is subtracted from the value of the stamina 1208 of the loser character registered in the table 1200 to update the value of the stamina 1208. In step S1315, the display of the physical strength meter 1108 or 1109 is updated based on the physical strength 1208 after subtraction. Further, in step S1316, based on the subtraction of the physical strength 1208, it is determined whether or not there is a character whose physical strength 1208 is “0”. If there is a character whose physical strength 1208 is “0” (“YES” in step S1316), the process proceeds to step S1317. On the other hand, when such a character does not exist (“NO” in step S1316), the process returns to step S1301 to continue the game.

  In step S1317, the final win / loss is displayed on the screen 1100. Specifically, the display is performed so that a character whose physical strength 1208 is not “0” is a winner and a character whose physical strength 1208 is “0” is a loser. Thereafter, the process returns to the process of FIG.

  As described above, the winning / losing of each janken is determined, and when the physical strength 1208 finally becomes “0”, the battle game can be ended.

  In the present embodiment, the example in which the meter 1103 is displayed linearly in the horizontal direction of the screen has been described. However, the embodiment of the invention is not limited to this display form. For example, it may be a vertical direction of the screen or an oblique direction. Furthermore, it is not linear but may be curved or circular. In any case, when two icon groups are displayed in a collision manner, it is only necessary to determine victory or defeat based on the type of icon located at the head in the moving direction.

  In the present embodiment, the display of the icon group moving in a predetermined direction is switched according to the operation of the selection button, and the victory or defeat is determined when the leading icons of the two icon groups collide. At that time, you can switch the icon group display by operating the selection button until just before the collision, so you can not only enjoy it as a junken game, but also play games while doing bargaining and psychological warfare with opponents I can enjoy it.

  In addition, the icon group usually moves at the speed of v1, but by continuously operating the same button, the speed can be increased to v2 or returned to v1, so that the icon group The collision timing can be adjusted. By controlling the movement speed as described above, it is possible to enjoy a game while performing bargaining and psychological warfare.

  Furthermore, in the game device of the present invention, when the main game is being executed, the support character is assigned to the mini game executed on the display screen in response to a predetermined condition being satisfied during the main game. Can be displayed. With this formation display, each player not only wins the main game, but also selects the winning method that will be advantageous in the mini game that follows or the losing method that is not disadvantageous in the mini game, and advances the game. be able to. As a result, the game can be enjoyed not only as a fun game as a janken game but also as a game or psychological battle with an opponent.

  In the following, details of the Aiko process, the transformation janken process, and the shuriken janken process as a mini game will be described as individual embodiments.

[First Embodiment]
First, the details of the “Ico process” in step S1310 will be described with reference to the flowchart of FIG. The processing corresponding to the flowchart shown in FIG. 15 is realized by the CPU 101 executing the game program 111 stored in the internal storage device 110 read into the RAM 102.

  First, in step S1501, an Aiko event start display is displayed. This screen display example is as shown in FIG. Here, a message 1600 indicating the start of the Aiko event such as “Aiko game start” is displayed on the display screen 1100 when the win / loss determination is performed in step S1306 in FIG. In this Aiko event, the icon groups 1104 and 1105 are pressed against each other, and the event progress of a mini game called “swallowing” is controlled so as to win when the end of the meter 1103 is pushed.

  In subsequent step S1502, the screen display is switched as shown in FIG. In FIG. 17, support character icons are displayed on the icon groups 1104 and 1105. However, since “Tsubame” is performed as an Aiko event here, it is assigned to “Tsubame” in the formation display 1112 and 1113, that is, assigned to 1, 2 and 3 in the formation shown in FIG. Only the support character icon is displayed.

  In the case of FIG. 16, in the 1P formation display 1112, the support character B, which is a goo character, and the support character D, which is a per character, are assigned to “combination”. Further, in the 2P formation display 1113, only the support character γ, which is a choke character, is assigned to “combat”. Therefore, in the icon groups 1104 and 1105, icons indicating the support character B, the support character D, and the support character γ are displayed at corresponding positions. FIG. 17 is a diagram illustrating an example of the display result.

  In FIG. 17, since “Aiko” has been selected, the 2P side icon is replaced with the icon 1700 of the support character γ and displayed. On the other hand, on the 1P side, no support character is assigned to the choke icon, and the display is as it is. However, since support characters are assigned to goo and par, the display is replaced by the icon of the corresponding character.

  Such icon assignment is determined based on the registered contents of the table 800 shown in FIG. That is, based on the formation position 803 (according to the formation ID which is the association data) registered in the table 800, it is determined whether the support character is associated with the currently executed mini game (swing). The association determination means is realized here.

  In step S1503, a button operation from the player is received. Specifically, the player accepts the operation of any one of the selection buttons from the buttons 103a to 103c of the operation unit 103. In “Tsubame”, the icon groups 1104 and 1105 displayed in a collision state are moved by a predetermined distance d1 toward the player who has received the number of button operations received in this way for a certain period of time. That is, the icon groups 1104 and 1105 are moved by the distance d1 in the same direction. It should be noted that the button that receives the operation in this step may be only the selection button corresponding to the icon for which the AIKO determination has been performed. For example, when “chocolate” becomes “aiko”, an operation of only the choke button 103b is accepted.

  In step S1504, it is determined whether a predetermined time has elapsed. Here, the fixed time can be set to 1 second, for example. If the predetermined time has elapsed (“YES” in step S1504), the process proceeds to step S1505. On the other hand, if the predetermined time has not elapsed (“NO” in step S1504), the process returns to step S1503 to accept a button operation from the player.

  In step S1505, the total value of the number of operations accepted until a predetermined time elapses is calculated for 1P (total value: Pr1) and 2P (total value: Pr2). Note that the reception of button operations and the counting of the number of operations in step S1502 are continuously performed during this calculation period.

  In the calculation of the total value in this step, if the support character icon is used for a match, that is, if the wrong hand icon is replaced with the support character icon in FIG. A value is increased by weighting the number of operations of the player on the side using the support character icon. Specifically, the choke icon on the 2P side is replaced with the icon of the support character γ, and a mini-game of struggling is executed. Therefore, the number of operations on the 2P side is weighted so as to increase the value. For example, the number of operations when a certain time (1 second in the above example) elapses can be multiplied by 1.5. In this way, a preferential means for performing a preferential treatment for the player in the mini game being executed when it is determined that the support character is associated with the mini game currently being executed (subtle match) is realized.

  Whether or not the icon is replaced by the support character icon can be determined based on, for example, the registered content of the table 800 in FIG. 8B.

  In subsequent step S1506, it is determined whether or not the calculated total values Pr1 and Pr2 match. If they match (“YES” in step S1506), the process returns to step S1503 to accept the button operation. On the other hand, if they do not match (“NO” in step S1506), the process proceeds to step S1507. In step S1507, d1 is subtracted from the moving distance 1205 of the table 1200 for the smaller total value, and d1 is added to the moving distance 1205 of the table 1200 for the larger total value. For example, when Pr2 is larger than Pr1, d1 is added to the 2P moving distance dm2, and d1 is subtracted from the 1P moving distance dm1.

  On the screen 1100, the icon groups 1104 and 1105 are displayed to move on the meter 1103 based on the updated values of the movement distances dm1 and dm2. That is, the icon group moves by d1 to the side with the smaller total value.

  Next, in step S1508, it is determined whether any icon group has reached any end of the meter 1103. This determination is made based on whether one of the values of dm1 and dm2 registered in the movement distance (distance from the end that is the movement start position) 1205 is “0”. If any of the moving distances 1205 is “0”, it can be determined that the end of the meter 1103 has been reached.

  Therefore, if it is determined that the end has been reached (“YES” in step S1508), a win or loss is determined in step S1509. At this time, the side having the movement distance 1205 of “0” becomes the loser, and the other side becomes the winner. Thereafter, the processing returns to the processing of FIG. If it is determined that the end has not been reached (“NO” in step S1508), the process returns to step S1503 to accept a button operation.

  In this way, even if the game is victorious, it is possible to determine the victory or defeat in a new event. At this time, if there is a support character assigned for the event, the game can be advantageously advanced.

  In the above description, a case has been described in which when the game determination in step S1306 in FIG. 13 is “Aiko”, the process immediately shifts to “Aiko processing” shown in FIG. In addition, when the count value reaches a predetermined number of times, the process may be shifted to “aiko processing”. For example, when the count value reaches 3 times, the process can be executed. In this case, the count value is reset when the process is completed.

[Second Embodiment]
Next, in the second embodiment, details of the “transformation janken process” in step S1311 will be described. FIG. 18 is a flowchart illustrating an example of transformation janken processing corresponding to the present embodiment. The processing corresponding to the flowchart shown in FIG. 18 is realized by the CPU 101 executing the game program 111 stored in the internal storage device 110 read into the RAM 102.

  First, in step S1801, an event start display screen is displayed. In this screen display, a message such as “transformation start start” is displayed on the screen in the same manner as shown in the case of the picking process in FIG.

  Next, in step S1802, the screen display is switched as shown in FIG. FIG. 19 is a diagram illustrating an example of a screen display in the transformation janken process. In FIG. 19, character images 1901 and 1902 are displayed on a screen 1900. The character images 1901 and 1902 are included in the game data 112. Below the character images 1901 and 1902, icon groups 1903 and 1904 are displayed. The icon group 1903 and the icon group 1904 are displayed so as to move toward each other. The moving direction at this time is as shown by the arrows in the figure.

  Each icon group includes three types of icons, “goo”, “choki”, and “par”. When each player operates one of the goo button 103a, the choke button 103b, and the par button 103c, the icon group 1903 or 1904 is rotated and displayed on the icon traveling direction side corresponding to the selected button. FIG. 19 shows a display mode when the 1P-side player operates the goo button 103a and the 2P-side player operates the choke button 103b.

  In the transformation janken of this embodiment, the icon group moves in the direction approaching each other, the janken game is performed based on the content of the top icon when the icon group collides, and the losing icon is damaged. If the same hand is defeated more than once, the icon will be destroyed due to the accumulation of damage, and the final game will be decided in the transformation janken.

  Note that, when there is a support character assigned to the transformation janken according to the formation information in the table 800, an icon of the support character is displayed in the icon groups 1903 and 1904. In other words, based on the formation position 803 (based on the formation ID as the association data) registered in the table 800, it is determined whether the support character is associated with the currently executed mini game (transformation janken). Here, association determination means is realized. In FIG. 19, the support character β and the support character δ icons are displayed along with the 2P-side goo icon and the par icon. In this way, with the icon accompanied by the support character, the strength increases, and the number of losses and the number of times until the icon is destroyed is set larger than that of a normal icon. That is, when it is determined that the support character is associated with the currently executed mini game (transformation janken), a preferential means for performing a process for preferentially treating the player in the mini game being executed is realized.

  For example, an icon without a support character is assumed to be destroyed when it is defeated twice with the same hand. On the other hand, an icon accompanied by a support character cannot be destroyed until it is defeated three times with the same hand.

  Returning to FIG. 18, in step S1803, the icon collision value is reset. The icon collision value is a parameter that is incremented by 1 when the icon group 1903 and 1904 collide and wins the game, and each icon of goo, choki, par Is set to a value. In the transformation janken of this embodiment, the win or loss is determined depending on whether or not the icon collision value matches a predetermined value. In this embodiment, the reset value is “1” for an icon not accompanied by a support character, and is “0” for an icon accompanied by a support character. As a result, the icon accompanied by the support character may be defeated once or more, and the battle is advantageous. The difference between the reset values is not limited to 1, and may be 2 or more. Further, the reset value may be the same, and the predetermined value compared when deciding the victory or defeat may be different.

  As the information for performing the display of FIG. 19 including the icon collision value, the RAM 102 stores information as shown in FIG. In FIG. 20, first, player information 2001 for identifying a player is registered in the table 2000. As the player information 2001, numbers “1” and “2” corresponding to Player 1 (1907) and 2 (1108) are registered. For the subsequent items, values for each piece of player information are registered.

  In the character name 2002, the character names of the characters 1901 and 1902 operated by Player1 and Player2 are registered. The character name registered here corresponds to the character name of the main character acquired in the flowchart of FIG.

  In the selection button 2003, the display form of the icon groups 1903 and 1904, that is, the type of the currently selected button for determining the head icon in the moving direction is registered. As shown in FIG. 19, for Player 1, the goo button 103 a is selected, so “go” is registered as the select button 2003, and “Cho” is registered as the select button 2003 for Player 2.

  Next, the movement speed 2004 indicates the movement speed per unit time when the icon groups 1903 and 1904 move in the directions of the arrows, respectively. V1 is registered as the moving speed 2004.

  The movement distance 2005 indicates the distance from the start point where the icon groups 1903 and 1904 start moving to the point where the current icon groups 1104 and 1105 are respectively located. The total maximum value of the movement distance 2005 is set so as to coincide with a predetermined value. For example, assuming that the maximum value is 100, when the sum of dm1 and dm2 matches 100, the icon groups 1903 and 1904 are displayed in collision on the screen 1900. That is, it is possible to determine whether or not the icon groups 1903 and 1904 have collided (whether or not collision display is performed) according to the size of the sum of dm1 and dm2.

  Next, the icon collision value represents the icon collision value (2006, 2007, 2008) set for the goo icon, the choki icon, and the par icon of each character. FIG. 20 shows the value immediately after the reset. As described above, since the support character exists in the goo and par in the 2P player, the goo and par collision value is “0”. 1 ”. The icon collision value is updated according to the win or loss when the icon groups 1903 and 1904 collide.

  Note that the information registered in the table 2000 is not limited to the information shown in FIG. 20, and can include other information such as a support character icon image and a support character name, for example.

  Returning to the description of FIG. 18, in step S1804, the icon groups 1903 and 1904 in the screen 1900 are displayed as if they are moving in the direction of the arrows approaching each other. The moving speed of the icon groups 1903 and 1904 at this time can be set to v1 according to the table 2000, for example.

  In step S1805, an operation for one of the goo button 103a, the choke button 103b, and the par button 103c from the first and second players is received. If any button selection is accepted, the process proceeds to step S1806.

  In step S1806, the type of the selection button accepted in step S1805 is registered in the selection button 2003 of the table 2000 in FIG. 20, and the display is switched to the icon group 1903 or 1904 corresponding to the type of the button. For example, when the selection of the goo button 103a is received from the first player, the display is switched so that the goo icon is displayed at the beginning of the moving direction of the icon group 1903.

  In step S1807, it is determined whether to perform icon collision display. In this determination, first, the movement distances dm1 and dm2 between the icon groups 1903 and 1904 are respectively calculated based on the movement speeds of the characters 1101 and 1102 registered in the movement speed 2004 of the table 2000 of FIG. The calculated dm1 and dm2 are written in the movement distance 2005 of the table 2000, and the value of the movement distance is updated. Next, it is determined whether or not the sum of dm1 and dm2 of the movement distance 2005 of the table 200 matches a preset threshold value Th2. As described above, the maximum value of the sum of dm1 and dm2 matches a preset value, and the threshold value Th2 corresponds to this value.

  If the sum does not match the threshold Th2 ("NO" in step S1807), the process returns to step S1805 to accept the button operation. On the other hand, if the sum matches the threshold value Th2 (“YES” in step S1807), the process moves to step S1808. In this case, on the screen 1900, the icon groups 1903 and 1904 are displayed in a collision state.

  In the present embodiment, the winning / losing is determined based on the type of the leading icon when the icon groups 1903 and 1904 are displayed in a collision manner. Therefore, if it is determined in step S1807 that icon collision is displayed, reception of button operations from the player is stopped. As a result, the contents of the selection button 2003 of the table 2000 are not changed.

  In a succeeding step S1808, the winning / losing determination is performed based on the registered contents of the selection button 2003 of the table 2000. This win / loss determination can be performed in the same manner as a general janken win / loss determination. When winning or losing is determined by the winning / losing determination (“YES” in step S1809), the process proceeds to step S1810. On the other hand, when winning or losing is not determined ("NO" in step S1809), the process proceeds to step S1811. The case where the winning / losing is not determined is a so-called “Aiko” case.

  In the subsequent step S1810, the icon collision value (any one of 2006, 2007 and 2008) corresponding to the character who has become the loser is updated by “1” based on the win / loss determination. For example, if the icon group collides in the state shown in FIG. 19, 2P is defeated by “Choki”. Therefore, in the table 2000, the icon collision value 2007 of “Choki” on the player 2 side is changed from 0 to 1. Update. Thereafter, the process proceeds to step S1812.

  In the subsequent step S1811, the icon collision value (any one of 2006, 2007, and 2008) corresponding to the hand that has become “Aiko” by the win / loss determination is updated by “1”. For example, if the result is “Goo”, in the table 2000, the “Goo” icon collision value 2006 on the player 1 side is updated from 1 to 2, and the “Goo” icon collision value 2006 on the player 2 side is updated. Is updated from 0 to 1. Thereafter, the process proceeds to step S1812.

  In subsequent step S1812, it is determined whether or not any of the icon collision values matches a predetermined threshold Th3. Th3 can be set to 3, for example. In this case, an icon with no support character matches the threshold Th3 by two losses or matches, and an icon with a support character matches the threshold Th3 by three losses or matches.

  If there is an icon collision value that matches the threshold Th3 (“YES” in step S1812), the process proceeds to step S1813. On the other hand, if there is no icon collision value that matches the threshold Th3 ("NO" in step S1812), the process proceeds to step S1814.

  In step S1813, the icon whose icon collision value matches the threshold value is deleted from the screen. As a display method at the time of erasing, for example, the icon can be displayed as if it was destroyed. As a result, the player whose icon is destroyed becomes the loser, the player who destroys the icon is determined to be the winner, this transformation janken process is terminated, and the process returns to the process of FIG.

  In step S1814, the display of the icon with the updated icon collision value is corrected. For example, it is possible to display an icon with a crack. As a result, if the player loses the same hand one time later, the player can be notified that the player will lose the final game. An example of this display is shown in FIG. In FIG. 21, a crack 2101 is superimposed on the lost icon. It should be noted that such a crack 2101 may be displayed only when it is destroyed if it is defeated once more. Thereafter, the process returns to step S1805 to continue the processing.

  In the above embodiment, the icon group moves in a direction approaching each other in accordance with the operation of the selection button, individual win / loss is determined based on the content of the top icon at the time of contact, and the same icon loses a predetermined number of times It is possible to perform a transformation janken that determines the win or loss of the entire mini game. In this transformation janken, an icon with a support character loses, or the allowable number of times is larger than an icon without a support character. You can decide and play the game. Therefore, the game can be enjoyed while performing tactics and psychological warfare with the opponent, not just how to enjoy as a janken game.

[Third Embodiment]
Next, in the third embodiment, the details of the “shuriken junken process” in step S1312 will be described. FIG. 22 is a flowchart showing an example of transformation janken processing corresponding to the present embodiment. The processing corresponding to the flowchart shown in FIG. 22 is realized by the CPU 101 executing the game program 111 stored in the internal storage device 110 read into the RAM 102.

  In FIG. 22, first, in step S2201, an event screen is displayed. An example of this event screen is shown in FIG. In FIG. 23, character images 2301 and 2302 are displayed on a screen 2300. The character images 2301 and 2302 are included in the game data 112. In addition, icon groups 2303 and 2304 are displayed below the screen 2300. Each icon group includes three types of icons, “goo”, “choki”, and “par”. Each player can select one of three types of icons, and the selected icon can be identified by selection marks 2305 and 2306. The selection marks 2305 and 2306 can be moved, that is, the selection can be switched by operating the selection buttons 103a to 103c. For example, to select the “Par” icon, the selection button 103c may be operated.

  In addition, player identification displays 2307 and 2308 are displayed at the bottom of the screen 2300 in order to identify the character and icon group assigned to each player. In the case of FIG. 23, the character 2301, the icon group 2303, and the selection mark 2305 are assigned to Player1 (2307), and the character 2302, the icon group 2304, and the selection mark 2306 are assigned to Player2 (2308). In the present embodiment, a case where the first player plays against the second player will be described. The first player is assigned to Player 1 and the second player is assigned to Player 2. Note that the CPU 101 may take charge of either the first player or the second player instead. Further, the physical strength values given to the characters 2301 and 2302 are displayed on the screen by physical strength meters 2309 and 2310.

  If there is a support character assigned to the shuriken janken according to the formation information in the table 800, a support character icon 2311 is displayed in association with the icon groups 2303 and 2304. That is, based on the formation position 803 registered in the table 800 (by the formation ID as the association data), it is determined whether the support character is associated with the currently executed mini game (Shuriken Junken). Here, association determination means is realized. In FIG. 23, an icon 2311 of the support character C is accompanied by a display on the player 1 side. Thus, the icon accompanied by the support character is determined to be a win even in this case. Further, the movement speed per unit time may be increased as compared with other icons. In this way, a preferential means for performing a preferential treatment for the player in the mini game being executed when it is determined that the support character is associated with the mini game (shuriken janken) currently being executed is realized.

  When the screen as shown in FIG. 23 is displayed and the battle game as an event is started (“YES” in step S2202), the process proceeds to step S2203, and any one of the selection buttons 103a to 103c from the player is operated. Accept. The received button type is held in the RAM 102.

  In the subsequent step S2204, the selection mark 2305 is displayed at the corresponding icon position in the icon group 2303 or 2304 according to the type of the selected button. For example, when the player selects the joki button 103b, a selection mark 2305 is displayed at the choke icon position in the icon group 2303 as shown in FIG. The same applies to the other icons.

  Thereafter, in step S2205, any button operation of the selection buttons 103a to 103c is accepted. In step S2206, it is determined whether the button type received in step S2203 held in the RAM 102 is the same as the button type received in step S2205. If they are not the same, the process returns to step S2204, and the selection mark 2305 is displayed at the corresponding icon position. On the other hand, if they are the same, the process proceeds to step S2207.

  In step S2207, a target position for moving the selected icon toward the other party's icon group is determined. In this embodiment, there are two ways to set the target position. The proper use of these is performed based on whether the icon selected by the opponent has already moved toward the icon group, that is, whether the opponent is the first and the second is the latter.

  If the other party's icon has not yet started to move and he / she is the starting person, the initial display position of the other party's icon in which the icon type selected in step S2205 is dominant is set as the target position. For example, if “Choco icon” is selected in step S2205, the initial display position of “Par icon”, which is the target for which choki dominates, is set as the target position.

  An example of such setting of the target position is shown in FIG. FIGS. 24A and 24B are diagrams showing target positions of icons included in the icon groups 2303 and 2304 of Player 1 and 2. FIG. For example, in FIG. 24A, the target position of the “go icon” included in the icon group 2303 is the position of the “chocolate icon” among the initial display positions of the icons included in the icon group 2304. In FIG. 24B, the target position of the “par icon” included in the icon group 2304 is the position of the “go icon” among the initial display positions of the icons included in the icon group 2303. In this way, the position of the initial display of the opponent icon where the selected icon is dominant is set as the target position during movement. Here, the initial display position refers to the display position of each icon in the display state before any of the icons in the icon groups 2303 and 2304 starts moving.

  The initial display position of each icon can be set in advance as a coordinate value by setting coordinates as shown in FIG. Each coordinate value is a coordinate value that specifies the position of its own icon, and when the icon becomes the target position, the coordinate value represents the target position. Even when the icon moves thereafter, the display position can be specified by the coordinate value using the coordinates of FIG.

  Next, when the other party's icon is a starter (that is, when the movement has already started), the other party's icon itself becomes the target position. As described above, the opponent's icon itself moves using one of the six patterns in FIGS. 24A and 24B, so that it is displayed in a collision with the icon on the track. Set the target position to. In the present embodiment, whether or not an icon is a collision is determined by whether or not the distance between the center positions of the icons matches a predetermined value (d2). Therefore, the target position of the later icon is set to a position away from the position where the earlier icon reaches after a predetermined time has elapsed after the start of the movement of the later icon. The predetermined time here can be set according to the required time from the start of movement of the starting icon to the arrival of the target position. If the required time is 1 second, it can be set to 30 ms, for example. .

  When the target position is determined in step S2207, the icon starts moving toward the target position in step S2208. At this time, the selection mark 2305 may be moved together. In the case of a starting icon, the moving speed may be constant until the target position is reached with the initial speed v0, or may be increased as the target position is approached. As an increasing method, for example, it can be increased exponentially. Further, the moving speed can be set to be somewhat high, and can be set so that it takes several seconds or less than one second from the start of movement to reaching the target position. This is to prevent the player who has previously selected from being disadvantaged. In the case of a late icon, a speed required to reach the target position in the predetermined time is set.

  In addition, for an icon accompanied by a support character, the speed can be increased by performing a predetermined weight on the speed v of other icons not accompanied by the support character. In the example of FIG. 23, the support character C is attached to the player 1 side icon, so the moving speed of the player 1 side icon is set faster than the other icons. For example, a weight of 1.2 to 1.5 can be applied to the speed v of other icons. However, this weighting value is an example and can be set arbitrarily.

  When the movement is started in step S 2208, the calculation of the icon display position (coordinate value) is also started, and the calculated display position is stored in the RAM 102. Note that the display position only needs to be obtained with respect to the center of the icon.

  In step S2209, it is determined whether or not the moving icon is displayed in a collision manner. The determination of the collision display can be made, for example, based on whether or not the distance between the center positions of the moving icons matches the predetermined value d2. If it is determined that no collision is displayed (“NO” in step S2209), the process proceeds to step S2210.

  In step S2210, it is determined based on the display position information stored in the RAM 102 whether or not there is an icon that has reached the target position. Note that the determination of the icon that has reached the target here is limited to the icon related to the starting icon because the collision is determined in step S2209. If there is no icon that has reached the target (“NO” in step S2210), the process returns to step S2209. On the other hand, if there is an icon that has reached the target, the process proceeds to step S2211.

  If it is determined in step S2209 that a collision display is made (“YES” in step S2209), the process proceeds to step S2212, and a win / loss determination is performed. The win / loss determination here follows the normal janken rule. An example in which icons are displayed in a collision manner is shown in FIG. Here, a case is shown where the “go icon” 2501 from the Player 2 side collides when the “Choco icon” 2501 is moving from the Player 1 side toward the “Par icon” 2503 on the Player 2 side.

  In the subsequent step S2213, based on the result of the janken win / loss determination, the predetermined icon as the determination target is deleted from the screen. First, when winning or losing is determined, the loser icon is deleted from the screen 2300.

  In the case of FIG. 25, the “Chocolate icon” 2501 is a loser and is therefore deleted from the screen 2300. If no win / loss is determined, that is, “Aiko”, both icons are deleted from the screen 2300. However, when a support character is attached to the icon that becomes “Aiko” (like the choke icon in FIG. 25), the icon on the side where the support character exists is determined as the winner. In addition, when a support character is attached to both icons, it is handled in the same manner as a normal “Aiko”.

  If the winner is a late icon, the icon sets a new goal. This target position is an icon position where the icon in the partner icon group is dominant. This example is shown in FIG.

  FIG. 26 shows a state in which the icon 2502 that is the late icon wins by the janken win / loss determination, and then a position 2602 is set as a new target position. An arrow 2601 indicates a trajectory from the current position of the icon 2502 to the target position. An icon 2602 indicated by a dotted line indicates a state when the icon 2502 has moved to the target position.

  Next, in step S2214, it is determined whether or not a certain period has elapsed after icon deletion. If the predetermined period has not elapsed (“NO” in step S2214), the process proceeds to step S2215, and it is determined whether or not a target attainment icon exists. On the other hand, if the predetermined period has elapsed (“YES” in step S2214), the process proceeds to step S2216.

  Here, when winning or losing is determined in the winning / losing determination in step S2212, and only the loser icon is deleted in step S2213, the winner icon reaches the target position before a certain period of time elapses. On the other hand, if both icons disappear as “Aiko”, the process proceeds to step S2216 after a certain period of time has elapsed.

  If it is determined in step S2215 that there is a goal attainment icon (“YES” in step S2215), the process proceeds to step S2211. In step S2216, the icon group corresponding to the icon deleted in step S2213 is supplemented to the corresponding icon group. For example, the icon 1901 shown in FIG. 19 is erased according to the result of the win / loss determination, but is replenished to the icon group 2303 after a certain period. After the icon is replenished, the process proceeds to step S2203. That is, in this embodiment, once an icon is deleted, a new button operation is not accepted until the deleted icon is replenished after a certain period of time.

  In step S2211, the player on the side having the icon that has reached the goal is determined as the winner, the win / loss in shuriken janken is determined, the process ends, and the process returns to FIG.

  In the above description, after the button operation is first received in step S2203, it is determined whether the icon movement is started on the condition that the next button operation is received in step S2205. After that, if the operation is not accepted for a certain period, the processing after step S2207 may be forcibly performed on the icon at which the selection mark 2305 is located.

  As described above, according to the present embodiment, it is possible to determine victory or defeat based on whether an icon that moves at high speed on the screen according to the operation of the selection button has reached the opponent's position first. In addition, two icons are collided in the middle of movement, and a win / loss determination is performed according to the janken rule. For the icon accompanied by the support character, the movement speed is increased as compared with other icons, and the victory determination is performed even in the case of “Aiko”. Thereby, the player who moved the icon first does not win, and the playability of the game can be improved.

  The above processing (for example, processing according to the flowcharts shown in FIGS. 2, 4, 10, 13, 15, 18, and 22 and necessary game data in the above-described embodiment) and CD- By storing the program in a storage medium such as R, ROM, DVD-ROM, or MO and reading (installing or copying) the program stored in the storage medium, the computer performs the above processing. be able to. Therefore, it is obvious that such a program and a storage medium are also within the scope of the present invention.

It is a figure which shows the basic composition of the game device 100 corresponding to embodiment of invention. It is a flowchart which shows an example of the process corresponding to embodiment of invention. It is a figure which shows an example of the map screen corresponding to embodiment of invention. It is a flowchart which shows an example of the card information reading process corresponding to embodiment of invention. It is a figure which shows an example of the data structure of the character table corresponding to embodiment of invention. It is a figure which shows an example of the screen for card information reading corresponding to embodiment of invention. It is a figure which shows an example of the data structure of the formation information table corresponding to embodiment of invention. It is drawing for demonstrating the formation corresponding to embodiment of invention. It is a figure which shows an example of a data structure of the table 800 corresponding to embodiment of invention. It is a figure which shows an example of the formation screen corresponding to embodiment of invention. It is a flowchart which shows an example of the operation reception process in the event process corresponding to embodiment of invention. It is a figure which shows an example of the event screen for performing the main game corresponding to embodiment of invention. It is a figure which shows an example of the data table which registers the information for performing the screen display of the main game corresponding to embodiment of invention. It is a flowchart which shows an example of the win / loss determination process in the event process corresponding to embodiment of invention. It is a figure which shows an example of the state which the icon groups 1104 and 1105 corresponding to embodiment of invention collided on the meter 1103. It is a flowchart which shows an example of the iko process corresponding to the 1st Embodiment of invention. It is a figure which shows an example of the screen display of the Aiko event start display corresponding to the 1st Embodiment of invention. It is a figure which shows an example of the screen display at the time of the icon process corresponding to the 1st Embodiment of invention. It is a flowchart which shows an example of the transformation janken process corresponding to the 2nd Embodiment of invention. It is a figure which shows an example of the screen display at the time of transformation janken process execution corresponding to the 2nd Embodiment of invention. It is a figure which shows an example of the data structure of the table corresponding to the 2nd Embodiment of invention. It is a figure which shows another example of the screen display at the time of transformation janken process execution corresponding to the 2nd Embodiment of invention. It is a flowchart which shows an example of the shuriken junken process corresponding to the 3rd Embodiment of invention. It is a figure which shows an example of the screen display at the time of shuriken junken process execution corresponding to the 3rd Embodiment of invention. It is a figure for demonstrating the setting of the target position corresponding to the 3rd Embodiment of invention. It is a figure for demonstrating the collision of the icon corresponding to the 3rd Embodiment of invention. It is a figure explaining the setting of the new target position of the late icon corresponding to the 3rd Embodiment of invention.

Explanation of symbols

101 CPU
102 RAM
103 Operation unit 104 Communication I / F
105 ROM
106 Display Unit 107 Sound Processing Unit 108 Speaker 109 Bus 110 Internal Storage Device 111 Game Program 112 Game Data 113 Card Reader 114 Card

Claims (14)

A game device having a display unit and a control unit,
Character storage means for storing a plurality of character data representing characters used in the game;
Main character reading means for reading out character data as a main character from the character storage means in accordance with a player's selection;
A support character reading means for reading out character data as a support character from the character storage means according to a player's selection;
Main character storage means for storing character data read by the main character reading means as main character data;
Support character storage means for storing the character data read by the support character reading means as support character data;
When executed by the control unit, a main game program for executing a main game using main character data and support character data stored in the main character storage unit and the support character storage unit, and the control unit Program storage means for storing a first mini game program for executing a first mini game by being executed and a second mini game program for executing a second mini game by being executed by the control unit When,
Main game execution means for reading out the main game program from the program storage means and using the main character data and support character data stored in the main character storage means and the support character storage means;
Whether the first condition for executing the first mini game or the second condition for executing the second mini game is satisfied while the main game is being executed by the main game executing means. Mini-game execution determination means for determining whether or not
When the mini game execution determining means determines that the first condition is satisfied, the first mini game program is read from the program storage means, the first mini game is executed, and the second condition is satisfied. When it is determined, mini game execution means for reading the second mini game program from the program storage means and executing the second mini game;
A game device comprising:
The character storage means, when the character data is read as a main character, the support character represented by the support character data stored in the support character storage means as a first mini game or a second Stored as containing association data to determine which of the minigames to associate with,
The main game execution means includes a support character stored in the support character storage means based on association data included in main character data stored in the main character storage means, and the first mini game or the second mini game. Display the association on the display so that the player can recognize it,
The mini game execution means includes:
Association for determining whether the support character stored in the support character storage means is associated with the currently executed mini game based on the association by the association data included in the main character data stored in the main character storage means Judgment means,
When it is determined by the association determining means that the support character stored in the support character storage means is associated with the currently executed mini game, a process for preferentially treating the player in the currently executed mini game is performed. Preferential treatment,
A game device comprising: The game device according to claim 1,
The main game executed by the main game execution means is a game that makes a win / loss determination using at least three selection targets in which relative superiority or inferiority is cyclically determined in advance.
The support character is associated with any of the at least three selection targets;
The first set of the three selection targets associated with the first main character of the first player and the 3 associated with the second main character of the second player moving at a predetermined moving speed. First display control means for displaying a first display screen including a second set of two selection targets on the display unit;
Operating means for accepting designation for each of the three selection targets;
A first head selection object and a second head selection object positioned at the head in each movement direction of the first set and the second set are respectively determined based on designation of the selection object by the operation means. And means for determining
Whether or not the first set and the second set are displayed in a collision manner on the first display screen is determined based on the movement distance from each movement start position of the first set and the second set. First determination means for determining
A first determination unit configured to determine whether the first head selection target and the second head selection target are winning or losing based on the relative superiority or inferiority when the first determination unit determines that the collision display is performed; The game apparatus according to claim 1, further comprising a win / loss determination unit. The first mini-game is a mini-game that is executed when the first win / loss determination means is the same selection target for the first head selection target and the second head selection target and the winning / losing cannot be determined. Because
The game apparatus according to claim 2, wherein in the first mini game, an operation for the operation unit is further received, and the winning / losing is determined based on the received number of operations. The first winning / losing judging means
Distance calculating means for recalculating the moving distances of the first set and the second set based on the number of operations received at regular intervals in the first mini game;
Position determining means for determining whether the first set or the second set has been moved to a position that coincides with each of the movement start positions based on the movement distance;
By the position determination means,
When it is determined that the first set has been moved to a position corresponding to the movement start position corresponding to the first set, the first set is defeated and the second set is lost. The set is determined to win,
When it is determined that the second set has been moved to a position corresponding to the movement start position corresponding to the second set, the second set is defeated in the first mini game, and the first set The game apparatus according to claim 3, wherein the set is determined to be a win.   The preferential means is a head selection in which it is determined that the support character is associated with the first mini game by the association determining means, and the support character is determined to be undecidable by the first win / loss determining means. 5. The method according to claim 4, wherein, when assigned to an object, the distance calculating means calculates the moving distance of the set to which the support character belongs by weighting the number of operations. Game device. The second mini game is a mini game that is executed when a first selection target determined to be won by the first win / loss determination means is a predetermined selection target, and the game device includes:
A third set of the three selection targets associated with the first main character and a fourth set of the three selection targets associated with the second main character that move at a predetermined moving speed. A second display control means for displaying a second display screen including:
A second head selection object and a fourth head selection object positioned at the head in each movement direction of the third set and the fourth set are respectively determined based on designation of the selection object by the operation means. And means for determining
Second determination means for determining whether or not the third set and the fourth set are collision-displayed on the second display screen;
A second determination unit configured to determine whether the third head selection target and the fourth head selection target are winning or losing based on the relative superiority or inferiority when the second determination unit determines that the collision display is performed; Win-loss determination means,
Third determination means for determining a head selection target whose number of times determined to be lost or aiko has reached a predetermined number by the second win / loss determination means;
6. The apparatus according to claim 2, further comprising third winning / losing determining means that determines that the set having the first selection target determined to have reached the predetermined number of times by the third determining means is lost. Game device. The preferential means is determined when the support character is determined to be associated with the second mini game by the association determining means, and when the support character is assigned to the predetermined selection target,
The third determining means is configured to determine the predetermined number of times larger than that of the other selection targets for a selection target that matches the predetermined selection target of the set to which the support character belongs. The game device according to claim 6. The program storage means stores a third mini game program in which a third mini game is executed by being executed by the control unit, and the third mini game is stored in the first set or the second set. A mini game that is executed when the number of wins of the player of the set reaches a predetermined value, the game device comprising:
A third display screen including a fifth set of the three selection targets associated with the first main character and a sixth set of the three selection targets associated with the second main character 3rd display control means to display on the display part,
Candidate determining means for determining, for each set, a first movement candidate and a second movement candidate for moving the display position among the three selection targets included in the fifth set and the sixth set. ,
Target position determining means for respectively determining a first target position and a second target position for moving the first movement candidate and the second movement candidate;
When the first movement candidate is moved toward the first target position and the second movement candidate is moved toward the second target position, the first movement candidate and the first movement candidate Third determination means for determining whether or not the two movement candidates have approached a predetermined distance;
Fourth winning / losing determining means for performing a winning / losing determination on the first movement candidate and the second moving candidate based on the relative superiority / demerit relationship when it is determined that the third determining means has approached. The game apparatus according to claim 2, further comprising:   The preferential means, when the association determining means determines that the support character is associated with the third mini game, the preferential means performs the fourth win / loss determining means, For a movement candidate that matches the selection target to which the support character is assigned, if the movement candidate of the opponent determined to be approaching by the third determination means is the same selection target, the selection to which the support character is assigned The game apparatus according to claim 8, wherein the movement candidate that matches the target is determined to be a winner. When the fourth winning / losing determining means determines that the first moving candidate has been lost, the third display control means deletes the display of the first moving candidate from the third display screen. ,
When the fourth winning / losing determining means determines that the second moving candidate is defeated, the third display control means erases the display of the second moving candidate from the third display screen. ,
The third display control means erases both the display of the first and second movement candidates from the third display screen when winning or losing is not determined by the fourth winning / losing determining means. The game device according to claim 8 or 9.   The first movement candidate has reached the first target position set at the initial display position of any of the three selection targets in the second set, or the second movement candidate A fifth win / loss determining means for performing a win / loss determination based on whether the second target position set at the initial display position of any of the three selection targets in the first set has been reached. The game apparatus according to claim 8, further comprising: The target position determining means includes
In the case where the first movement candidate is determined first in the candidate determination means, the first target position is determined based on the first movement candidate among the three selection targets of the second set. Set the display position of the selection target to be dominant based on relative superiority,
The second target position is set to a position that approaches the first movement candidate to the predetermined distance when the first movement candidate is moved to the first target position. The game device according to claim 8, wherein the game device is any one of claims 8 to 11. The target position determining means approaches the second target position to the predetermined distance when the first movement candidate moves to the first target position. Set to the position,
When the fourth win / loss determination unit determines that the second movement candidate is a win,
The target position determination means further determines the second target position as one of the three selection targets of the first set , and the second movement candidate has the relative superiority or inferiority relationship. The game apparatus according to claim 12, wherein the display device is changed to an initial display position of a selection target that becomes dominant based on the selection. A display unit;
A control unit;
Character storage means for storing a plurality of character data representing characters used in the game;
Main character storage means for storing character data as main character data;
Support character storage means for storing character data as support character data;
When executed by the control unit, a main game program for executing a main game using main character data and support character data stored in the main character storage unit and the support character storage unit, and the control unit Program storage means for storing a first mini game program for executing a first mini game by being executed and a second mini game program for executing a second mini game by being executed by the control unit When,
The control unit of the game device having
Main character reading means for reading out character data as a main character from the character storage means in accordance with a player's selection;
Support character reading means for reading out character data as a support character from the character storage means in accordance with a player's selection;
Main character storage control means for storing character data read by the main character reading means as main character data in the main character storage means;
Support character storage control means for storing character data read by the support character reading means in the support character storage means as support character data;
Main game execution means for reading out the main game program from the program storage means and using the main character data and support character data stored in the main character storage means and the support character storage means;
Whether the first condition for executing the first mini game or the second condition for executing the second mini game is satisfied while the main game is being executed by the main game executing means. Mini-game execution judging means for judging whether
When the mini game execution determining means determines that the first condition is satisfied, the first mini game program is read from the program storage means, the first mini game is executed, and the second condition is satisfied. When it is determined, mini game execution means for reading the second mini game program from the program storage means and executing the second mini game;
A computer program that functions as
The character storage means, when the character data is read as a main character, the support character represented by the support character data stored in the support character storage means as a first mini game or a second Stored as containing association data to determine which of the minigames to associate with,
The main game execution means includes a support character stored in the support character storage means based on association data included in main character data stored in the main character storage means, and the first mini game or the second mini game. Display the association on the display so that the player can recognize it,
The computer program further includes the mini game execution means,
Association for determining whether the support character stored in the support character storage means is associated with the currently executed mini game based on the association by the association data included in the main character data stored in the main character storage means Judgment means,
When it is determined by the association determining means that the support character stored in the support character storage means is associated with the currently executed mini game, a process for preferentially treating the player in the currently executed mini game is performed. Preferential treatment,
A computer program that functions as a computer program.