JP7149308B2 - SYSTEM, METHOD AND PROGRAM FOR PROVIDING A GAME - Google Patents

Description

The present invention relates to a system, method, and program for providing games.

Conventionally, various types of games in which a plurality of players participate have been provided (see, for example, Patent Literature 1 below). Some of these games are structured such that there is a game goal (e.g., defeating all enemy characters) as a team of multiple players participating in the game, each player working together. The goal is to achieve the team's game goal.

JP 2014-068870 A

However, in the conventional game described above, although the players can enjoy the achievement of the game goal through cooperative play, there are cases where the progress of the game becomes monotonous only through such cooperative play. Therefore, in a game in which a plurality of players participate, it is desired to further improve game characteristics.

One object of the embodiments of the present invention is to improve the gameplay in a game in which a plurality of players participate. Other objects of embodiments of the present invention will become apparent upon review of the specification as a whole.

A system according to one embodiment of the present invention comprises one or more computer processors for providing a game, wherein the one or more computer processors, in response to execution of readable instructions, dividing a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal; and controlling the progress of the game based on at least an operation, wherein the step of controlling the progress of the game is performed by controlling the progress of the game, wherein the player belonging to the second group belongs to the first group. restricting disclosure to the players belonging to it; and transferring players belonging to the first group to the second group in response to satisfaction of a predetermined condition.

A method according to one embodiment of the present invention is a method, performed by one or more computers, for providing a game, wherein a plurality of players forming a team having a first game objective are divided into a first group, and dividing the game into a second group having a second game goal different from the first game goal; and controlling progress of the game based at least on an operation by each of the plurality of players. The step of controlling the progress of the game includes restricting disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group; transferring players belonging to the first group to the second group.

A program according to one embodiment of the present invention is a program for providing a game, wherein a plurality of players constituting a team having a first game goal are arranged on one or more computers, a first group, and a process of dividing the player into a second group having a second game goal different from the first game goal; and a process of controlling the progress of the game based on at least an operation by each of the plurality of players. is restricted from disclosing to the players belonging to the first group that the players belonging to the second group belong to the second group; transferring a player belonging to one group to the second group.

Various embodiments of the present invention improve gameplay in games involving multiple players.

1 is a configuration diagram schematically showing the configuration of a network including a game providing server 10 according to one embodiment of the present invention; FIG. The figure which illustrates the data item which a player information table has. FIG. 4 is a flowchart illustrating processing executed by the server 10 when a game is played in multiplayer mode; FIG. 10 is a diagram illustrating how matched players are divided into a non-betrayal group and a betrayal group; The figure which illustrates the battle screen 50 corresponding to a general player. The figure which illustrates the battle screen 50 corresponding to a betrayal player. 4 is a flow diagram illustrating voting processing; FIG. FIG. 11 is a view exemplifying a first vote acceptance screen 60; FIG. FIG. 11 is a diagram exemplifying a first voting result screen 70 corresponding to a case where the player with the highest number of votes is a traitor. FIG. 11 is a diagram exemplifying a first voting result screen 70 corresponding to a case where the player with the most votes is not the traitor player; The figure which illustrates a mode that a general player is changed into a turning-over player. The figure which illustrates the player information display area 57 when specification of the betrayal player fails. The figure which illustrates the player information display area 57 when specification of the betrayal player fails. The figure which illustrates the player information display area 57 when specification of the betrayal player succeeds. FIG. 11 is a view exemplifying a second vote acceptance screen 80; FIG. FIG. 11 is a diagram illustrating a second voting result screen 90 corresponding to a case where the player with the most votes is a player who turns over; FIG. 11 is a diagram illustrating a second voting result screen 90 corresponding to a case where the player with the most votes is not the player who turns over;

Hereinafter, embodiments of the present invention will be described with reference to the drawings. In the drawings, the same reference numerals may be used for the same or similar components.

FIG. 1 is a configuration diagram schematically showing the configuration of a network including a game providing server 10 according to one embodiment of the present invention. As illustrated, the server 10 is communicably connected to the player terminal 30 via a communication network 20 such as the Internet. Although only one player terminal 30 is illustrated in FIG. 1 , the server 10 is communicably connected to a plurality of player terminals 30 . The server 10 provides games to users of the player terminals 30 . The game providing server 10 is an example of a device implementing all or part of the system of the present invention.

The game providing server 10 is configured as a general computer. As shown in FIG. 1, the computer processor 11, main memory 12, input/output I/F 13, communication I/F 14, storage ) 15, and these constituent elements are electrically connected via a bus or the like (not shown).

The computer processor 11 is configured as a CPU, GPU, or the like, reads various programs stored in the storage 15 or the like into the main memory 12, and executes various instructions included in the programs. The main memory 12 is composed of, for example, a DRAM.

