JP6251757B2 - Information processing apparatus and game program - Google Patents

Description

  The present invention relates to a server device and a program.

  A server device connected to a plurality of player terminals via a network. After receiving entries from the player terminals in advance, grouping is performed according to the level of the entered players, and battles are performed within the grouped groups. A server device for playing a game is known (for example, Patent Document 1).

JP 2003-135854 A

As described above, when the player is made to belong to any group after making an entry before the game is started, the number of participants in the game can be grasped in advance.
On the other hand, if players who access the server at any time after the game starts without belonging to any group without entering in advance, the number of accesses cannot be predicted. Cannot be grasped in advance. Therefore, the players belong to a certain group in the order of access, and when a certain group reaches the capacity, the next group is created and the players belong.
However, if a player is assigned to a group by such a procedure, the group will soon reach the capacity, so that the greater the number of people in the group, the easier it is to achieve the mission, which may reduce the difficulty of the game.
The present invention has been made in view of such circumstances, and an object of the present invention is to adjust the game difficulty level for each group in a well-balanced manner by appropriately controlling the number of people in each group. .

The main invention of the present invention to solve the above problems is
A server device connected to a plurality of player terminals via a network,
A storage unit that stores an initial upper limit value of the number of groups and an initial threshold value that is smaller than the upper limit value of the group affiliation rate, which is a ratio of the number of affiliations to the number of groups.
Based on the initial upper limit value of the number of groups, a group creating unit that creates a plurality of groups in which the group membership rate of the initial threshold is set at the start of the game;
When there is a request to join a group from the player terminal after the game starts,
Until the group membership rate of all groups reaches the initial threshold value, the player using the player terminal belongs to a group whose group membership rate does not reach the initial threshold value, and the group membership rate of all groups After reaching the initial threshold, a player assignment unit that assigns a player who uses the player terminal to a group whose group membership rate does not reach the upper limit,
A server device characterized by comprising:
Other features of the present invention will become apparent from the description of the present specification and the accompanying drawings.

  According to the present invention, by appropriately controlling the number of people in each group, the game difficulty level for each group can be adjusted in a well-balanced manner.

1 is a diagram illustrating an example of an overall configuration of a game system 1. FIG. 2 is a block diagram showing a functional configuration of a server device 10. FIG. 3 is a block diagram illustrating a functional configuration of a player terminal 20. FIG. It is a figure which shows the data structure example of character information. It is a figure which shows the data structure example of player information. It is a figure which shows the example of a data structure of possessed character information. It is a figure which shows the data structure example of field information. It is a figure which shows the data structure example of game result information. It is a figure which shows the example of a data structure of battle information. It is a figure explaining the outline procedure (the 1) when a player is assigned to a field. It is a figure explaining the outline procedure (the 2) when a player is assigned to a field. It is a figure explaining the outline procedure (the 3) when assigning a player to a field. 3 is a flowchart for explaining an operation example of the game system 1; It is a flowchart for demonstrating a player assignment process.

At least the following matters will become apparent from the description of the present specification and the accompanying drawings.
That is, a server device connected to a plurality of player terminals via a network,
A storage unit that stores an initial upper limit value of the number of groups and an initial threshold value that is smaller than the upper limit value of the group affiliation rate, which is a ratio of the number of affiliations to the number of groups.
Based on the initial upper limit value of the number of groups, a group creating unit that creates a plurality of groups in which the group membership rate of the initial threshold is set at the start of the game;
When there is a request to join a group from the player terminal after the game starts,
Until the group membership rate of all groups reaches the initial threshold value, the player using the player terminal belongs to a group whose group membership rate does not reach the initial threshold value, and the group membership rate of all groups After reaching the initial threshold, a player assignment unit that assigns a player who uses the player terminal to a group whose group membership rate does not reach the upper limit,
A server device characterized by comprising:
According to such a server device, even when a player requests to join a group after the game starts, the game difficulty level for each group is adjusted in a balanced manner by appropriately controlling the number of people in each group. It becomes possible to do.

Also, such a server device,
After the group affiliation rate of all the groups has reached the upper limit value, an upper limit value changing unit that changes the upper limit value of the number of groups from the initial upper limit value,
A group addition creating unit for creating a new group based on the upper limit after the number of groups fluctuates,
The player assignment section is
After the group affiliation rate of all the groups reaches the upper limit value, the player using the player terminal may belong to the newly created new group.
According to such a server device, even after the group membership rate of all groups reaches the upper limit, the game difficulty level for each group is adjusted in a well-balanced manner by appropriately controlling the number of people in each group. It becomes possible.

