JP3825305B2 - Competitive game device having game play manager and game program storage medium - Google Patents

Description

[0001]
[Industrial application fields]
  The present invention relates to a competitive game apparatus and an information storage medium storing a competitive game program. More specifically, in a competitive game in which a plurality of players simultaneously operate characters assigned to each other to compete for victory or defeat, The present invention relates to a battle-type game apparatus having a game play manager that guides the player to the progress of a game and a storage medium storing a game program so that more than the number of players who can play simultaneously can participate in the game in order according to a predetermined rule.
[0002]
[Prior art]
  Conventionally, multiple playersofIn a competitive game in which each player operates with a character, car, fighter, etc. (hereinafter collectively referred to as “character”), if more than the number of players who can play simultaneously in the game enjoy the game, the player is inevitable The game participation group that can participate in the game and the game waiting group that cannot participate are divided. In such a case, each time a game in the game participation group ends with a predetermined rule, the player enters the game waiting group, while each player in the game waiting group enters the game participation group in accordance with the predetermined rule. Is trying to participate in the game.
[0003]
  In addition, as a rule for a player to change from a game participation group to a game waiting group, for example, a win that is replaced by a person who wins at the end of each game and a defeat that is replaced by a person who has lost at the end of each game There are two ways. In any of these two cases, the change from the game waiting group to the game participation group is the same as the order of entering the game waiting group. In addition, when a game waiting group is created, the order of switching to the game participation group is appropriately determined.
[0004]
[Problems to be solved by the invention]
  In this way, even if rules for changing the order between the game participation group and the game waiting group are determined in advance, if the number of players participating in the game is large, the number of replacements as the game progresses over time. When the number increases, the replacement order that is originally determined by the rule is not known, which causes confusion for the players. Furthermore, in such a case, the player basically has a strong desire to continue the game, so when such a mess occurs, the players have distrust and can enjoy the game. Disappear.
[0005]
  Further, in order to obtain operability that the user likes, each player customizes the operability for the character according to his / her preference. However, after exiting the game participation group, entering the game waiting group, and entering the game participation group again after a predetermined number of games, the character operability needs to be re-customized. There is. As mentioned above, if the number of players is large or the game takes a long time, it takes time to rejoin the game, forgetting the contents of customization, and rejoining even if you remember Each time you need to re-customize it, it's cumbersome.
[0006]
  Since such re-customization occurs every time the player changes, the time until the next player changes and the game is started becomes longer. And every time the game is restarted, the extra time is accumulated, the time it takes to enter the game waiting group from the game participation group and return to the game participation group again becomes longer, and waiting is even more severe. turn into.
[0007]
  Therefore, the main object of the present invention is to provide guidance for a player who participates in a game from a game waiting group for each game to be started according to a predetermined rule, and to make a character corresponding to the player appear in the game field. Another object of the present invention is to provide a battle type game apparatus equipped with a game play manager and a storage medium storing a game program that enables game play of a simple player.
[0008]
  Another object of the present invention is to provide a battle-type game apparatus and game program that can increase the fun of a game more quickly by allowing a player to make a character or the like appear in a game field with operability customized in advance. It is to provide a stored storage medium.
[0009]
[Means for Solving the Problems and Effects of the Invention]
  A first invention is a competitive game apparatus in which each player operates a predetermined number of controllers to compete for victory and defeat, and more players than the predetermined number can play while changing according to a predetermined rule,
  A player information receiver for receiving player information for identifying each of the players;
  A first game participation priority setting device for setting a first game participation priority that is an information sequence indicating a priority in which the players can participate in the game;
  According to the first game participation priority order, the player information of the players more than the predetermined number is selected by the number of players who can play the game, and the player information of the players allowed to participate in the game and the players are selected. A player sorter for sorting into a game participation group including information indicating a controller to be assigned, and a game waiting group including player information of at least one player who is not permitted to participate in the game;
  Based on the game result, the second game participation that sets the game continuation priority, which is an information string indicating the priority in which each of the players corresponding to the player information included in the game participation group can continue to play the game A priority setter;
  FIG. 6 is an information string indicating a priority order in which each of the players corresponding to player information for a number of players that is not more than the predetermined number selected from the game participation group can play a game based on the first game continuation priority order; The second game participation priority is set lower than the first game participation priority, and the player information of the player is moved to the game waiting group, and is moved from the game participation group to the game waiting group. A priority reviewer that updates the game participation group by moving player information corresponding to the number of players corresponding to the player information from the higher first game participation priority to the game participation group.When,
  Display means for displaying player information included in the updated game participation group and information indicating a controller assigned to the players;Is provided.