The input/output I/F 13 includes various input/output devices for exchanging information with an operator or the like. The input/output I/F 13 includes, for example, information input devices such as keyboards and pointing devices (for example, mice, touch panels, etc.), voice input devices such as microphones, and image input devices such as cameras. The input/output I/F 13 includes an image output device such as a display and an audio output device such as a speaker.

The communication I/F 14 is implemented as hardware such as a network adapter, various types of communication software, or a combination thereof, and is configured to enable wired or wireless communication via the communication network 20 or the like.

The storage 15 is composed of, for example, a magnetic disk, flash memory, or the like. The storage 15 stores various programs including an operating system, various data, and the like. For example, storage 15 stores game program 40 according to one embodiment of the present invention. The program 40 is a program for causing the game providing server 10 to function as all or part of a system for providing games. At least part of the game program 40 may be configured to be executed on the player terminal 30 side via a web browser or other application.

In this embodiment, the game providing server 10 can be configured using a plurality of computers each having the hardware configuration described above. For example, the server 10 may be composed of one or more server devices.

The game providing server 10 configured in this manner has functions as a web server and an application server, and executes various processes in response to requests from web browsers or other applications installed in the player terminals 30. Then, screen data (for example, HTML data) and control data according to the result of the processing are transmitted to the player terminal 30 . A web page or other screen based on the received data is displayed on the player terminal 30 .

The player terminal 30 is configured as a general computer, and as shown in FIG. 35, and these constituent elements are electrically connected via a bus or the like (not shown).

The computer processor 31 is configured as a CPU, GPU, or the like, reads various programs stored in the storage 35 or the like into the main memory 32, and executes various instructions included in the programs. The main memory 32 is composed of, for example, a DRAM.

The input/output I/F 33 includes various input/output devices for exchanging information with an operator or the like. The input/output I/F 33 includes, for example, information input devices such as keyboards and pointing devices (for example, mice and touch panels), voice input devices such as microphones, and image input devices such as cameras. The input/output I/F 33 includes an image output device such as a display and an audio output device such as a speaker.

The communication I/F 34 is implemented as hardware such as a network adapter, various types of communication software, or a combination thereof, and is configured to enable wired or wireless communication via the communication network 20 or the like.

The storage 35 is configured by, for example, a magnetic disk or flash memory. The storage 35 stores various programs including an operating system, various data, and the like. A program stored in the storage 35 can be downloaded from an application market or the like and installed.

In this embodiment, the player terminal 30 may be configured as a smart phone, tablet terminal, wearable device, personal computer, game terminal, or the like.

A user (game player) of the player terminal 30 configured in this manner communicates with the server 10 via a web browser or other application installed in the storage 35 or the like, thereby providing information provided by the server 10. You can play games that

Next, functions of the game providing server 10 of this embodiment will be described. The computer processor 11 of the server 10, as shown in FIG. configured to function.

The game progress control unit 111 is configured to execute various processes related to controlling the progress of the game. For example, the game progress control unit 111 transmits screen data and control data of various screens related to the game to the player terminal 30, and responds to an operation input by the player via the screen displayed on the player terminal 30. , various processes (including various processes for progressing the game) are executed, and screen data, control data, and the like according to the results of the processes are transmitted to the player terminal 30 .

In this embodiment, the game provided by the game providing server 10 is configured to have a multiplayer mode in which a plurality of players participate. It is configured to control the progress of the game based at least on the operation by each.

In this embodiment, a plurality of players participating in the game constitute a team having a first game goal, and the game progress control unit 111 divides the plurality of players constituting the team into a first group and a second group. configured to separate. In this embodiment, the second group has a second game goal that is different than the team's first game goal. That is, among the plurality of players forming the team, the players belonging to the first group have the same first game goal as the team, while the players belonging to the second group have the actual game goal different from that of the team. Have a game goal. Each of the first group and the second group can be composed of one or more players.

In this embodiment, the game progress control unit 111 is configured to restrict disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group. For example, the players belonging to the second group are configured not to disclose that they belong to the second group at least at the start of the game to the players belonging to the first group. The screen displayed on the player terminal 30 of the belonging player is configured not to display the group to which each of the plurality of players forming the team belongs, at least at the start of the game.

Also, the game progress control section 111 is configured to transfer a player belonging to the first group to the second group in accordance with satisfaction of a predetermined condition. For example, one or more players belonging to the first group are configured to move to the second group in accordance with the satisfaction of a predetermined condition.

Thus, the game providing server 10 of the present embodiment divides a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal. It is divided into groups, restricting the disclosure of the fact that the players belonging to the second group belong to the second group to the players belonging to the first group, and according to the satisfaction of a predetermined condition, the players belonging to the first group are transferred to the second group. configured to move to Such a game can be said to be a game that requires bargaining and the like between a plurality of players, compared to a game in which a plurality of players forming a team simply cooperates to achieve the team's game goal. In this way, the game providing server 10 improves the gameplay in games in which a plurality of players participate.