Also, such a server device,
For each of a plurality of groups, a game processing unit for giving a mission set in a group unit to each player belonging to each group to advance the game,
A calculation unit that calculates the mission success rate for the entire group;
Based on the calculated success rate, a threshold value changing unit that changes the threshold value of the group membership rate from the initial threshold value,
The group addition creation unit may additionally create a new group in which the group membership rate of the threshold value after the change is set.
According to such a server device, it is possible to appropriately control the number of people in each group according to the success rate of the mission.

Also, such a server device,
The storage unit stores the initial capacity of the group,
For each of a plurality of groups, a game processing unit for giving a mission set in a group unit to each player belonging to each group to advance the game,
A calculation unit that calculates the mission success rate for the entire group;
Based on the calculated success rate, a capacity variation unit that varies the capacity of the group from the initial capacity, and
The group addition creation unit may additionally create a new group in which the number of people after the change is set.
According to such a server device, it is possible to appropriately control the number of people in each group according to the success rate of the mission.

Also, such a server device,
The game processing unit may change the difficulty level of the mission set for each group based on the success rate calculated by the calculation unit.
According to such a server device, it is possible to control the game balance between groups according to the success rate of the mission.

Next, to a server device connected to a plurality of player terminals via a network,
A process of recording an initial threshold value smaller than the initial upper limit value of the number of groups and the upper limit value of the group affiliation rate, which is a ratio of the number of affiliations with respect to the number of groups in the storage unit,
Based on the initial upper limit value of the number of groups, a group creation process for creating a plurality of groups in which the group membership rate of the initial threshold is set at the start of the game;
When there is a request to join a group from the player terminal after the game starts,
Until the group membership rate of all groups reaches the initial threshold value, the player using the player terminal belongs to a group whose group membership rate does not reach the initial threshold value, and the group membership rate of all groups After reaching the initial threshold, a player assignment process for causing a player who uses the player terminal to belong to a group whose group membership rate does not reach the upper limit,
Is a program for executing
According to such a program, it is possible to adjust the game difficulty level for each group in a well-balanced manner by appropriately controlling the number of people in each group.

=== Embodiment ===
<< About the configuration of the game system 1 >>
FIG. 1 is a diagram illustrating an example of the overall configuration of a game system 1 according to the present embodiment. The game system 1 provides various services related to games to a player via a network 2 (for example, the Internet or the like), and includes a server device 10 and a plurality of player terminals 20.