[0010]
  As described above, in the first invention, it is possible to determine a player who participates in each game and a controller to be used by the player.At the same time, the controller to be used can be notified together with whether or not the player can participate in the game.
[0013]
  First2This invention further comprises game play attribute setting means for setting a game play attribute for each player included in the game participation group.
[0014]
  First3The invention of the2In this invention, when the player information for the number of players is moved from the higher first game participation priority to the game participation group, game play attributes are set.Attribute determination meansIs further executed.
[0015]
  First4According to the present invention, a computer storing a game program for controlling a battle-type game apparatus in which each player operates a predetermined number of controllers to compete for victory and defeat, and more players than the predetermined number can play while changing according to a predetermined rule. A readable information storage medium,
  Receiving player information identifying each of the players;
  Setting a first game participation priority order, which is an information string indicating a priority order in which the players can participate in the game;
  Storing the first game participation priority;
  According to the first game participation priority order, the player information of the players more than the predetermined number is selected by the number of players who can play the game, and the player information of the players allowed to participate in the game and the players are selected. Selecting a game participation group including information indicating an assigned controller and a game waiting group including player information of at least one player who is not permitted to participate in the game;
  Setting a game continuation priority, which is an information string indicating a priority in which each of the players corresponding to the player information included in the game participation group can play the game continuously, based on the game result;
  FIG. 6 is an information string indicating a priority order in which each of the players corresponding to player information for a number of players that is not more than the predetermined number selected from the game participation group can play a game based on the first game continuation priority order; The second game participation priority is set lower than the first game participation priority, and the player information of the player is moved to the game waiting group, and is moved from the game participation group to the game waiting group. The step of updating the game participation group by moving the player information corresponding to the number of players corresponding to the player information from the higher first game participation priority to the game participation group.When,
  A display step for displaying player information included in the updated game participation group and information indicating a controller assigned to the players;Is executed by the competitive game apparatus.
[0016]
  First4In the invention of the first inventionAlsoHas the same effect as.
[0017]
DETAILED DESCRIPTION OF THE INVENTION
  FIG. 1 shows a competitive game apparatus according to the present invention.ofThe configuration is shown. The competitive game apparatus GC includes a recording medium M, an information reader DV, an AV processor AVP, a RAM 2, a monitor VM, a speaker LS, a controller CTL, and a CPU 1. The recording medium M is preferably configured by means capable of stably holding information, such as an optical disk, a magnetic disk, or a semiconductor memory, so that the competitive game apparatus GC executes the competitive game according to the present invention. Information such as necessary programs is stored. The information reader DV outputs it to the AV processor AVP that has read the upper one from the recording medium M. The AV processor AVP is controlled by the CPU 1 to perform AV processing on information input from the information reader DV, generate AV signals necessary for executing the battle game, and output them to the monitor VM and the speaker LS, respectively. To do. A plurality of controllers CTL, which are means for a user to operate and input instructions to the competitive game apparatus GC, are connected to the competitive game apparatus GC. Note that the number of controllers CTL that can be connected to the competitive game apparatus GC is the maximum number of players that can simultaneously compete in the competitive game according to the present invention.
[0018]
  In the figure, three controllers CTL1 to CTL3 are shown connected to the battle game device GC, but any number of controllers CTL can be connected within the limits of the battle game device GC. Thus, as many players as the number of controller CTLs can play a game simultaneously. The controller CTL has a function different from the cursor key Kc for moving a character on the game screen displayed on the monitor VM, responding to an inquiry from the competitive game apparatus GC, or giving an instruction. Button keys Ba, Bb, and Bc are provided. These keys are generally referred to as a cross key, A button, B button, and C button, respectively. During the execution of the competitive game according to the present invention, the player's instruction to the competitive game apparatus GC is basically performed by operating the keys of the controller CTL.
[0019]
  The RAM 2 is basically a volatile memory, and is used for storing temporary files generated by the CPU 1 and the AV processor AVP during execution of the game process. These temporary files include the game of the game according to the present invention and various parameters. Furthermore, a non-volatile memory is used for storing data generated during the game that needs to be kept after the game is over. This non-volatile memory can be stored uniquely for each game program, preferably by providing a flash ram (not shown) in part of the recording medium M.
[0020]
  Next, referring to the flowcharts shown in FIGS. 2 and 3, the tables shown in FIGS. 4 to 8, and the image examples displayed on the monitor VM shown in FIGS. 9 to 28, the competitive game according to the present invention. The operation of the device GC will be described. In the competitive game apparatus GC, when the recording medium M is attached to the information reader DV and the operation of the competitive game apparatus GC is started, the program is read from the recording medium M and the game starts.