In this embodiment, the second game goals of the second group include various game goals different from the first game goals of the team. For example, a second game goal may include a game goal that prevents a team from achieving a first game goal. In this case, the first and second game objectives are such that if the first game objective is achieved then the second game objective is not achieved, and conversely if the first game objective is not achieved then the second game objective is achieved. will have a relationship of Such a configuration allows the second group of players to enjoy impeding the team's achievement of the game goal.

In this embodiment, a player belonging to the second group may be allowed to perform a predetermined action that a player belonging to the first group cannot perform. For example, players belonging to the first group can perform normal actions, while players belonging to the second group can perform special actions in addition to the normal actions. In this case, the predetermined action that can be executed by the players belonging to the second group can be said to be advantageous to the achievement of the second game goal of the second group, but not advantageous to the achievement of the first game goal of the team. Includes actions such as Such a configuration may improve gameplay due to the existence of actions that can only be performed by the players of the second group.

In this embodiment, the predetermined conditions for a player belonging to the first group to move to the second group may include various conditions. For example, the game progress control unit 111 may be configured to move a player belonging to the first group to the second group according to execution of a predetermined action by a player belonging to the second group. For example, a predetermined action is performed with designation of a player belonging to the first group, and the designated player moves to the second group in accordance with the execution of the predetermined action. Alternatively, the predetermined action is executed without specifying a player belonging to the first group, and according to the execution of the predetermined action, any player belonging to the first group (for example, automatically according to a predetermined rule including random selection selected player) moves to the second group. Predetermined actions include various actions, such as using items or skills, and activating gimmicks. Such a configuration can improve gameplay by moving the players of the first group to the second group in response to the execution of actions by the players of the second group.

Also, for example, the game progress control unit 111 may be configured to transfer a player belonging to the first group to the second group in accordance with execution of a predetermined action by the player belonging to the first group. For example, in response to execution of a predetermined action by one player belonging to the first group, the one player or another player belonging to the first group moves to the second group. For example, the predetermined action includes using items or skills, activating gimmicks, and the like. Such a configuration can improve gameplay by moving the players of the first group to the second group in response to the execution of actions by the players of the first group.

Further, for example, the game progress control unit 111 receives a vote of a specific player belonging to the second group by each of the plurality of players forming the team, and discloses whether or not the player corresponding to the voting result is the specific player. can be configured to A specific player is defined as, for example, a player who belongs to the second group at the start of the game, a player who belongs to the second group at the present time, or the like. The player corresponding to the voting result is, for example, the player with the largest number of votes (the player with the highest number of votes). The game progress control unit 111, for example, accepts votes via screens displayed on the player terminals 30 of each of the plurality of players forming the team, determines the player corresponding to the voting result, and identifies the determined player. The player terminal 30 is configured to display a screen including information regarding whether or not the player is a player. Such an arrangement allows each player to enjoy voting for a particular player in the second group.

In this case, if the player corresponding to the voting result is not the specific player (if the specific player fails to be specified), any player belonging to the first group (for example, automatically selected according to a predetermined rule including random selection) player) may move to the second group. Furthermore, in this case, after a predetermined period of time has passed since the player belonging to the first group was transferred to the second group, the fact that the player has been transferred to the second group is disclosed to the player (that is, the player is transferred to the second group). The fact that the player has moved to the second group may not be disclosed to the player until a predetermined period has elapsed since then. Alternatively, or in addition to the elapse of a predetermined period of time, in response to a specific action or use of a specific item by the player transferred to the second group or the specific player, the player is transferred to the second group. It may be disclosed to the player who has moved to the second group. Such a configuration improves game playability regarding voting of specific players in the second group.

Further, when the player corresponding to the voting result is the specific player (when the specific player is successfully identified), the specific player is strengthened (for example, the parameter value of the specific player is improved). good too. Such a configuration prevents the specific player from being excessively disadvantaged when the players of the first group know that he is the specific player of the second group.

Next, a specific example as one aspect of the game providing server 10 of this embodiment having such functions will be described. In this example, the game providing server 10 provides a TPS (third-person shooting game) in which a player character included in the game space fights enemy characters (NPCs) appearing in the game space. Note that TPS is an example of the type of game in this embodiment, and in other examples of this embodiment, other types of shooting games such as FPS (first-person shooter), RPGs, and Various types of games other than shooting games, such as puzzle games, can be applied.

The TPS in this example also has a multiplayer mode in which multiple players participate. In the multiplayer mode, a predetermined number of players (specifically, seven players) form a team, and the team survives until the end of the game, and is able to capture as many bases as possible from multiple bases included in the game space. The goal of the game is to capture the base of