<< Configuration of Server Device 10 >>
FIG. 2 is a block diagram illustrating a functional configuration of the server apparatus 10 according to the present embodiment. The server device 10 is an information processing device (for example, a workstation or a personal computer) used when a system administrator or the like operates and manages a game service, and receives various commands (requests) from the player terminal 20. A game program operable on the player terminal 20 or a Web page (game image or the like) created in a markup language (HTML or the like) adapted to the standard of the player terminal 20 can be distributed (response). The server device 10 includes a control unit 11, a data storage unit 12, an input unit 13, a display unit 14, and a communication unit 15.

  The control unit 11 exchanges data between each unit and controls the entire server device 10 and is realized by a CPU (Central Processing Unit) executing a program stored in a predetermined memory. . The control unit 11 of the present embodiment includes a group creation unit 111, a player assignment unit 112, an upper limit value variation unit 113, a group addition creation unit 114, a game processing unit 115, a calculation unit 116, a capacity variation unit 117, and a threshold variation unit 118. It has.

  The group creation unit 111 has a function of executing a process of creating a group based on initial conditions at the start of the game. The group creation unit 111 according to the present embodiment creates a plurality of groups, each having an initial threshold group membership rate, based on the initial upper limit value of the number of groups at the start of the game.

  The player assigning unit 112 has a function of executing a process of belonging a player to a group. In the present embodiment, the player assigning unit 112 assigns a player who uses the player terminal to one of a plurality of groups when the player terminal 20 requests participation in the group after the game starts.

  The upper limit value changing unit 113 has a function of executing processing for changing the upper limit value of the number of groups. The upper limit changing unit 113 in the present embodiment changes the upper limit value of the number of groups from the initial upper limit value after the group membership rate of all the groups reaches the upper limit value.

  The group addition creation unit 114 has a function of executing a process of creating a new group by adding to the plurality of groups created by the group creation unit 111. The group addition creating unit 114 according to the present embodiment additionally creates a new group in response to the upper limit changing unit 113 changing the upper limit value of the number of groups.

  The game processing unit 115 has a function of executing processing related to the game. In the present embodiment, the game processing unit 115 gives a mission set for each group to each player belonging to each group and advances the game.

  The calculation unit 116 has a function of executing various numerical value calculation processes such as calculating the mission success rate for the entire group. The success rate can be obtained by the ratio of the number of mission successes of the entire group (the value of the sum of the number of mission successes of each group) to the number of mission executions of the entire group (the value obtained by summing up the number of mission executions of each group). In the present embodiment, the calculation unit 116 calculates the mission success rate of each field every predetermined time (for example, every hour), and updates the game result information shown in FIG. Further, the calculation unit 116 calculates the accommodation rate of each field every time there is an access from the player terminal 20, and also updates the field information shown in FIG.

  The capacity variation unit 117 has a function of executing processing for varying the number of groups. Based on the success rate calculated by the calculating unit 116, the capacity changing unit 117 in the present embodiment changes the group capacity from the initial capacity.

  The threshold changing unit 118 has a function of executing processing for changing the threshold of the group membership rate. The threshold value changing unit 118 according to the present embodiment changes the group membership rate threshold value from the initial threshold value based on the success rate calculated by the calculating unit 116.

  The storage unit 12 includes a ROM (Read Only Memory) that is a read-only storage area in which system programs are stored, and a RAM (Random Access) that is a rewritable storage area that is used as a work area for arithmetic processing by the control unit 11. For example, a non-volatile storage device such as a flash memory or a hard disk. The storage unit 12 of the present embodiment stores at least character information that is information about a character, player information that is information about a player, field information that is information about a field, and game result information that is information about a game result. ing. These pieces of information will be described in detail later. In addition, the storage unit 12 stores an initial upper limit value of the number of fields (number of groups), an initial threshold value (for example, “50%”) smaller than the upper limit value (100%) of the accommodation rate (group membership rate), and the initial value of the field The capacity (for example, “100 people”) is stored.

  The input unit 13 is used by a system administrator or the like for inputting various data (for example, character information), and is realized by, for example, a keyboard or a mouse.

  The display unit 14 is for displaying an operation screen for a system administrator based on a command from the control unit 11 and is realized by, for example, a liquid crystal display (LCD).

  The communication unit 15 is for communicating with the player terminal 20, according to a function as a receiving unit that receives various data and signals transmitted from the player terminal 20 and a command from the control unit 11. It has a function as a transmission part which transmits various data and signals to the player terminal 20. The communication unit 15 is realized by, for example, a NIC (Network Interface Card).

<< Configuration of Player Terminal 20 >>
FIG. 3 is a block diagram illustrating a functional configuration of the player terminal 20. The player terminal 20 of the present embodiment is an information processing device (for example, a mobile phone terminal, a smartphone, a tablet terminal, etc.) that is used by the player when playing a game. A distribution request for a game program, a web page, or the like can be made. Since the player terminal 20 has a Web browser function for allowing the player to browse the Web page, the player terminal 20 can display the Web page (game screen or the like) distributed from the server device 10. The player terminal 20 includes a terminal control unit 21, a terminal storage unit 22, a terminal input unit 23, a terminal display unit 24, and a terminal communication unit 25.

  The terminal control unit 21 exchanges data between each unit and controls the entire player terminal 20, and is realized by a CPU (Central Processing Unit) executing a program stored in a predetermined memory. Is done. Note that the terminal control unit 21 of the present embodiment also functions as a screen display control unit that controls the display mode of the game screen displayed on the terminal display unit 24. The terminal storage unit 22 is connected to the terminal control unit 21 via a bus, and performs processing of referring to, reading, and rewriting data stored in response to a command from the terminal control unit 21. The terminal storage unit 22 is realized by, for example, a flash memory or a hard disk. The terminal input unit 23 is for a player to perform various operations (game operations and the like), and is realized by, for example, operation buttons, a touch panel, and the like. The terminal display unit 24 is for displaying a game screen according to a command from the terminal control unit 21 and is realized by, for example, a liquid crystal display (LCD). The terminal communication unit 25 functions as a transmission / reception unit for transmitting / receiving various kinds of information to / from the server device 10 via the network 2 and is realized by, for example, a NIC (Network Interface Card) or the like.