[0021]
  First, in step S2, it is detected that the player has selected one of the game modes provided by the competitive game apparatus GC. In response to the detection, the process proceeds to the next step S4. Specifically, a “top menu” screen as illustrated in FIG. 9 is displayed on the monitor. The top menu lists game modes that can be played, and prompts the player to select one of them. In this example, five game modes of “one game”, “match game”, “figure”, “option”, and “data collection” are presented as options.
[0022]
  “Single game” is a mode in which one player operates and plays against the opponent game device GC. “Competitive game” allows a plurality of players to simultaneously fight characters assigned to each other. "Figure" is a mode in which the player can view images as rewards according to the battle record, and "Option" is a mode in which the player can make various settings provided by the competitive game apparatus GC. The “data collection” is a mode in which various data relating to the game can be referred to.
[0023]
  In the present invention, there is a remarkable feature in the operation related to the “battle game” mode. Therefore, while only the “matching game” mode will be described in detail, description of operations related to the other five types of modes that are the same as those in the conventional battle type game apparatus will be omitted. In other words, the operation according to the present invention is started when the player selects the “battle game” mode in this step.
[0024]
  In step S4, it is determined whether or not the game mode selected by the player is “matching game”. Only when “battle game” is selected in step S2, it is determined Yes and the process proceeds to the next step S6.
[0025]
  In step S6, the method selected by the player from among the various battle methods in the “battle game” mode is detected. In response to the detection, the process proceeds to the next step S8. Specifically, a “match game” menu screen as illustrated in FIG. 10 is displayed on the monitor. In the “matching game”, five options of “great scuffle”, “tournament scuffle”, “special scuffle”, “change rule”, and “name registration” are presented.
[0026]
  “Great Brawl” and “Special Brawl” are battles that do not involve changing the player, “Rule Change” is a function that allows the player to change the battle rules, and “Tournament Brawl” is a battle that involves changing the player. "Name registration" is a function for registering the player's name so that the player can enter the battle game. In the present invention, the main purpose is to provide guidance so that more players than the number of players who can play simultaneously can be played in order according to a predetermined rule, so “name registration” or “ Only the case where “tournament brawl” is selected will be described, and the processing in the case where the other case is selected is the same as in the conventional case, and the description thereof will be omitted.
[0027]
  In step S8, it is first determined whether or not "name registration" has been selected. In step S6, if “select name” is selected, it is determined Yes and the process proceeds to step S10. On the other hand, when it is determined No, the process proceeds to step S16.
[0028]
  In step S10, it is possible to receive information (player information PI) of players who newly participate in the game. Specifically, a “name registration” menu screen as illustrated in FIG. 11 is displayed on the monitor. In the “name registration” menu, three functions of “new” registration, “arrangement” on the screen of registered names, and “deletion” of registered names are prepared. In the present invention, the case of “new” registration will be described as an example. As for “deletion” and “arrangement”, the registered names are simply deleted or the registered names are rearranged according to a predetermined standard, and are not a feature of the present invention. Omit.
[0029]
  In the competitive game according to the present invention, it is necessary to give unique guidance to a plurality of players participating in the game. Therefore, in order to correctly set the player information PI for individually identifying the player, it is possible to accept input of various information constituting the player information PI by the player. The player information PI is roughly classified into two types: a player name (hereinafter “player name PN”) and a player name attribute PNA. The player name PN is a unit that is independently entered into the game. The player name attribute PNA is information individually assigned to the player name PN, and typically includes a character that acts as an incarnation of the player during the game. Further, various functions can be additionally set in order to make the character wait for individuality or improve the operability of the player, and such functions are also included in the player name attribute PNA. In this sense, the player name PN is information that serves as a key for all functions provided individually to the player in the game.
[0030]
  In the present invention, guidance relating to game progress including replacement and change of the player name attribute PNA is performed in units of the player name PN. The player name attribute PNA is a parameter for providing a player with a more comfortable game play environment by adding unique functions and effects to the game for each player name PN. That is, in step S10, the player name PN can be input first by selecting “new” on the “name registration” menu screen shown in FIG. Then, the process proceeds to the next step S12.
[0031]
  In step S12, the player inputs and registers a desired player name PN on the software keyboard screen illustrated in FIG. Then, the process proceeds to the next step S14.