In addition, in the TPS of this example, one betrayal player is included in the predetermined number of players forming the team at the start of the game. In other words, the players forming the team are divided into a non-betrayal group (first group) composed of general players other than traitorous players and a traitorous group (second group) composed of traitorous players. The betrayal group has a game goal of preventing the team from achieving the game goal. The goal of the game is to control more bases than general players.

FIG. 2 exemplifies data items of a player information table that manages information about players in this example. As shown in the figure, the player information table is associated with "player accounts" that identify individual players, "basic information" including account names, etc., and whether or not players to play together are waiting for matching. "matching waiting flag" indicating the status, "session ID" identifying the session of the game being played, "HP (current value / maximum value)", "remaining number of lives", whether the player is a betrayal player a "betrayal player flag" indicating whether the player is a defecting player, a "turning over player flag" indicating whether or not the player is a defecting player, and "dominated base information" indicating information about bases conquered by the player. In this example, the initial value of the number of remaining lives is 3, and the number of remaining lives is decreased by 1 each time the HP decreases to 0 as the game progresses. A changeover player is a player who has been transferred from the non-betrayal group to the betrayal group during the game, as will be described later in detail.

FIG. 3 is a flow diagram illustrating the processing performed by the server 10 when the game is played in the multiplayer mode in this example. The server 10 first matches players to play together, as shown in the figure (step S100). In this example, seven players out of a plurality of players waiting to play the game (specified by referring to the matching waiting flag in the player information table) are matched as players to play together. be done. For example, players with similar strength are matched based on parameter values such as levels. Also, the same value is set to the session ID of the corresponding player information table for the seven players who are matched.

Subsequently, the server 10 selects one betrayal player from among the matched players (step S110). In this example, one player randomly selected from seven matched players is set as the betrayal player. Also, for a player selected as a betrayal player, a value indicating that the player is a betrayal player is set in the betrayal player flag of the corresponding player information table.

Here, setting a betrayal player can also be said to group the seven matched players into a non-betrayal group and a betrayal group. For example, when Player 3 is selected as a betrayal player out of seven players, Players 1 to 7, as illustrated in FIG. belongs to the traitor group.

Returning to the flowchart of FIG. 3, the server 10 subsequently executes battle processing (step S120). Battle processing is processing performed when each player operates a player character included in the game space to fight an enemy character or the like, and is controlled based on operations by each player. Operations by each player are performed via a screen displayed on the player terminal 30 .

FIG. 5 illustrates a battle screen 50 displayed on the player terminal 30. As shown in FIG. The battle screen 50 illustrated in FIG. 5 corresponds to general players (players of the non-betrayal group). As illustrated, the battle screen 50 corresponds to the entire area of the screen 50, and includes a game space display area 51 for displaying the game space, and a movement area 51 located in the lower left portion of the screen 50 for controlling movement of the player character. An operation object 52, an action operation area 53 located in the lower right corner of the screen 50 for operating the action execution by the player character, and a progress area located in the upper left corner of the screen 50 for displaying game progress information. an information display area 54; a map information display area 55 located below the area 54 for displaying the position of the player character in the game space and the range of field of view; and a player information display area 57 located in the upper right corner of the screen 50 and displaying information about a plurality of players forming a team.

A player character 511 is arranged in the center of the lower end of the game space display area 51 . Only the upper half of the body of the player character 511 is displayed when viewed from behind. controlled as It should be noted that the player may be allowed to control the position, orientation, and the like of such a virtual camera.

In the action operation area 53, a plurality of objects 531 to 534 corresponding to a plurality of actions that can be executed by the player character are arranged. A first action object 532 for executing one action, a second action object 533 for executing a second action, and a third action object 534 for executing a third action are arranged. The contents of the main action and the first to third actions are predetermined according to the type of player character. For example, by selecting these objects 531 to 534, the player can execute an action such as an attack on an enemy character or the like overlapping the target object 56. FIG.

The progress information display area 54 displays the progress information of the game. The game in this example repeats four battle periods with predetermined battle times. The four battle periods are called "Day 1", "Day 2", "Day 3" and "Last Day" in order, and the progress information display area 54 displays these names corresponding to the current battle period. . Also, of the four battle periods, the battle time of the first three battle periods (Days 1 to 3) is 90 seconds, and the battle time of the last one battle period (Last Day) is 120 seconds. The progress information display area 54 displays these battle times in countdown format. Although details will be described later, at the end of each of the first three battle periods, a betrayal player or a defector player is voted (judgment time).

The player information display area 57 includes a type display object 571 that displays the player type (general player, traitor player, or betrayal player), HP status, and remaining life count for each of the plurality of players that make up the team. An indicator 572 for displaying is arranged.

As described above, the battle screen 50 illustrated in FIG. 5 corresponds to the general player who is not the betrayal player, so the player information display area 57 corresponds to the player (displayed as "You"). A value "-" corresponding to the general player is displayed in the type display object 571 at the top. Also, the type display object 571 corresponding to the other players (Players 2 to 7) displays a value "?" indicating that the type is unknown. Thus, in this example, the types of other players are not disclosed to general players at the start of the game.