<< About data structure >>
FIG. 4 is a diagram illustrating a data structure example of character information stored in the storage unit 12 of the server device 10. This character information has items (fields) such as a character ID, a character name, a rarity, an initial attack power, an initial defense power, and an initial physical strength. The character ID is identification information for identifying a character. The character name is information indicating the display name of the character. Rarity is a parameter that indicates the rarity of a character. In this embodiment, four levels of rarity (“common” → “uncommon” → “rare” → “super rare”) are set for the character. The initial attack power, initial defense power, and initial physical strength of the character are parameters indicating the ability values initially set for the character. This rarity is not limited to four stages. Moreover, you may employ | adopt the name different from said name also for the name of each rarity.

  FIG. 5 is a diagram illustrating a data structure example of player information stored in the storage unit 12 of the server device 10. This player information includes items such as a player ID, a player name, and owned character information. The player ID is identification information for identifying the player. The player name is information indicating the display name of the player. The owned character information is information indicating a character owned by the player.

  FIG. 6 is a diagram illustrating a data structure example of owned character information. This possessed character information includes items such as a character ID, character level, attack power, defense power, physical strength, and acquisition date. The character ID is identification information for identifying a character owned by the player. The character level, attack power, defense power, and physical strength are parameters indicating the current ability values set for the characters owned by the player. These various parameters are updated as the game progresses. The acquisition date and time is information indicating the date and time when the player acquired the character.

  FIG. 7 is a diagram illustrating a data structure example of field information stored in the storage unit 12 of the server device 10. This field information includes items such as an index, a field name (field Fi), a maximum accommodating number, a accommodating number, a accommodating rate, and a player ID. The index is a serial number for specifying a field. The field name (field Fi) is information indicating the display name of the field. The maximum capacity is information indicating the maximum number of groups, that is, information indicating the maximum number of players that can be accommodated in the field. The number of people accommodated is information indicating the number of players (number of members) currently assigned to the group, that is, information indicating the number of players currently accommodated in the field. The accommodation rate is an example of a group affiliation rate, and is information indicating the ratio of the number of affiliations to the number of groups in the group, that is, the ratio of the number of accommodations to the maximum number of people. The player ID is identification information for identifying a player assigned to the field.

  FIG. 8 is a diagram illustrating a data structure example of the game result information stored in the storage unit 12 of the server device 10. This game result information includes items such as data acquisition date / time, battle information, mission success rate, and the like. The data acquisition date / time is information indicating the date / time when the data was acquired. In this embodiment, data is acquired every hour. The battle information is information regarding the battle. The success rate of the mission is information indicating the ratio of the number of wins of the entire field (the value of the total number of wins in each field) to the number of times of the battle execution of the entire field (the value obtained by summing up the number of battle executions in each field).

  FIG. 9 is a diagram illustrating a data structure example of the battle information. The battle information is history information about the battle results in each field, and includes items such as a field name (field Fi), an enemy character, and a battle result. The field name (field Fi) is information indicating the display name of the field. The enemy character is information for identifying the enemy character that appears in the field. The battle result is win / loss information indicating that the battle game has been won or defeated.

<< About the game outline >>
Here, an outline of a game provided by the game system 1 of the present embodiment will be described. In the game system 1, various games are provided that are played using an electronic game card (hereinafter also referred to as “character”) associated with a game character.

<Competition game>
In the game system 1 according to the present embodiment, a battle game is provided in which a plurality of players cooperate to defeat a common enemy character as a mission.
In this battle game, a plurality of fields as battle fields are set. In each field, enemy characters that will be opponents are set. When a player requests participation in the battle game during the battle game, the player is assigned to one of a plurality of fields. Players assigned to the same field will be grouped together, and defeating the common enemy characters that appear in this field is the mission of the players belonging to this group.
Each player in the group plays against a common enemy character. At this time, the player battles against a common enemy character using a player character selected from a plurality of characters owned by the player.
In a battle between these characters, the game processing unit 115 refers to the owned character information shown in FIG. 6 and the character information shown in FIG. 3, and various parameters (attack power, defense power, physical strength, etc.) set for the player character. Etc.) and various parameters (initial attack power, initial defense power, initial physical strength, etc.) set for the common enemy character, the victory or defeat is determined.

<Player assignment>
In the game system 1 according to the present embodiment, players who participate in the battle game are assigned to any one of a plurality of fields.
Hereinafter, an outline procedure when a player is assigned to a field will be described with reference to FIGS. Here, the capacity of each field is “100”, the initial threshold of the accommodation rate is “50%” (the upper limit of the accommodation rate is “100%”), and the initial upper limit of the number of fields is “10” Will be described.