[0032]
  In step S14, as illustrated in FIG. 13, ON / OFF of the vibration function of the controller is set and registered as one of the player name attributes PNA. Note that ON / OFF with respect to the controller is transmitted to the player by vibration of the controller according to the battle state of the character operated in units of the player name PN. Further, although not shown, as an example of a further player name attribute PNA, a specific character is assigned to the player name PN as described above. Similarly, other player name attributes PNA are set here. Then, the process returns to step S6 described above, and again prompts the player to select a method in the battle mode. If “name registration” is not selected in step S8, the process proceeds to step S16.
[0033]
  By repeating the processes of steps S6, S8, S10, S12, and S14 described above, the player name information PNI having the configuration illustrated in FIG. 4 is completed. As shown in the figure, in the player name information PNI, the player name PN is used as a key, and a default value of each player name attribute PNA is set for the key. That is, the player name PN is “Yamada”, “Sansu”, “Sankon”, “Ruru”, “Oh”, “Dainosa”, “Harry”, “Nania”, and “Buchako” in step S12. "Can be arbitrarily input according to the preference of the player.
[0034]
  On the other hand, the player name attribute PNA has items of “character”, “vibration”, “blow”, “jump”, and “defense”, which are selected from those prepared in advance in the competitive game apparatus GC in step S14. Input. If the play name is “Yamada” as an example, “Link”, “ON”, “A button”, “B button”, and “C button” are set as the player name attribute PNA assigned to “Yamada”. Has been. The “A button”, “B button”, and “C button” preferably mean input buttons provided on the controller of the competitive game apparatus GC, and are set as buttons when these buttons are operated.WasThe attribute becomes valid. Note that the player information PI is also basic data that is recorded in a non-volatile memory inside the competitive game apparatus GC, and that gradually grows as more players are registered.
[0035]
  Returning to FIG. 2, in step S16, it is determined No until “tournament brawl” is selected in step S6, and the process returns to step S2. On the other hand, if “tournament brawl” is selected, it is determined Yes and the process proceeds to the next step S18.
[0036]
  In step S18, input of player replacement condition information (player replacement condition), which is the basis for providing replacement guidance to the player, which is the main object of the present invention, is accepted. As the player change conditions, as exemplified in FIGS. 14 and 15, five types of parameters of “match method”, “number of entries”, “number of simultaneous battles”, “number of players to leave”, and “stage selection” are provided. Is prepared.
[0037]
  The “competition method” is a parameter that specifies how to determine a player who is a player in the game participation group and cannot substitute for a player in the next game waiting group. “Number of entries” is the number of player names PN who wish to participate (entry) in the game. The “simultaneous number of players” is the number of player names PN that compete at the same time in the game. Note that the maximum value of the “number of simultaneous players” is the number of controllers that can be connected to the game, and the minimum value is 2. “Stage select” is a parameter that defines the game stage starting after the finished game. It should be noted that “stage selection” is not a feature of the present invention and will not be described.
[0038]
  In this example, in the example shown in FIG. 14, the “matching method” is a “winning” replacement in which the player who has won the game (player name PN) is replaced with a player in the game waiting group in the next game. Indicates that is selected. Further, it is shown that “entry number” is set to 9, “simultaneous number of players” is set to 3, “number of players to leave” is set to 1, and “stage select” is set at random. In addition, when the “number of players to leave” is two or more, it is specified that two players selected in order of winning in the game participation group are replaced.
[0039]
  Further, in the example shown in FIG. 15, as the “matching method”, “losing” replacement is selected in which the player who lost the game (player name PN) is replaced with a player in the game waiting group in the next game. If the “number of players to leave” is two or more, the same contents as the example shown in FIG. 14 are specified except that two players selected in the losing order in the game participation group are replaced. Yes. In the present embodiment, one of two types, “winning” and “losing” is set as the “matching method”. Then, the process proceeds to the next step S21.
[0040]
  Further, in step S18, a memory map MM having a configuration illustrated in FIG. 5 is generated based on the input information. The memory map MM has items of “matching method”, “simultaneous number of players”, “number of entries”, and “number of players leaving”, and each stores parameters according to the input result of step S18. That is, in this example, the “matching method” of the memory map MM stores “1” when winning and “0” is stored when losing. The remaining parameters are 3, 9, and 1 as input in step S18.
[0041]
  In step S21, with reference to the parameters of the memory map MM, a first play order queue Q1 indicating the priority of game participation of all players who want to participate in the competitive game is generated. Before describing the first play order queue Q1, the play order queue Q will be described first. As shown in FIG. 6, the play order queue Q includes an entry field for receiving a player participating in the game and a character field assigned to each of the entries. In other words, it is information that prepares as many players as the number of players who will participate as incarnations of players in a competitive game, and associates the prepared characters with the players.