FIG. 6 exemplifies a battle screen 50 corresponding to a betrayal player. In this case, as shown in the figure, in the action operation area 53, in addition to the objects 531 to 534, an action switching object 535 for the betraying player is arranged. The object 535 is an object for the player to execute an action for the betraying player. Specifically, when the betraying player action switching object 535 is selected, the objects 531 to 534 are switched to objects for executing actions for the betraying player. In other words, the betrayal player can perform the action for the betrayal player in addition to the action for the general player. Actions for the betrayal player are predetermined in this example regardless of the type of player character. Actions for the traitorous player may include various actions that favor the traitorous group's achievement of the game goal.

For example, actions for a traitorous player include an action called "recapture a stronghold." Recapturing a base is an action of reconquering a base that is being controlled by another player and making it your own base.

Also, the action for the traitorous player includes, for example, an action called "hate pass". A hate pass is an action that gives another player a hate value (for example, it increases according to an attack on an enemy character). As the hate value increases, it becomes easier to receive attacks from enemy characters.

Actions for a traitorous player also include, for example, an action called "sight jack." Sight jacking is an action that is performed with the designation of an arbitrary player, and has the effect of displaying another player as an enemy character on the battle screen 50 of the designated player. As a result, it is assumed that the designated player attacks another player (fighting among general players).

Also, the action for the traitorous player includes, for example, an action called "summoning a base defense monster". Base defense monster summoning is an action that summons a monster to defend the base you are controlling.

Further, in the player information display area 57 of the battle screen 50 corresponding to the betraying player, the uppermost type display object 571 corresponding to the betraying player has a value "R" corresponding to the betraying player, as shown in FIG. is displayed, and the value "-" corresponding to the general player is displayed in the type display object 571 corresponding to other players.

During the battle period, the player (player character) moves through the game space via the battle screen 50 and performs various actions to defeat enemy characters appearing in the game space. We will take control of multiple bases that can be used. Specifically, when the durability value of the base is reduced to 0 by attacking the base, the base can be conquered. Also, in this example, the player who has dealt the most damage to the base is the player who conquers the base. Conquered base information in the corresponding player information table is updated for the player who has conquered the base.

Also, when the player receives damage from an attack from an enemy character or the like, his HP decreases, and when his HP reaches 0, he loses one life. If lives remain, the game restarts from a predetermined position in the game space. On the other hand, if there are no lives left (when the number of remaining lives is 0), the player is eliminated (the game ends).

Returning to the flowchart of FIG. 3, the battle process is performed until the battle time of the current battle period elapses. Then, when the battle time has elapsed, the server 10 next determines whether or not the battle period that has ended is the last battle period (Last Day) (step S130), and if it is not the last battle period ( If NO in step S130), voting processing is executed (step S140). In the voting process, each player votes for a player who is considered to be a betrayal player or a defector player, and the voting results are disclosed.

FIG. 7 illustrates a flow diagram of the voting process. In the voting process, the server 10 first determines whether or not the betrayal player has been identified in the previous voting process (step S200). In the first voting process, since there is no voting process up to the previous time, it is determined that the betrayal player has not been identified.

If the betrayal player has not been identified (NO in step S200), server 10 accepts the vote of the betrayal player (step S210). FIG. 8 exemplifies a first vote acceptance screen 60 for accepting a vote of a traitorous player. The screen 60 is displayed on each player terminal 30 when the battle period ends. The first voting acceptance screen 60 has a selection area 62 for selecting a player to vote and a voting button 64, as shown. Six player objects 621 corresponding to each of six players other than the player himself are arranged in the selection area 62 . The player can vote for the traitor player by selecting the vote button 64 while selecting the object 621 corresponding to the player to vote as the traitor player.

In this example, a predetermined time limit (for example, 10 seconds) is set for the betrayal player's vote, and the player who did not vote within the time limit is randomly selected as the betrayer player. automatically voted as In this case, a penalty may be given to the player who did not vote within the time limit (for example, life is reduced by 1).

Returning to the flow chart of FIG. 7, after accepting the votes of the traitorous players, the server 10 next determines the player with the highest number of votes and discloses the voting results (step S220). If there are two or more players with the most votes, the players with the most votes are voted again.

FIG. 9 illustrates a first voting result screen 70 for disclosing the voting results of the traitorous player. The screen 70 displays the player with the most votes and whether or not the player is a traitor. The first voting result screen 70 illustrated in FIG. 9 corresponds to the case where the player with the highest number of votes (“Player 3” in this example) is the traitor (successful identification). On the other hand, FIG. 10 illustrates the first voting result screen 70 corresponding to the case where the player with the most votes (“Player 2” in this example) is not the traitor player (identification failure).