(First assignment pattern)
FIG. 10 is a diagram for explaining an outline procedure when a player is assigned to a field when there is an access requesting participation in a battle game from 480 players per unit time. As shown in FIG. 10, since the initial upper limit value of the number of fields is “10”, ten fields (field F1 to field F10) are created.
If there is an access requesting participation in this competitive game after the start of the competitive game, the players are assigned to the field in the order of access. Specifically, first, 50 players who access from the first to the 50th are assigned to the field F1. Next, since the accommodation rate in the field F1 has reached 50% of the initial threshold, the players who have accessed from the 51st to the 100th (50 people) are assigned to the next field F2. Similarly, the players who accessed from 401th to 450th (50 people) are assigned to the field F9. Since the accommodation rate in the field F9 has reached 50% of the initial threshold value, the players who have accessed from the 451st to the 480th (30 people) are assigned to the next field F10.
As described above, when the accommodation rates of all the fields have not reached the initial threshold value of 50%, the procedure for allocating the accessed player to one field until the accommodation rate reaches 50% of the initial threshold value is performed. To field F10 in order.

(Second assignment pattern)
FIG. 11 is a diagram for explaining an outline procedure when a player is assigned to a field when there is an access requesting participation in a competitive game from 700 players per unit time. As shown in the upper diagram of FIG. 11, since the initial upper limit value of the number of fields is “10”, ten fields (fields F1 to F10) are created.
If there is an access requesting participation in the competitive game during the competitive game, the players are assigned to the field in the order of access. Specifically, first, as shown in the upper diagram of FIG. 11, the first to 500th steps are performed in the same procedure as the first assignment pattern shown in FIG. 10 until the accommodation rate of all fields reaches 50%. The players (500 people) who have accessed until the first time are assigned in order from the field F1 to the field F10. Next, as shown in the lower diagram of FIG. 11, after the accommodation rate of all fields reaches 50%, the allocation is performed as follows.
That is, the player who accesses the 501st is assigned to (one person) field F1, the player who accesses the 502nd is assigned to field F2, and the player who accesses the 509th is assigned (1 (Person) is assigned to field F9, and the player who has accessed 510th is assigned to field F10. By repeating this procedure, the player who accesses the 501st, 511, 521,..., 691th is assigned to the field F1. 502, 512, 522,..., The 692th player who accesses is assigned to the field F2. Similarly, the players who access the 509th, 509th, 529th,..., 699th are assigned to the field F9. 510, 520, 530,..., The 700th accessed player is assigned to the field F10.
Thus, after the accommodation rate of all fields has reached the initial threshold value of 50%, and the accommodation rate of all fields has not reached the upper limit value of 100%, the accommodation rate of all fields has been reached. Until the rate reaches 100%, the procedure of assigning the accessed players one by one from field F1 to field F10 is repeated.

(Third assignment pattern)
FIG. 12 is a diagram for explaining an outline procedure when a player is assigned to a field when there is an access requesting participation in a competitive game from 1010 players per unit time. First, as shown in the upper diagram of FIG. 12, until the accommodation rate of all fields reaches 50%, the first to 500th accesses are made in the same procedure as the first assignment pattern shown in FIG. Players (500 people) are assigned in order from field F1 to field F10. Then, until the accommodation rate of all fields reaches 100%, the players (1000 people) who have accessed from the 501st to the 1000th through the procedure similar to the second assignment pattern shown in FIG. Assign to F10 in order. Next, as shown in the lower diagram of FIG. 12, after the accommodation rate of all fields reaches 100%, the allocation is performed as follows.
That is, the upper limit value of the number of fields is changed from 10 which is the initial upper limit value to 11. That is, as shown in the lower diagram of FIG. 12, since the upper limit value of the number of fields is 11, an eleventh field (field F11) is newly created. Then, the players who accessed from 1001 to 1010 are assigned to the field F11 (10 players).
In this way, after the accommodation rate of all fields reaches the upper limit of 100%, a new field F11 is additionally created. The accessed player is assigned until the accommodation rate of the new field F11 reaches 50%, which is the initial threshold value.

Here, conventionally, the procedure of assigning the accessed player to one field until the accommodation rate reaches 100% of the upper limit value is repeated in order from the field F1 to the field F10. However, if the player is assigned to a group by such a procedure, the group will reach the capacity immediately, so the enemy characters that appear in each field will be attacked by the maximum number of players and easily defeated In many cases (decrease in game difficulty).
Therefore, in the invention according to the present embodiment, by setting an initial threshold (for example, 50%) of the accommodation rate for each field, the number of groups is controlled so that the group does not reach the capacity immediately.
In addition, when the number of groups is controlled in this way, the time until the group reaches the capacity is controlled. For example, assuming that there are 10 accesses per minute, the following difference occurs with respect to the time until the first field F1 reaches the capacity.
When the procedure for allocating the accessed player to one field until the accommodation rate reaches 100% of the upper limit value in the conventional manner is repeated in order from the field F1 to the field F10, the field F1 is limited to the capacity (100 People).
On the other hand, in the procedure of the first assignment pattern described above, 50 people are assigned from the field F1 to the field F10 every 5 minutes (50 minutes), and thereafter a player is added to each field every minute. In 91 minutes, the field F1 reaches the capacity (100 people). Thereby, since the time until the first field F1 reaches the capacity can be delayed, it is possible to make it difficult to defeat the enemy characters that have appeared in the field (increase in game difficulty).

<< Operation of Game System 1 >>
FIG. 13 is a flowchart for explaining an operation example of the game system 1 according to the present embodiment. Here, the capacity of the field Fi is “100”, the initial threshold of the accommodation rate (group membership rate) is “50%” (the upper limit value of the accommodation rate is “100%”), and the initial upper limit value of the number of fields is “ 10 ”.

  First, after starting the competitive game, the server device 10 determines whether or not there is an access (request to participate in the field) from the player terminal 20 (S101). When there is an access (S101: YES), the process proceeds to step 102.

  Next, when the server device 10 receives an access from the player terminal 20 (field participation request), the server device 10 executes a player assignment process (S102). That is, the player assigning unit 112 assigns a player who has accessed using the player terminal 20 to any of the ten fields (groups) created based on the initial upper limit value of the number of groups by the group creating unit 111 at the start of the game. To do.

FIG. 14 is a flowchart for explaining the player assignment process.
First, initial setting (i = 0) of the index i is performed (S201). This index i corresponds to a field name (field Fi). In this embodiment, since the initial upper limit value of the number of fields is “10”, the fields F1 to F10 are created at the start of the game, and the maximum value (MAX) of the index i is initially set to “10”.

  Next, the index i is incremented by 1 (i = i + 1) (S202), and the player assignment unit 112 determines whether or not the field Fi has disappeared (S203). The disappearance of the field Fi means setting the field Fi to be deleted when a predetermined time (for example, 1 hour) has elapsed since the field Fi was created by the group creation unit 111, or an enemy that appeared in the field Fi By clearing the mission by defeating the character, the field Fi is set to be erased. At this time, each grouped player is also ungrouped.

  If it is determined that the field Fi has not disappeared (S203: NO), the process proceeds to step 204. On the other hand, if it is determined that the field Fi has disappeared (S203: YES), the process returns to step S202 to increment the index i by 1, and the subsequent processing is repeated.

  Next, in step S204, the player assignment unit 112 determines whether or not the accommodation rate of the field Fi has reached 50%. For example, when the index i = 1, it is determined whether or not the accommodation rate of the first field F1 has reached 50%.

  If it is determined that the accommodation rate of the field Fi has not reached 50% (S204: NO), a player who accesses the field Fi using the player terminal 20 is assigned (S205). On the other hand, when it is determined that the accommodation rate of the field Fi has reached 50% (S204: YES), the process proceeds to step 206.

  Next, in step S206, it is determined whether or not the index i matches the maximum value (MAX = 10). If they match (S206: YES), the accommodation rate of all the fields has reached 50% (see the upper diagram of FIG. 11), so that the player who has accessed using the player terminal 20 is designated as the field F1. To field F10 are assigned one by one in order (see S207, the lower diagram of FIG. 11). On the other hand, if they do not match (S206: NO), there is still a field whose field coverage has not reached 50%, so the process returns to step S202 and increments index i by one. The process is repeated (see FIG. 10).

  Returning to FIG. 13, when the player assignment process is performed in this way, the server device 10 determines whether or not the accommodation rate from the field F1 to the field Fmax (here, field Fmax = field F10) has reached 100%. Is determined (S103). If it is determined that the accommodation rate from the field F1 to the field Fmax has not reached 100% (S103: NO), this process ends. On the other hand, if it is determined that the accommodation rate from field F1 to field Fmax has reached 100% (S103: YES), the total number of fields is reset (S104). That is, the upper limit changing unit 113 changes the upper limit value of the number of fields from the initial upper limit value “10” to “11” (MAX = MAX + 1), and updates and records it in the storage unit 12.

  Next, the server device 10 newly creates a field Fmax (S105). That is, the group addition creation unit 114 additionally creates a new field Fmax (here, field Fmax = field F11) in response to the upper limit value of the number of fields being changed by the upper limit change unit 113 (the lower diagram of FIG. 12). See).