[0042]
  In the present invention, the contents of the play order queue Q play different roles before the start of the battle game, during the battle after the start, and immediately before the next game starts after the game ends, There is a slight difference in the generation method, and they are identified as the first play order queue Q1, the second play order queue Q2, and the third play order queue Q3. First, in step S18, the first play order queue Q1 is generated when a basic condition for guiding a player change is determined in the competitive game. That is, only the number of people to be entered is known, and characters that can be operated in the game for that number of people are selected. Specifically, guests 0 to 8 are set in the entry field, and the character selection for each guest is performed based on a random number. As a result, the character face of the character participating in the game is changed. Then, the process proceeds to the next step S26.
[0043]
  In step S26, the player starts accepting registration of the player name PN and the character by the number of players specified by the “number of entries” set in step S18. Specifically, as illustrated in FIG. 16, the guest (entry) fields of the input items guest 0 to guest 8 for setting the player names PN for nine players who enter the game, set in step S18, and A window for selecting a character assigned to each guest is displayed on the monitor. More specifically, by registering the player name desired by the player in the entry field of the first play order queue Q1 generated in step S21, the character operated by the player is determined. Then, the process proceeds to the next step S41.
[0044]
  In step S41, a confirmation input for registration of the player name / character in step S26 or player information / selected character registration in step S40 described later is detected. Then, the process proceeds to the next step S42. Specifically, as illustrated in FIG. 18, the combination of the player name PN and the character is displayed on the monitor, and the player is requested to confirm whether or not the combination may be registered. With the player's response input to this request, the presence or absence of registration confirmation is detected.
[0045]
  In step S42, the confirmation detected in step S41.In recognitionFirst, it is determined whether or not the player information PI (player name PN and character) is to be determined for all guests displayed in the guest column in step S26. In the example shown in FIG. 17, if “No” is selected, the process proceeds to step S28.
[0046]
  In step S <b> 28, it is determined whether or not the existing player information PI already set in steps S <b> 10 to S <b> 14 is diverted to the guest who is to set the player name PN. Specifically, when diverting, “read” is selected by the player as illustrated in FIG. On the other hand, when the player information PI is newly input, “new” is selected for the guest 7 as illustrated in FIG. If “new” is selected, it is determined No and the process proceeds to step S30.
[0047]
  In step S30, an input of a player name PN assigned to a target guest is accepted. Specifically, the desired player name PN input by the player using the software keyboard is registered as in step S10 described above. Then, the process proceeds to the next step S32.
[0048]
  In step S32, the character selected by the player is assigned to the player name PN registered in step S30. Then, the process proceeds to the next step S34.
[0049]
  In step S34, as in step S14 described above, the player name attribute PNA selected by the player is registered for the player name PN registered in step S30. Then, the process proceeds to step S40.
[0050]
  On the other hand, if “read” is selected in step S28, it is determined Yes and the process proceeds to step S36.
[0051]
  In step S36, the player name PN of the player information PI set and registered in steps S10 to S14 described above is read and displayed on the monitor. Specifically, as illustrated in FIG. 21, on behalf of the player information PI that can be selected for the guest 0, there are ten types of existing player names PN (Yamada, Sansuu, Sankon, Ruru, Oh, Daisanso, Harry, Ninya, Buchako, Takeshi) are displayed. Then, the process proceeds to the next step S38.
[0052]
  In step S38, in response to the player selecting one of the ten existing player names PN displayed in step S36 and selecting a character to be assigned to the player name PN, the guest (game entry) The player name PN for is determined. Note that the player attribute has already been registered in the above-described step S14 for the player name PN selected in this step. Then, the process proceeds to the next step S40.
[0053]
  In step S40, the player information PI for the game entry determined through step S34 or step S38 is copied to the queue table. And a process can return to above-mentioned step S42.
[0054]
  In addition, after the process of the above-mentioned step S28-S40 is repeated and player information PI is determined with respect to all the entries (guests), it is judged Yes in step S42. That is, at this time, the second play order queue Q2 is completed. As shown in FIG. 7, the second play order queue Q2 sets a player name for each of the guest 0 to guest 8 in the entry column of the first play order queue Q1 described above. Assign a specific character. If the player information PI is already stored in the competitive game apparatus GC, the player name stored in the player information PI is selected in the entry field (Yes in S28) and assigned to the player name. Is automatically set in place of the character assigned in the first play order queue Q1.
[0055]
  If the player information PI is not accumulated (No in S28), it is possible to arbitrarily set a play other than the character set in the first play order queue Q1. Note that the combination of the entry and the character in the second play order queue Q2 shown in FIG. 7 is the same as that in the first play order queue Q1, but this is a result theory and the generation process is different. is there. Then, the process proceeds to the next step S43.