Returning to the flowchart of FIG. 7, if the traitor player has been successfully identified (if the player with the most votes is the traitor player) (YES in step S230), the server 10 strengthens the traitor player (step S240). . For example, parameters such as HP and attack power of the traitorous player (player character) are strengthened. It should be noted that the appearance of the corresponding player character may be changed according to the strengthening of the traitorous player (for example, a human-like character may be changed to a monster-like character).

On the other hand, if the traitor player has not been successfully identified (failed) (if the player with the most votes is not the traitor player) (NO in step S230), the server 10 changes any general player to a betrayal player. (step S250). Specifically, one general player is randomly selected from a plurality of general players, and the selected one general player is changed to a player who turns over. For example, as illustrated in FIG. 11, when Player 6 is selected from six general players, Player 6 is changed to a betrayal player and moves from the non-betrayal group to the betrayal group. Also, for a player who has been changed to a turning-over player, a value indicating that he is a turning-over player is set in the turning-over player flag of the corresponding player information table.

In this example, the change from a normal player to a changeover player is disclosed to the betraying player, but is not disclosed to the changeover player himself at this point, but will be disclosed in the next voting process. Note that the change from the general player to the turning-over player is not disclosed to other general players.

Returning to the flowchart of FIG. 3, after the first voting process is performed, the server 10 proceeds to the second battle process (step S120).

FIG. 12 is a battle screen 50 corresponding to a general player, and illustrates a player information display area 57 of the screen 50 when specification of a traitorous player fails in the first voting process. An area 57 illustrated in FIG. 12 corresponds to a case where Player2, which is a general player, becomes the player with the most votes in voting in the voting process. The second type display object 571 displays the value "-" corresponding to the general player.

FIG. 13 is a battle screen 50 corresponding to a betrayal player, and illustrates a player information display area 57 included in the screen 50 when identification of the betrayal player fails in the first voting process. A region 57 illustrated in FIG. 13 corresponds to a case where Player6 is changed from a general player to a betrayal player in response to a specific failure of the traitorous player. The corresponding type display object 571 second from the bottom displays the value "B" corresponding to the rolling-over player. In addition, in the game space display area 51 of the battle screen 50 corresponding to the betrayal player, the player character corresponding to the general player and the player character corresponding to the turning over player are displayed so as to be identifiable.

As described above, since the change from the general player to the turning over player is not disclosed to the turning over player himself at this stage, the player information display area 57 of the battle screen 50 corresponding to the turning over player is illustrated in FIG. This is the same as the player information display area 57 of the general player, and for example, the value "-" corresponding to the general player is still displayed in the type display object 571 of the turning over player himself.

FIG. 14 is a battle screen 50 corresponding to a general player, and exemplifies a player information display area 57 of the screen 50 when a betraying player is successfully specified in the first voting process. An area 57 exemplified in FIG. 14 corresponds to a case where Player3, who is a betrayal player, becomes the player with the most votes in voting in the voting process. Object 571 displays a value "R" corresponding to a betraying player. In addition, in the game space display area 51 of the battle screen 50 corresponding to the general player, the player character corresponding to the general player and the player character corresponding to the identified betrayal player are displayed so as to be identifiable.

In this way, if the traitor player is successfully identified, the traitor player will be identified and targeted by the general players (they will be more likely to be attacked). The betrayal player is prevented from being excessively disadvantaged.

Returning to the flowchart of FIG. 3, when the battle time of the battle period (Day 2) in the second battle process elapses and the battle period ends, the server 10 proceeds to the second voting process (step S130). NO, and step S140).

Returning to the flowchart of FIG. 7, in the second voting process, if the betraying player has not been identified in the previous (first) voting process (NO in step S200), the server 10 again asks for the betraying player's vote. The process proceeds to reception (step S210). Then, as described above, if the betrayal player is successfully identified, the betrayal player is strengthened (step S240). step S250).

On the other hand, if the betraying player has been identified (YES in step S200), server 10 next determines whether or not there is a betraying player (step S260). If the betraying player has already been identified in the previous (first) voting process, there is no betrayal player at this point (NO in step S260), so the server 10 ends the voting process.

Returning to the flowchart of FIG. 3, after the second voting process has been performed, the server 10 proceeds to the third battle process (step S120). When the battle time of the battle period (Day 3) in the third battle process elapses and the battle period ends, the server 10 proceeds to the third voting process (NO in step S130 and ).

Returning to the flowchart of FIG. 7, in the third voting process, if the betraying player has not been identified in the previous (first or second) voting process (NO in step S200), the server 10 repeats the betrayal. The process proceeds to reception of player votes (step S210). Then, as described above, if the betrayal player is successfully identified, the betrayal player is strengthened (step S240). step S250).

On the other hand, if the betraying player has been identified (YES in step S200), server 10 next determines whether or not there is a betraying player (step S260). If a betraying player is unsuccessfully identified in the first voting process, and the betraying player is successfully identified in the subsequent second voting process, it means that there is one cheating player.