<About the threshold of capacity>
Here, when a new field F11 is additionally created, the server device 10 sets a threshold value of the accommodation rate for this field F11. In this embodiment, the threshold value of the accommodation rate is determined based on the success rate of missions in all fields.
For example, when the mission success rate is rising, the threshold value of the accommodation rate of the new field F11 is set lower than the initial threshold value (50%). Conversely, when the mission success rate is decreasing, the threshold of the accommodation rate of the new field F11 is set higher than the initial threshold (50%). In other words, if the enemy character tends to be easily defeated as a trend until this field is added, by controlling so that the number of people in the field is reduced, the game difficulty level after this will be increased. When enemy characters tend to be hard to be defeated, the game difficulty after that is reduced by controlling the number of players to increase.

  Specifically, the calculation unit 116 in the server device 10 acquires mission results in each field every hour, calculates the success rate of missions in the entire field, and updates the game result information shown in FIG. I do. That is, the calculation unit 116 obtains the number of mission executions for the entire field from the sum of the number of mission executions (number of battles with enemy characters) in each field F1 to F10. Then, the calculation unit 116 obtains the number of mission successes for the entire field from the numerical value obtained by summing the number of mission successes (the number of times of winning the battle with the enemy character) in each field F1 to F10. Then, the calculation unit 116 obtains the ratio of the number of mission successes for the entire field to the number of mission executions for the entire field, and determines the mission success rate for the entire field.

  Next, the threshold value changing unit 118 in the server device 10 refers to the game result information shown in FIG. 8 and acquires the mission success rate of the data acquisition date and time closest to the date and time when the new field F11 is additionally created. Then, the threshold value changing unit 118 determines whether or not the acquired mission success rate is higher than a reference value (for example, 70% to 75%), and based on the determination result, the newly created capacity F of the field F11 is determined. The threshold value is changed and updated and recorded in the storage unit 12. Specifically, when the success rate of the mission is higher than the reference value according to the determination result (when the game difficulty level is reduced), the threshold value changing unit 118 determines the capacity of the new field F11. The threshold is set lower than the initial threshold (50%). If the mission success rate is lower than the reference value (when the game difficulty level is rising), the new field F11 accommodation rate threshold is set higher than the initial threshold (50%). If the mission success rate is the reference value, the new field F11 accommodation rate threshold is set at the initial threshold (50%).

  As described above, according to the game system 1 according to the present embodiment, when a player who wishes to participate in the battle game has access at an arbitrary timing after the start of the battle game, the player who accesses the game system 1 It belongs to one of a plurality of fields for performing. Since an initial threshold (for example, 50%) of the accommodation rate is set for each field, the number of groups is controlled so that the field does not reach the capacity immediately. When each field reaches the capacity, a new field is additionally created. In the new field, a threshold of the accommodation rate determined based on the success rate of the missions of all fields is set. Therefore, the number of players in each field is appropriately controlled according to the battle situation, such as whether the enemy character tends to be easily defeated or not easily defeated. It becomes possible to do.