[0056]
  In step S43, all the player names PN that have been entered are assigned priorities to participate in the game in accordance with a predetermined rule, and the player names PN whose priority is within the number of simultaneous opponents set in step S18 are assigned to the game. A player selection is performed in which the remaining player names PN are divided into game waiting groups as participating groups. Note that one of the rules for assigning priority order includes determining the order based on the registration order of the player names PN, and further determining the order using a random number.
[0057]
  For example, the second play order queue Q2 is shuffled to generate a third play order queue Q3 in which the entry order is changed. By doing so, it is to prevent the player from entering the game participation group in the order in which the entries are registered in the above-described steps S42, S28, and S30 to S40. In addition, as illustrated in FIG. 8, the order of “Ruru” and “Sankon” in the second play order queue Q2 is switched in the third play order queue Q3 due to the shuffle in step S43. Yes. Then, the process proceeds to the next step S44.
[0058]
  In step S44, based on the third play order queue Q3, the priority order of all players, the player name PN of the game participation group, and the player name PN of the game waiting group are displayed on the monitor. Furthermore, the player names PN of the game participation groups are displayed together with the corresponding characters, and by prompting the players corresponding to the player names PN to prepare for the game start, all the players who have entered the game , Give appropriate guidance on game participation in a timely manner. Note that the above-described game name attribute is read out and prepared for the player name PN of the game participation group.
[0059]
  Specifically, the guidance at the time of “winning” is illustrated in FIG. In the figure, in the upper part of the screen, the player names PN from the one with the highest priority for participation in the game from the left are “Yamada”, “Ruru”, “Sankon”, “Oh”, “Daiso”, “ "Harry", "Takeshi", "Guest 8", and "Sansu" are displayed in order. Furthermore, since the “Number of simultaneous players” is set to three, “Yamada”, “Ruru” and “Sankon” are the game participating groups, and the remaining “Oh”, “Daiso”, “ It is indicated that “Harry”, “Takeshi”, and “Guest 8” are waiting groups. In addition, “Yamada”, “Ruru”, and “Sankon” are displayed with the corresponding characters “LINK”, “SAMUS”, and “C. FALCON”, respectively. Urging.
[0060]
  On the other hand, FIG. 23 shows a guidance example at the time of “defeat”. Also in the figure, the player names PN are displayed in order from the highest priority in the upper part of the screen and the game participation group and the game waiting group are identified. Further, the player name PN of the game participation group is displayed together with the character, and the player is prompted to participate in the game. Then, the process proceeds to the next step S45.
[0061]
  In step S45, the player can arbitrarily change the player name attribute (character, vibration, batting, jumping, defense, etc.) assigned to the player name among the guidance items. That is to say, each item of the player name attribute PNA included in the third play order queue Q3 can be arbitrarily changed, so that a game that further matches the player's feeling is possible. The player name attribute PNA included in the third play order queue Q3 is changed by reading out the player name attribute PNA included in the player information PI generated at the time of step S42 described above in units of player names PN. Is also possible.
[0062]
  In step S46, the controller management table Tctl is generated by copying from the player name attribute of the third play order queue Q3 by “simultaneous number of players” from the top of the game participation priority. In the controller management table Tctl, the player information PI and the controller CTL corresponding to the player name are instructed. Although not shown in particular, as a method for setting the controller management table Tctl, there is a method in which the player name attribute shown in FIG. 4 is set from the player name in the third play order queue Q3. Then, the process proceeds to the next step S47.
[0063]
  In step S47, in such a state, each player presses the “A button” provided in each controller, the game starts, and the players with the respective player names play against the assigned characters. Then, the process proceeds to the next step S48.
[0064]
  In step S48, the game is over when the game is over and the game is over. Then, the process proceeds to the next step S50. FIG. 24 illustrates a screen at the end of the game.
[0065]
  In step S50, the game result is announced on the monitor. FIG. 25 exemplifies a game result announced in the case of winning. In the figure, the characters “SAMUS”, “C. FALCON”, and “LINK” are won in order. further,