If there is a turning over player (YES in step S260), the server 10 notifies the player who turned over in the previous voting process that the player himself/herself has become a turning over player (step S265). .

Subsequently, the server 10 accepts the vote of the turning-over player (step S270). FIG. 15 exemplifies a second vote acceptance screen 80 for accepting the vote of the turning-over player. The screen 80 has a selection area 82 for selecting a player to vote for and a vote button 84, similar to the first vote acceptance screen 60 for voting for a traitorous player. In the selection area 82, six player objects 821 corresponding to each of the other six players other than the player himself/herself are arranged. , the object 821 corresponding to Player2 and Player3) cannot be selected. The player can vote for a changeover player by selecting the vote button 84 while selecting the object 821 corresponding to the player to vote as the changeover player.

In this example, a predetermined time limit (for example, 10 seconds) is set for the betrayal player's vote, similar to the above-described betrayal player's vote. , a randomly selected player is voted as the turning over player. In this case, a penalty may be given to the player who did not vote within the time limit (for example, life is reduced by 1).

Returning to the flow chart of FIG. 7, after receiving the votes of the players who turned over in this way, the server 10 then determines the player with the most votes and discloses the voting results (step S280). If there are two or more players with the most votes, the players with the most votes are voted again.

FIG. 16 illustrates a second voting result screen 90 for disclosing the voting results of the turning-over player. Similar to the first voting result screen 70 described above, this screen 90 displays the player with the most votes and whether or not this player is a side-turning player. The second voting result screen 90 illustrated in FIG. 16 corresponds to the case where the player with the most votes (“Player 6” in this example) is a player who turns over. On the other hand, FIG. 17 illustrates a second voting result screen 90 corresponding to the case where the player with the most votes (“Player 7” in this example) is not the turning over player.

Returning to the flow chart of FIG. 7, if the switching player is successfully identified (if the player with the most votes is the player who has the most votes) (YES in step S290), the server 10 forcibly removes the switching player ( step S300). On the other hand, if the switching player has not been successfully specified (failed) (if the player with the most votes is not the switching player) (NO in step S290), the server 10 ends the voting process.

Returning to the flowchart of FIG. 3, after the third voting process is performed, the server 10 proceeds to the final battle process (step S120). Then, when the battle period (Last Day) in the last battle process ends (YES in step S130), the server 10 determines the result of the game (step S150). Specifically, the number of bases controlled by general players of the non-betrayal group is compared with the number of bases controlled by betrayal players and betrayal players of the betrayal group, and the group with the largest number of bases is determined to be the winner. be done. If all players in the non-betrayal group or all players in the betrayal group drop out (the game ends) before the end of the final battle period, the group from which all players drop out is the loser at that point. and the other group is determined to be the winner.

In the above example, if a betrayal player cannot be specified by voting, an arbitrary general player is changed to a betrayal player (moved from the non-betrayal group to the betrayal group). In addition, according to the execution of a predetermined action by the player of the betrayal group, the general player is changed to a betrayal player (for example, if the betrayal player uses a predetermined item for a specific general player, the specific general player may be changed to a rolling-over player, etc.). Further, for example, in response to execution of a predetermined action by a player of the non-betrayal group, the general player is changed to a turning-over player (for example, when a specific general player activates a predetermined gimmick existing in the game space, the specific A general player may be changed to a turning-over player, etc.).

In the above example, the turning over player who is notified that he or she is the turning over player may be allowed to perform some or all of the actions for the traitorous player during the next battle period.

The game providing server 10 according to the present embodiment described above divides a plurality of players forming a team having a first game goal into a first group (for example, a non-betrayal group) and a group of players different from the first game goal. Divide into a second group (for example, a betrayal group) having two game objectives, restrict disclosure of the fact that the players belonging to the second group belong to the second group to the players belonging to the first group, and satisfy a predetermined condition. In response (eg, in response to the specific failure of the betraying player to vote), players belonging to the first group are configured to move to the second group. Such a game can be said to be a game that requires bargaining and the like between a plurality of players, compared to a game in which a plurality of players forming a team simply cooperates to achieve the team's game goal. In this way, the game providing server 10 improves the gameplay in a game in which a plurality of players participate.

In another embodiment of the present invention, part or all of the functions of the game providing server 10 in the above-described embodiment are realized by cooperation between the game providing server 10 and the player terminal 30, or the player terminal 30 can be realized only by

The processes and procedures described herein, other than those explicitly described, may be implemented in software, hardware, or any combination thereof. For example, the processes and procedures described herein are implemented by implementing logic corresponding to the processes and procedures in media such as integrated circuits, volatile memory, non-volatile memory, magnetic disks, and the like. Moreover, the processes and procedures described in this specification can be implemented as computer programs corresponding to the processes and procedures, and can be executed by various computers.