=== Other Embodiments ===
The above embodiments are for facilitating the understanding of the present invention, and are not intended to limit the present invention. The present invention can be changed and improved without departing from the gist thereof, and the present invention includes equivalents thereof. In particular, the embodiments described below are also included in the present invention.

<Capacity of field>
In the above-described embodiment, when a new field Fmax (field F11) is additionally created, the number of new fields Fmax may be changed from the initial number based on the mission success rate of the entire field. For example, the capacity changing unit 117 refers to the game result information shown in FIG. 8 and acquires the mission success rate of the data acquisition date and time closest to the date and time when the new field F11 is additionally created. And the capacity | capacitance fluctuation | variation part 117 determines whether the acquired mission success rate is higher than a reference value (for example, 70%-75%), Based on the determination result, the capacity number of the field F11 created additionally is determined. The initial capacity (for example, “100 people”) may be changed and recorded in the storage unit 12. Specifically, the capacity change unit 117 sets the new field F11 capacity lower than the initial capacity (100 persons) when the success rate of the mission is higher than the reference value according to the determination result. . When the success rate of the mission is lower than the reference value, the number of new fields F11 is set higher than the initial number (100 people). If the success rate of the mission is the reference value, the new field F11 capacity is set with the initial capacity (100 persons).

<Difficulty of the battle game>
In the present embodiment described above, the mission difficulty level set for each group may be changed based on the mission success rate of the entire group. For example, the game processing unit 115 may change the strength (ability parameter such as attack power) of the enemy character appearing in each field based on the mission success rate of the entire field calculated by the calculation unit 116. In other words, when the mission success rate is increasing, the enemy character's ability parameter is increased (strengthening the enemy character). Conversely, when the mission success rate is decreasing, the enemy character's ability parameter is increased. It may be reduced (weaken the enemy character).

<Server device>
In the above embodiment, the game system 1 including one server device 10 is described as an example of the server device. However, the present invention is not limited to this, and a plurality of server devices 10 are used as an example of the server device. It is good also as the game system 1 provided. That is, a plurality of server devices 10 may be connected via the network 2 and each server device 10 may perform various processes in a distributed manner. The server device 10 is an example of a computer that includes a processor and a memory.