FIG. 26 exemplifies a game result announced in the case of losing. In the figure, the characters “MARIO”, “PURIN”, and “KOOPA” are won in this order. Then, the process proceeds to the next step S54.
[0066]
  In step S54, the value of the battle method parameter PM set in step S22 or S24 described above is read from the memory map MM. Then, the process proceeds to the next step S54. Furthermore, the player's entry order in the third play order queue Q3 is updated according to the value of the battle method parameter PM, and the fourth play order queue Q4 is generated. The player queue indicating the priority order of the players belonging to the game participation group and the game waiting group is adjusted. That is, if the value of the battle method parameter PM is 0, the game is won. In the example shown in FIG. 25, in the next game, “SAMUS”, that is, the player name “PN” is “Ru Lou”. The player name PN having the first priority is changed to “Oh” and the entry order is updated so as to be positioned at the end of the game waiting group.
[0067]
  On the other hand, if the value of the battle method parameter PM is 0, the game is not lost, so in the example shown in FIG. 26, in the next game, “KOOPA”, that is, the player name PN “Harry” is the game waiting group. The entry order is updated so that the player name PN “Takeshi” in the first priority is replaced and positioned at the end of the game waiting group. Then, the process proceeds to step S44 described above. Although the contents of the fourth play order queue Q4 are not shown in particular, they can be easily seen from FIGS. 25 and 26 described above.
[0068]
  In step S44, based on the fourth play order queue Q4 generated in step S54, the priority order of all the entered player names PN, the player names PN of the game participation group, and the like, as described above, The player name PN of the game waiting group is displayed on the monitor. In the case of winning the game, as exemplified in FIG. 27, the player names PN participating in the current game are “Yamada”, “Oh”, and “Sankon”, and the priority order in the game waiting group Are “Dainasso”, “Harry”, “Takeshi”, “Guest 8”, “Sansu”, and “Lu Lou”.
[0069]
  Also, in the case of losing, as illustrated in FIG. 28, the player names PN participating in this game are “Takeshi”, “Sansu”, and “Dainaso”, and the priority in the game waiting group is “Guest 8”, “Sankon”, “Yamada”, “Ruru”, and “Harry”. In this way, guidance is given so that the player can appropriately change for each game based on the condition (MM) set in step S18, and the game environment is automatically set for each player name PN represented by vibration. To be arranged.
[0070]
  Of course, if “Number of players to leave” is set to two, “Ru Lou” and “Sankon” will be replaced with “Ah” and “Dainosa” in the game waiting group in “Katsu Nuke”. Yes. Furthermore, in “Lose”, “Harry” and “Dainoso” are replaced with “Takeshi” and “Guest 8” of the game waiting group.
[0071]
  With the configuration as described above, in the competitive game apparatus according to the present invention, for each game to be started, a player who participates in the game is guided from the game waiting group and corresponds to the player according to a predetermined rule. A character can appear in the game field and a game play of a legitimate player becomes possible.
[0072]
  In addition, by allowing the player to appear in the game field in a state in which the player has been customized in advance, it is possible to increase the fun of the game more quickly. Furthermore, since the contents automatically customized can be changed before the game starts, it is possible to play according to the feeling of the player.
[Brief description of the drawings]
FIG. 1 is a block diagram showing a configuration of a competitive game apparatus according to the present invention.
FIG. 2 is a part of a flowchart showing the operation of the competitive game apparatus shown in FIG.
3 is the remaining part shown in FIG. 2 of the flowchart showing the operation of the competitive game apparatus shown in FIG.
4 is a schematic diagram showing a configuration of player information generated in the competitive game apparatus shown in FIG. 1. FIG.
FIG. 5 is a schematic diagram showing a configuration of a memory map generated in the competitive game apparatus shown in FIG. 1;
6 is a schematic diagram showing a configuration of a first play order queue generated in the competitive game apparatus shown in FIG. 1. FIG.
7 is a schematic diagram showing a configuration of a second play order queue generated in the competitive game apparatus shown in FIG. 1. FIG.
FIG. 8 is a schematic diagram showing a configuration of a third play order queue and a controller management table generated in the competitive game apparatus shown in FIG. 1;
9 is an explanatory diagram of a top menu displayed at the start of the game in the competitive game apparatus shown in FIG. 1. FIG.
FIG. 10 is an explanatory diagram of options in the battle mode displayed when the battle game mode is selected in the top menu shown in FIG. 9;
FIG. 11 is an explanatory diagram of options on the name registration screen displayed when name registration is selected in the battle mode shown in FIG. 10;
12 is an explanatory diagram showing a state of name registration using a software keyboard when new registration is selected on the name registration screen shown in FIG. 11; FIG.
FIG. 13 is an explanatory diagram showing a state of setting ON / OFF of a vibration function of a controller, which is one of the player name attributes PNA according to the present invention.
FIG. 14 is an explanatory diagram showing a method of inputting basic information for guiding the replacement of a player by winning in the present invention.
FIG. 15 is an explanatory diagram showing a method of inputting basic information for guiding the replacement of players by losing in the present invention.
FIG. 16 is an explanatory diagram showing a state of character assignment, which is one of the player name attributes according to the present invention.
FIG. 17 is an explanatory diagram showing how to confirm whether or not to determine player information according to the present invention.
FIG. 18 is an explanatory diagram showing a state in which the confirmation shown in FIG. 17 is approved.
FIG. 19 is an explanatory diagram showing a state in which a character prepared for a player who has entered a game is read from existing player information PI in the present invention.
FIG. 20 is an explanatory diagram showing a state in which player information is newly input in the present invention.
FIG. 21 is an explanatory diagram showing a state in which a character prepared for a player who has entered a game is read from existing player information PI in the present invention.
FIG. 22 is an explanatory diagram showing guidance when winning in the present invention.
FIG. 23 is an explanatory diagram showing guidance when losing in the present invention.
FIG. 24 is an explanatory diagram showing a screen at the end of the game in the present invention.
FIG. 25 is an explanatory diagram showing a state at the end of the game when winning in the present invention.
FIG. 26 is an explanatory diagram showing a state at the end of the game when losing in the present invention.
FIG. 27 is an explanatory diagram showing guidance when winning in the present invention.
FIG. 28 is an explanatory diagram showing guidance when losing in the present invention.
[Explanation of symbols]
  GC game machine
  M recording medium
  1 CPU
  2 RAM
  DV information reader
  VM monitor
  LS speaker
  CTL1, CTL2, CTL3 controller