Although the processes and procedures described herein are described as being performed by a single device, software, component or module, such processes or procedures may be performed by multiple devices, software, components or modules. and/or by multiple modules. Also, the software and hardware elements described herein can be implemented by aggregating them into fewer components or by decomposing them into more components.

In this specification, even if the components of the invention are described as either singular or plural, or are described without being limited to either singular or plural, when the context requires otherwise , the component may be singular or plural.

10 Game Providing Server 11 Computer Processor 111 Game Progress Control Unit 15 Storage 30 Player Terminal 40 Game Program 50 Battle Screen 53 Action Operation Area 535 Action Switching Object for Traitor Player 57 Player Information Display Area 571 Type Display Object 60 First Voting Acceptance Screen 70 First voting result screen 80 Second voting acceptance screen 90 Second voting result screen

Claims (11)

A system for providing a game, comprising one or more computer processors, wherein the one or more computer processors, in response to executing readable instructions,
dividing a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal;
and controlling the progress of the game based at least on an operation by each of the plurality of players;
The step of controlling the progress of the game includes:
Restricting disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group;
Receiving votes by each of the plurality of players for the specific player belonging to the second group, and disclosing whether or not the player corresponding to the voting result is the specific player;
If the player corresponding to the voting result is not the specific player, moving the player belonging to the first group to the second group ;
system. In the step of controlling the progress of the game, when the player corresponding to the voting result is not the specific player, one player included in the plurality of players belonging to the first group is transferred to the second group and then a predetermined After a period of time has elapsed, disclosing to the one player that it has moved to the second group,
The system of Claim 1. A system for providing a game, comprising one or more computer processors, wherein the one or more computer processors, in response to executing readable instructions,
dividing a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal;
and controlling the progress of the game based at least on an operation by each of the plurality of players;
The step of controlling the progress of the game includes:
Restricting disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group;
transferring a player belonging to the first group to the second group in accordance with satisfaction of a predetermined condition;
Receiving votes by each of the plurality of players for the specific player belonging to the second group, and disclosing whether or not the player corresponding to the voting result is the specific player;
strengthening the specific player when the player corresponding to the voting result is the specific player;
system. the second game goal includes a game goal to impede the team from achieving the first game goal;
4. The system of any one of claims 1-3. Players belonging to the second group are configured to be able to perform a first action that players belonging to the first group cannot perform.
5. The system of any one of claims 1-4 . The step of controlling the progress of the game includes transferring a player belonging to the first group to the second group in response to execution of a second action by a player belonging to the second group.
6. The system of any one of claims 1-5 . The step of controlling the progress of the game includes transferring a player belonging to the first group to the second group in response to execution of a third action by a player belonging to the first group.
7. The system of any one of claims 1-6 . A method, executed by one or more computers, for providing a game, comprising:
dividing a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal;
and controlling the progress of the game based at least on an operation by each of the plurality of players;
The step of controlling the progress of the game includes:
Restricting disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group;
Receiving votes by each of the plurality of players for the specific player belonging to the second group, and disclosing whether or not the player corresponding to the voting result is the specific player;
If the player corresponding to the voting result is not the specific player, moving the player belonging to the first group to the second group ;
Method. A method, executed by one or more computers, for providing a game, comprising:
dividing a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal;
and controlling the progress of the game based at least on an operation by each of the plurality of players;
The step of controlling the progress of the game includes:
Restricting disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group;
transferring a player belonging to the first group to the second group in accordance with satisfaction of a predetermined condition;
Receiving votes by each of the plurality of players for the specific player belonging to the second group, and disclosing whether or not the player corresponding to the voting result is the specific player;
strengthening the specific player when the player corresponding to the voting result is the specific player;
Method. A program for providing a game, comprising:
A process of dividing a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal;
a process of controlling the progress of the game based on at least an operation by each of the plurality of players;
The process of controlling the progress of the game includes:
Restricting disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group;
Receiving votes by each of the plurality of players for the specific player belonging to the second group, and disclosing whether or not the player corresponding to the voting result is the specific player;
If the player corresponding to the voting result is not the specific player, moving the player belonging to the first group to the second group ;
program. A program for providing a game, comprising:
A process of dividing a plurality of players forming a team having a first game goal into a first group and a second group having a second game goal different from the first game goal;
a process of controlling the progress of the game based on at least an operation by each of the plurality of players;
The process of controlling the progress of the game includes:
Restricting disclosure to the players belonging to the first group that the players belonging to the second group belong to the second group;
transferring a player belonging to the first group to the second group in accordance with satisfaction of a predetermined condition;
Receiving votes by each of the plurality of players for the specific player belonging to the second group, and disclosing whether or not the player corresponding to the voting result is the specific player;
strengthening the specific player when the player corresponding to the voting result is the specific player;
program.

Images