<Information processing device>
In the game system 1 according to the above-described embodiment, the case where various types of information processing are executed in cooperation with the server device 10 and the player terminal 20 based on the game program has been described as an example. However, the present invention is not limited thereto. Instead, the player terminal 20 alone or the server device 10 alone as the information processing device may execute the various information processing based on the game program.
Moreover, it is good also as a structure which the player terminal 20 bears a part of function as an information processing apparatus. In this case, the server device 10 and the player terminal 20 constitute an information processing device.
Note that the information processing apparatus is an example of a computer including a processor and a memory.

  1 game system, 2 network, 10 server device, 11 control unit, 12 data storage unit, 13 input unit, 14 display unit, 15 communication unit, 20 player terminal, 21 terminal control unit, 22 terminal storage unit, 23 terminal input unit , 24 terminal display unit, 25 terminal communication unit, 111 group creation unit, 112 player assignment unit, 113 upper limit variation unit, 114 group addition creation unit, 115 game processing unit, 116 calculation unit, 117 capacity variation unit, 118 threshold Variable part

Claims (7)

A game processing unit for controlling the progress of the game for each group in which a plurality of players are accommodated;
Before the game is started, based on a preset initial upper limit of the number of groups, a group generation unit for generating groups from the first to the M-th (M is a positive integer);
Each time a player receives a request to join the group before the capacity ratio, which is the ratio of the capacity of the group to the capacity of all the M groups , reaches an initial threshold value that is smaller than the upper limit value , Until the accommodation rate of the Nth group (N is a positive integer, M ≧ N ≧ 1) among the groups reaches the initial threshold, the requesting player is accommodated in the Nth group, After the accommodation rate of the Nth group (N is a positive integer, where M> N ≧ 1) among the M groups reaches the initial threshold, the requesting player is designated as the (N + 1) th group. A group accommodation unit to accommodate
An information processing apparatus comprising: The information processing apparatus according to claim 1,
The group accommodation unit joins the group from the player after the accommodation rates of all the M groups have reached the initial threshold and before the accommodation rates of all the M groups have reached the upper limit. Each time a request is accepted, the requesting player is accommodated one by one in order from the first to the Mth of all the M groups.
An information processing apparatus characterized by that. An information processing apparatus according to claim 2,
An upper limit variation unit that increases the upper limit value of the number of groups from the initial upper limit value when the accommodation rate of all the M groups has reached the upper limit value;
Based on the upper limit after the increase in the number of groups, a group addition generation unit for newly generating an M + 1-th group,
An information processing apparatus comprising: The information processing apparatus according to claim 3,
Each time the group accommodation unit accepts a request to join a group from a player after the accommodation rates of all M groups have reached the upper limit, the newly added accommodation rate of the M + 1th group is increased. Until the initial threshold is reached, the requesting player is accommodated in the (M + 1) th group,
An information processing apparatus characterized by that. The information processing apparatus according to claim 3,
The game processing unit is to give a mission set for a group to each player accommodated in the group and advance the game,
A calculation unit for calculating the success rate of the mission set in the group;
Based on the calculated success rate, a threshold value changing unit that changes a threshold value of the accommodation rate of the group from the initial threshold value;
With
The group addition generation unit additionally generates a new M + 1th group in which the accommodation rate of the threshold value after change is set.
An information processing apparatus characterized by that. The information processing apparatus according to claim 5,
When the success rate of the mission set for the group is higher than a reference value, the threshold value changing unit sets the threshold of the group accommodation rate lower than the initial threshold value, and sets the threshold of the mission set for the group. When lower than the success rate reference value, set the threshold of the accommodation rate of the group higher than the initial threshold;
An information processing apparatus characterized by that. Computer
Game processing means for controlling the progress of the game for each group in which a plurality of players are accommodated;
Group generation means for generating first to Mth groups (M is a positive integer) based on a preset initial upper limit value of the number of groups before the game is started;
Each time a player receives a request to join the group before the capacity ratio, which is the ratio of the capacity of the group to the capacity of all the M groups , reaches an initial threshold value that is smaller than the upper limit value , Until the accommodation rate of the Nth group (N is a positive integer, M ≧ N ≧ 1) among the groups reaches the initial threshold, the requesting player is accommodated in the Nth group, After the accommodation rate of the Nth group (N is a positive integer, where M> N ≧ 1) among the M groups reaches the initial threshold, the requesting player is designated as the (N + 1) th group. Group accommodation means to accommodate
Game program to function as.

Images