Claims (4)

A battle-type game apparatus in which each player operates a predetermined number of controllers to compete for victory and defeat, and more players than the predetermined number can play while changing according to a predetermined rule,
Player information receiving means for receiving player information for identifying each of the players;
First game participation priority setting means for setting a first game participation priority that is an information string indicating a priority in which the players can participate in the game;
According to the first game participation priority order, the player information of the players more than the predetermined number is selected by the number of players who can play the game, and the player information of the players allowed to participate in the game and the players are selected. Player selection means for selecting a game participation group including information indicating a controller to be assigned, and a game waiting group including player information of at least one player who is not permitted to participate in the game;
Based on the game result, the second game participation that sets the game continuation priority, which is an information string indicating the priority in which each of the players corresponding to the player information included in the game participation group can continue to play the game Priority setting means;
FIG. 6 is an information string indicating a priority order in which each of the players corresponding to player information for a number of players that is not more than the predetermined number selected from the game participation group can play a game based on the first game continuation priority order; The second game participation priority is set lower than the first game participation priority, and the player information of the player is moved to the game waiting group, and is moved from the game participation group to the game waiting group. Priority order review means for updating the game participation group by moving player information corresponding to the number of players corresponding to the player information from the higher first game participation priority order to the game participation group ;
A competitive game apparatus comprising player information included in the updated game participation group and display means for displaying information indicating a controller assigned to the players .   The competitive game apparatus according to claim 1, further comprising game play attribute setting means for setting a game play attribute for each of the players included in the game participation group. The game play step of setting a game play attribute is further executed when moving the player information for the number of players to the game participation group from the first game participation priority higher. Item 3. A competitive game apparatus according to Item 2 . Computer-readable information storing a game program for controlling a battle-type game apparatus in which each player operates a predetermined number of controllers to compete for victory or defeat, and more players than the predetermined number can play while changing according to a predetermined rule A storage medium,
Receiving player information identifying each of the players;
Setting a first game participation priority order, which is an information string indicating a priority order in which the player can participate in the game;
Storing the first game participation priority;
According to the first game participation priority order, the player information of the players more than the predetermined number is selected by the number of players who can play the game, and the player information of the players allowed to participate in the game and the players are selected. Selecting a game participation group including information indicating an assigned controller and a game waiting group including player information of at least one player who is not permitted to participate in the game;
Setting a game continuation priority, which is an information string indicating a priority in which each of the players corresponding to the player information included in the game participation group can play the game continuously, based on the game result;
FIG. 6 is an information string indicating a priority order in which each of the players corresponding to player information for a number of players that is not more than the predetermined number selected from the game participation group can play a game based on the first game continuation priority order; The second game participation priority is set lower than the first game participation priority, and the player information of the player is moved to the game waiting group, and is moved from the game participation group to the game waiting group. Updating the game participation group by moving player information corresponding to the number of players corresponding to the player information from the higher first game participation priority to the game participation group ;
A computer-readable information storage medium that causes the competitive game apparatus to execute player information included in the updated game participation group and a display step of displaying information indicating a controller assigned to the players. .

Images