JP2015134066A - Control method of game management server device, game management server device, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enable a player belonging to a group which participates in a participation group limiting match to associate with a player belonging to a group which does not participate in a participation group limiting match event even when a game has a participation group limiting match event that limits groups to participate and to expand a social graph.SOLUTION: A game management server device transmits to a player who does not belong to a group participating in a participation group limiting match event invitation information that invites a player who does not belong to a group participating in the participation group limiting match event to the participation group limiting match event on the basis of operation of a terminal device of a player who belongs to any of groups participating in the participation group limiting match event, and has a player who has transmitted approval information approving the invitation on the basis of the invitation information participate in the participation group limiting match event as a player of the group to which the player who has invited belongs to.

Description

  The present invention relates to a game management server device control method, a game management server device, and a program.

  In recent years, games provided from a server device to a mobile terminal operated by a player via a communication network have gained popularity, and many game titles have been released from a plurality of platforms. There are a wide variety of types and categories of these games, and among them, so-called social games that allow a plurality of players to participate in the same game are booming. It can be said that this social game uses a community-type network service called a social networking service (hereinafter referred to as “SNS”).

  As a social game utilizing such SNS characteristics, for example, a battle event such as a battle (battle) in which characters (player characters) operated by a plurality of players attack one or a plurality of enemy player characters is developed. Things are known. In this case, each player becomes a member of a specific group such as a guild, a party, a team, and a community, which will be described later, and by defeating an enemy player character, Various rewards such as points and items that can be used in the game can be awarded.

  Such a battle event aimed at defeating an enemy player character by a plurality of player characters is conventionally called a “raid battle” in the social game field, or a group or guild is the head of its English notation. An enemy player character represented by a letter (G) and appearing in a raid battle is represented by an initial (R) in English as a raid player character, and “GvR” (“v” is an English representation of Versus Meaning; the same shall apply hereinafter).

  In addition, social games are also widely known in which individual battle events in which player characters fight one-on-one or battle events in which battles between groups are performed (including not only battles but also sports such as team sports) are performed. . As an example of the latter, for example, in Patent Document 1, when a match between a plurality of parties to which a player character belongs is established in a coliseum hall, which is a predetermined virtual space in the game, a group battle (battle) by those parties is performed. Online games to be played are listed. In the social game field, such direct battles between groups are conventionally called “guild battles” or, as described above, a group or guild is expressed by its initial acronym (G). Sometimes referred to as “GvG”.

JP2013-66524A

  By the way, in the above-described battle event, not only a simple battle in which a battle event is performed between groups, but also a social game in which a plurality of groups participate and a battle event is sequentially performed among the plurality of participating groups. is there. For example, in a championship game, a selection game, a league exchange game, and the like, a battle event is sequentially performed among groups permitted to participate in many guilds. Hereinafter, among the battle events, a battle event in which only a group permitted to participate (in other words, group participation is restricted) will be referred to as a participation group restricted battle event.

  However, players who belong to a group that is allowed to participate even if they apply for participation in the participation group restricted battle event cannot participate in the participation group restricted battle event and cannot enjoy the game. In addition, for example, if a game has a specification in which a normal battle event that is not restricted to participation can not be performed while the participation group restricted battle event is held, participation in the participation group restricted battle event is permitted. Players belonging to a group that has not been played cannot enjoy the game at all.

  In this case, players belonging to a group that can participate in the participation group restricted battle event can interact with players belonging to other groups through the competition event, but belong to a group that could not participate in the participation group restricted competition event. The player who does not interact with the players belonging to other groups, and the exchange is closed within the group. In such a situation, there is a possibility that a problem arises in which a correlated human relationship on the web or its connection, that is, a so-called social graph does not spread.

  Therefore, the present invention has been made in view of such circumstances, and even when the participation group has a restricted participation group limited battle event, the players belonging to the group participating in the participation group limited battle event, and the participating group An object of the present invention is to provide a game management server device control method, a game management server device, and a program that provide a social game capable of expanding a social graph by interacting with players belonging to a group that does not participate in a limited battle event. And

  In order to solve the above-described problem, a method for controlling a game management server device according to a predetermined embodiment of the present invention includes a group connected to a plurality of terminal devices operated by a player via a communication line and participating in the terminal devices. A game management server device control method for providing a game including a participation group restricted battle event in which a certain restriction is provided, wherein the players belonging to any of the groups participating in the participation group restricted battle event Based on the operation of the terminal device, a step of sending invitation information to invite to the participation group restricted battle event to a player who does not belong to the group participating in the participation group restricted battle event, and an invitation based on the invitation information The player who transmitted the consent information for accepting And a step of the to participate in the participating groups restrict competition events as the player of the-loop.

  Here, the “player” is a user who operates the terminal device, and is a concept that also applies to a client of a so-called client-server system, from the viewpoint of being distinguished from a user (server administrator, etc.) of the server device. This is expressed as “player”. Further, in general, a player can participate in a game through a game medium (hereinafter referred to as a player character) including characters that perform activities, actions, thoughts, and the like in a virtual game space instead of himself / herself. Accordingly, in the present disclosure, the term “player” may strictly indicate the player character, but may be simply referred to as “player” below.

  In addition, as a “group”, for example, as a general title, a virtual group having a plurality of members (members) such as “guild”, “party”, “team”, and “community” with various tastes. Examples include aggregates. Such a “group” may be created and formed for each game title, or may be created and formed for each platform, for example, as a common group or shared group that crosses a plurality of game titles. . In addition, in this disclosure, “matching event” is described as a main group event, but in addition to such a battle type event, an exchange event between groups executed as part of a social game, etc. Different types of events may be included.

  In addition, a game management server device according to a predetermined embodiment of the present invention is connected to a plurality of terminal devices operated by a player via a communication line, and a participation group in which a certain restriction is provided on a group to participate in the terminal device. A game management server device for providing a game including a limited battle event, wherein the participation group limitation is based on an operation of the terminal device by a player belonging to any of the groups participating in the participation group limitation battle event. A means for transmitting invitation information for inviting to the participation group limited battle event to a player who does not belong to a group participating in the battle event, and a player who has transmitted acceptance information for accepting an invitation based on the invitation information, As a player of the group to which the invited player belongs, And a means to participate in the event.

  A program according to a predetermined embodiment of the present invention is a participation group limited battle event in which a plurality of terminal devices operated by a player are connected via a communication line, and a certain limit is set on a group to participate in the terminal device. The game management server device that provides the game including the game device participates in the participation group limited battle event based on the operation of the terminal device of a player belonging to any one of the groups participating in the participation group limited battle event The player who has invited the player who does not belong to the group to send the invitation information for inviting to the participation group restricted battle event and the player who has sent the acceptance information for accepting the invitation based on the invitation information. Participate in the participation group limited battle event as a player of the group to which he belongs To be realized and means.

  According to the control method of the game management server device, the game management server device, and the program according to the present invention, even when the participating group has a participation group restricted battle event in which the participating group is restricted, the group participating in the participation group restricted battle event It is possible to provide a social game in which a social graph can be expanded by interacting with a player who belongs and a player who belongs to a group that does not participate in the participation group restricted battle event.

It is a schematic block diagram (system block diagram) which shows suitable one Embodiment which concerns on the game management server apparatus by this invention. 1 is a schematic configuration diagram (system configuration diagram) showing a preferred embodiment of a game system according to the present invention. It is a schematic diagram which shows the structural example of the game screen in the game of this invention. It is a figure which shows an example of the battle history data storage part by this invention. It is a figure which shows an example of the solo player data storage part by this invention. It is a figure which shows an example of the friend data storage part by this invention. It is a figure which shows an example of the exclusion player data storage part by this invention. It is a figure which shows an example of the assistant data storage part by this invention. It is a figure which shows an example of the assistant registration screen by this invention. It is a flowchart which shows an example of the process until it invites the other player by this invention. It is a flowchart which shows an example of the process until it replies with respect to the invitation message by this invention. It is a flowchart which shows an example of the process until it confirms the player condition of the guild by this invention. It is a figure which shows an example of the player condition display screen by this invention. It is a flowchart which shows an example of the assistant person limit number change process by this invention.

  Hereinafter, embodiments of the present invention will be described in detail. The following embodiments are examples for explaining the present invention, and are not intended to limit the present invention only to the embodiments. The present invention can be variously modified without departing from the gist thereof. Furthermore, those skilled in the art can employ embodiments in which the elements described below are replaced with equivalent ones, and such embodiments are also included in the scope of the present invention. Furthermore, positional relationships such as up, down, left, and right shown as needed are based on the display shown unless otherwise specified. Furthermore, various dimensional ratios in the drawings are not limited to the illustrated ratios. In the following, for ease of understanding, an embodiment in which the present invention is implemented using a game information processing apparatus will be described as an example. However, as described above, the present invention is not limited thereto.

  FIG. 1 is a schematic configuration diagram (system block diagram) showing a preferred embodiment of a server device (game management server device) according to the present invention. FIG. 2 is a schematic configuration diagram (system configuration diagram) showing a preferred embodiment of the game system according to the present invention. As shown in these drawings, the server apparatus 100 is a server computer connected to a network 200, and a server function is developed by a predetermined server program running on the server computer. In addition, the server system 100 and the terminal device 2 such as the client computer 21 and the portable terminal 22 that are also wired and / or wirelessly connected to the network 200 are set to be communicable with each other, whereby the game system 1 is configured. Is done.

  The network 200 is a communication line or communication network related to information processing including the Internet, for example, and its specific configuration is configured so that data can be transmitted and received between the server device 100 and the terminal device 2. If there is no particular limitation, for example, a base station wirelessly connected to the terminal device 2, a mobile communication network connected to the base station, the Internet connected to the server device, a gateway connecting the mobile communication network and the Internet The thing provided with an apparatus is mentioned.

  The server device 100 includes an arithmetic processing unit 101 such as a CPU and an MPU, a ROM 102 and a RAM 103 as storage devices, an external interface 104 to which an input unit 105 and an external memory 106 are connected, an image processing unit 107 to which a display monitor 111 is connected, a disk Alternatively, the slot drive 108 in which a memory device or the like is accommodated or connected, the audio processing unit 109 to which the speaker device 112 is connected, and the network interface 110, for example, a system bus including an internal bus, an external bus, and an expansion bus They are connected to each other via a path 120. Note that the device units responsible for input / output, such as the input unit 105, the external memory 106, the display monitor 111, and the speaker device 112, may be omitted as appropriate, and even if they are provided, It is not always necessary to connect to the transmission line 120 at all times.

  The arithmetic processing unit 101 controls the overall operation of the server apparatus 100, transmits and receives control signals and information signals (data) to and from other components described above, and performs various arithmetic processes necessary for game execution. I do. Therefore, the arithmetic processing unit 101 performs arithmetic operations such as addition / subtraction / multiplication / division using a numerical operation unit, logical operations such as logical sum, logical product, logical negation, bit, etc. for a storage area such as a so-called register that can be accessed at high speed. Bit operations such as sum, bit product, bit inversion, bit shift, bit rotation, etc., and further, saturation operation, trigonometric function operation, vector operation, etc. can be performed as necessary.

  The ROM 102 generally stores an IPL (Initial Program Loader) that is executed first after the power is turned on. By executing this, the disk 102 or the memory device accommodated in or connected to the slot drive 108 is recorded. The recorded server program or game program is once read into the RAM 103 by the arithmetic processing unit 101, and the program is executed by the arithmetic processing unit 101. Furthermore, the ROM 102 stores an operating system program and other various data necessary for operation control of the entire server apparatus 100.

  Further, the RAM 103 is for temporarily storing a server program, a game program, and various data. As described above, the read server program and game program, other game progresses, and a plurality of data are stored. Data necessary for communication between the terminal devices 2 is held in the RAM 103. Further, the arithmetic processing unit 101 sets a variable area in the RAM 103 and directly performs a calculation using a numerical arithmetic unit for the value stored in the variable area, or registers the value stored in the RAM 103 as a register. The data is temporarily copied or moved and stored, and the calculation is directly performed on the register, and further, the calculation result is written back to the RAM 103.

  The input unit 105 connected via the external interface 104 receives various operation inputs performed by the user (game provider) of the server device 100. The input unit 105 includes a keyboard, a touchpad, In addition to the touch panel, for example, a voice input device can be employed, and the type of device is not particularly limited as long as various operation inputs, determination operations, cancellation operations, menu display, and the like can be input.

  Furthermore, in the RAM 103 and the external memory 106 detachably connected via the external interface 104, the operating status of the server device 100, the access status of each terminal device 2, the game play status and the progress status of each terminal device 2 Data indicating (past results and the like), data of a log (record) of communication between the terminal devices 2 and the like are stored in a rewritable manner.

  Further, the image processing unit 107 processes various data read from the slot drive 108 by the arithmetic processing unit 101 or the image processing unit 107 itself, and then stores the processed image information in a frame memory or the like. Record. The image information recorded in the frame memory is converted into a video signal at a predetermined synchronization timing, and is output to the display monitor 111 connected to the image processing unit 107. Thereby, various image displays are possible. Further, the image information related to the game is transmitted from the image processing unit 107 and / or the arithmetic processing unit 101 to each terminal device 2 through a cooperative process with the arithmetic processing unit 101 or the like.

  Furthermore, the audio processing unit 109 converts various data read from the slot drive 108 into audio signals, and outputs the audio signals from the speaker device 112 connected to the audio processing unit 109. Also, sound information (sound effect and music information) related to the game is sent from the sound processing unit 109 and / or the calculation processing unit 101 to each terminal device 2 through a cooperative process with the calculation processing unit 101 or the like.

  Furthermore, the network interface 110 is for connecting the server apparatus 100 to the network 200. For example, the network interface 110 conforms to various standards used for constructing a LAN, an analog modem, an ISDN modem, an ADSL modem, and a cable television. A cable modem or the like for connecting to the Internet or the like using a John line, and an interface for connecting these to the arithmetic processing unit 101 via the transmission path 120.

  The server device 100 configured in this way is configured to group a battle event held in the game, that is, a battle between guilds G1 and G2 (both groups) to which the player belongs (a battle corresponding to GvG described above). Provided to the player to which he belongs (terminal device 2 operated by the player). In this way, in the battle event provided by the server device 100, only guilds that are allowed to participate can participate, such as a championship game, a selection game, a league exchange game, etc. (in other words, participation of the guild is restricted). A) Participating guild limited competition events. In addition, in the participation guild limited battle event, even if each guild is distinguished as a guild participating in the participation guild limited battle event as a first guild (group) and a guild that cannot participate in a participation guild limited battle event as a second guild (group). good.

  Next, a preferred embodiment of a game (social game) executed in accordance with the game program according to the present invention will be described below. FIG. 3 is a schematic diagram illustrating a configuration example of a game screen in a social game.

  Note that various processes (image and screen display, determination, calculation, and the like) in the following procedure are executed based on control commands from the arithmetic processing unit 101 of the server apparatus 100. In addition to the ROM 102 and RAM 103 and the external memory 106 described above, various storage media on which information related to the game is recorded are combined to form an information storage unit.

  The player operates the terminal device 2 (client computer 21 or mobile terminal 22; tablet terminal, smart phone, or the like), and connects the terminal device 2 to the server device 100 via the network 200 such as the Internet. Then, by operating the terminal device 2, the player selects a game provided from the server device 100 and provided with the above-described battle event, or on the platform screen before selecting the game, an ID number or a password Enter your login information. When the arithmetic processing unit 101 of the server device 100 recognizes the log-in information, it displays on the terminal device 2 a my page screen or my home screen unique to the player associated with the ID number. Depending on the type of game, a banner listing a plurality of scenes (for example, location, dungeon, quest, etc.) set as game scenes is displayed on the My Page screen. These locations, dungeons, quests, etc. may or may not be hierarchized with each other or as individual structures.

  Further, in this game, the arithmetic processing unit 101 of the server device 100 displays a menu screen related to the above-described “guild” that is a group to which each player belongs on the My Page screen or the My Home screen. If the player has previously played or participated in the game selected by the player, the player basically belongs to a predetermined guild, and the information is stored in an information storage unit such as the ROM 102. It is recorded in association with specific information such as player ID information. Based on the information, the arithmetic processing unit 101 further displays on the terminal device 2 information on the guild to which the player belongs and, if necessary, an edit menu related to the guild.

  On the other hand, since the player who plays the game for the first time and the player who participates in the game for the first time (first participation player) basically do not belong to a specific guild, the arithmetic processing unit 101 does not belong to the guild. A menu screen for searching (searching) a guild or creating (establishing) a new guild is displayed on the terminal device 2. The player can determine or create a guild in which he / she participates by operating the terminal device 2 in accordance with an instruction in a pull-down menu or the like sequentially displayed from the menu screen. For the first participating player, the guild to which the arithmetic processing unit 101 belongs may be automatically determined based on the player's play level. Further, when a player who is not the first participating player but does not belong to the guild (unaffiliated player) intends to belong to the guild, the arithmetic processing unit 101, for example, the play level of the unaffiliated player, the play of this game You may make it determine automatically based on the frequency | count and login time. As an example of this determination method, it can be considered that the player is determined so as to belong to the guild in which the play level, the number of times of play, and the login time are close (within a predetermined range).

  After the player's guild is determined or selected, an event list (a list of normal battle events and the above-mentioned participation guild limited battle events) is displayed on the terminal device 2 as necessary, and the player participates in the main battle event. When it is selected, a screen of a battle event being performed at that time is displayed on the terminal device 2 of the player. Thereby, the player can freely participate in the battle event held at that time. However, in the case of the above-mentioned participation guild limited competition event, certain restrictions are imposed on participation. At this time, a preparation screen or introduction screen for various battle events may be displayed on the terminal device 2 of the player, which may be a still image or a moving image (flash or the like).

  Here, with reference to FIG. 3, an example of the state at the start of execution of the participation guild limited battle event displayed on the terminal device 2 of each player will be described. As a processing procedure in this guild battle (sometimes called a quest or a turn depending on the game title), first, an event field F and a palette P are defined as display areas for game images on the display screen 2a of the terminal device 2. Each component is displayed in the display area. Also, an assistant player character (details will be described later) participates in the example of the battle event shown in FIG.

  Specifically, in the event field F, player characters A1 to A3 and assistant player characters A4 and A5 belonging to the guild G1, and player characters B1 to B3 and assistant player characters B4 and B5 belonging to the guild G2 are constituent elements. Displayed as part of. That is, here, in the event field F, the player characters A1 to A3 of the guild G1 and the assistant player characters A4 and A5 are mainly displayed (main field of the guild G1), and the player characters B1 to B3 of the guild G2 are displayed. In addition, an area (main field of the guild G2) in which the assistant player characters B4 and B5 are displayed is defined. Then, the player characters A1 to A3 and the assistant player characters A4 and A5 belonging to the guild G1, and the player characters B1 to B3 and the assistant player characters B4 and B5 belonging to the guild G2 are united, The final battle with the opponent player character is performed. Here, the assistant player character is a player who does not belong to any of the groups participating in the participation guild limited battle event, and is a player operated by a player invited to the participation guild limited battle event under certain conditions. A character (details will be described later). In FIG. 3, the assistant player characters A4, A5 of the guild G1 and the assistant player characters B4, B5 of the guild G2 are the same number, but the player ID (player character) stored in the assistant data storage unit 55 described later. Players according to the number can participate in participation guild limited battle events as assistants.

  The main fields of the guilds G1 and G2 are composed of subfields G1f and G1b and subfields G2f and G2b, respectively, surrounded by a dashed line in the figure. In this embodiment, player characters A1 to A3 belonging to guild G1 are arranged in subfield G1f, assistant player characters A4 and A5 are arranged in subfield G1b, and player characters B1 to B3 belonging to guild G2 are arranged in subfield G2f. The assistant player characters b4 and B5 are arranged in the subfield G2b. In FIG. 3, the player character belonging to the guild and the assistant player character are displayed by distinguishing the fields, but the player character belonging to the guild and the assistant player character are not distinguished from each other. May be arranged in the same field.

  Further, as a battle mode in this battle event, a palette P is displayed on the display screen 2a of each terminal device 2 of the player who operates the player characters A1 to A3 of the guild G1 and the assistant player characters A4 and A5. This pallet P has, as its constituent elements, when the player characters of the guilds G1 and G2 and the assistant player characters A1 to A5 and B1 to B5 attack the opponent player characters B1 to B5 and A1 to A5. This is a place to determine the “skills” that can be used (normal skills and special moves). In this palette P, a deck D which is a bundle of virtual cards and a plurality of cards selected from the deck D are displayed.

  On each card, the type of “technique” or a player character, a specific item related to the technique, an illustration, a character, or the like representing it is drawn or described. In addition, each card has the above-mentioned technique, attack value (technique or action point to be activated; action point (AP) or technique point (technique P)), defense value (may be physical strength or life power (HP)), Information such as attributes (colors such as red, green, and blue, forms such as fire, water, wood, and light) and rareness (rareness) are set. Then, when all of the types, attributes, rarity, etc. of the three cards 31, 32, 33 displayed sequentially by the player from the deck D are prepared, or when a specific combination (combination) is made, the player The effect that the attack power and defense power of the character and the assistant player characters A1 to A5 are increased is activated. Furthermore, the technique activated by the selection or combination of the cards 31, 32, 33 or the executing items 41, 42 associated therewith are below the player character and the assistant player characters A1-A5, B1-B5 in the event field F, respectively. Is displayed.

  In the state where the three cards 31, 32, and 33 are displayed on the palette P, when the player further selects (slays) a card from the deck D, any one of the cards 31, 32, and 33 ( For example, the leftmost card 31 in the drawing is deleted from the display screen 2a, and another newly selected card is displayed at this time. An effect may be performed in which the remaining cards 32 and 33 are slid to the left and slid out, and a new card is slid into the vacant space.

  The player characters A1 to A5 of the guild G1 and the player player characters A1 to A5 sequentially select (speak) the cards from the deck D in the pallet P, so that the technique and attack value set for each of the cards 31, 32, and 33. Depending on the specific item, defense value, etc., and the combination of their attributes, rarity, etc., the opponent's guild G2 player character and assistant player characters B1 to B5 will be attacked, and the damage to the opponent and the person will receive Damage is calculated. On the other hand, a similar display is made on the display screen 2a of each terminal device 2 of the player who operates the player character of the guild G2 and the assistant player characters B1 to B5, and the player character of the opponent guild G1 and the assistant player character A1. -Attacks A5.

  In addition, HP gauges 43 and 44 for the respective guilds G1 and G2 are displayed above the main field of each guild G1 and G2. Further, in the vicinity of the HP gauges 43 and 44, a player character and an assistant are displayed. Before the player characters A1 to A5 and B1 to B5 are attacked by the opponent player character and the assistant player characters B1 to B5 and A1 to A5, the number of times the player characters A1 to A5 and B1 to B5 have attacked the opponent player character continuously (so-called combo frequency). Displayed as combo gauges Cm1, Cm2. When the number of combos displayed on the combo gauges Cm1 and Cm2 exceeds a predetermined value, the player character and the assistant player characters A1 to A5 and B1 to B5 have the power of the technique applied to the opponent player characters B1 to B5 and A1 to A5. As a result, damage to the opponent player character is amplified. Then, based on the acquired points at the match end time and the remaining HP values, the winning or losing of both is determined.

  In the following, a process when a player who belongs to a group participating in the participation guild limited battle event invites at least a player who does not belong to a group participating in the participation guild limited battle event as an assistant to the participation guild limited battle event. explain. The memory | storage part used for the process for inviting this assistant is demonstrated with reference to FIGS. Each of these memory | storage parts is comprised in said information memory | storage part, for example. Moreover, the process of inviting the assistant who the server apparatus 100 (arithmetic processing part 101) performs etc. is demonstrated with reference to FIGS.

  First, each data memorize | stored in said information storage part is demonstrated with reference to FIGS.

  FIG. 4 is a diagram illustrating an example of a battle history data storage unit 51 that stores battle history data. The battle history data stored in the battle history data storage unit 51 is data relating to the battles that have been performed in the past of each guild. For example, the battle history number includes the date, the battle time, and the name of the opponent's guild. This is data in which the player character name of the player belonging to the guild who played in the battle event and the player ID corresponding to the player character name are associated with each other. Here, the player ID is an ID for specifying a player who operates the player character, and is, for example, an ID number at the time of login. Note that the items included in the battle history data may include data of other items as long as they are data related to the battle.

  For example, as shown in FIG. 4, the battle history data includes a battle history number “0001”, a date “2012/12/13”, a battle time “21: 00: 0-22: 30”, and a battle guild name. “Guild B”, player character name “XXXXX” and player ID “aabb”, player character name “XXXXX” and player ID “aacc”, player character name “XXX” and player ID “ aadd ”,... are associated with each other.

  FIG. 5 is a diagram illustrating an example of a solo player data storage unit 52 that stores player (solo player) data that does not belong to any guild in the game. The solo player data stored in the solo player data storage unit 52 is, for example, data in which a solo character number is associated with a player character name and a player ID corresponding to the player character name.

  For example, as shown in FIG. 5, the solo player data includes a player character name “xxx” and a player ID “bbba” in a solo player number “0001”, and a player character name “xxx in a solo player number“ 0002 ”. This is data in which a player character name “xxx □□” and a player ID “bbbb” are associated with a player ID “bbbc”, a player ID “bbbc”, and a solo player number “0003”.

  FIG. 6 is a diagram illustrating an example of the friend data storage unit 53 that stores data of friends of predetermined players belonging to any guild in the game. The friend data stored in the friend data storage unit 53 is, for example, data in which a friend character is associated with a player character name and a player ID corresponding to the player character name as a friend of a predetermined player. Here, the friend is, for example, a player who has a certain relationship (for example, exchanging messages in the past) with a predetermined player and is registered so that it can be easily communicated.

  For example, as shown in FIG. 6, the friend data is a friend of a predetermined player (player ID “aabb”, player character name “XXXXX”), and a friend character “0001” with a player character name “XXX”. ○ and player ID “bbaa”, friend character “0002” with player character name “XXΔΔ” and player ID “bbcc”, friend number “0003” with player character name “xxx □□” and player ID “0002”. bbdd ”,... are associated with each other.

  FIG. 7 is a diagram illustrating an example of the excluded player data storage unit 54 that stores data of player IDs (player characters) of players to be excluded from assistants. The excluded player data stored in the excluded player data storage unit 54 is data in which an exclusion number is associated with a player character name, a player ID corresponding to the player character name, and an exclusion start time. As the exclusion start time, for example, the time invited as an assistant or the time when the assistant is accepted is registered. Note that the items included in the excluded player data may include other items of data as long as they are items related to excluding the player. Further, in the present embodiment, when a player once participates in a predetermined guild as a helper, the player is set to restrict participation in another guild as a helper for a certain period (for example, one week). For this reason, the excluded player data storage unit 54 is provided. However, if the restriction is not provided, the excluded player data storage unit 54 may not be provided. Further, when it is configured to register a time when a player belonging to a certain guild invites a predetermined player as a helper, a certain period (for example, one week) is sent to a destination player who has transmitted the invitation message. ) The player belonging to the guild may be prohibited from selecting as an assistant. When a certain period has elapsed, the calculation processing unit 101 deletes the player ID (player character) from the excluded player data storage unit 54.

  For example, as shown in FIG. 7, the excluded player data includes an exclusion number “0001”, a player character name “ΔΔΔ ○”, a player ID “ccca”, and an exclusion start time “2013/12/12 21: 00: 00: 00”. ”, The player character name“ ΔΔΔ × ”to the exclusion number“ 0002 ”, the player ID“ cccb ”and the exclusion start time“ 2013/12/13 01:00:00 ”, and the player character name“ “ΔΔΔ □”, player ID “cccd”, and exclusion start time “2013/12/13 09:00:00”,...

  FIG. 8 is a diagram illustrating an example of an assistant data storage unit 55 that stores assistant data related to assistants of each guild. The assistant data stored in the assistant data storage 55 is data in which the guild name is associated with the assistant limit number, the assistant player character name, and the player ID corresponding to the player character name. The limit number of assistants limits the number of persons who can be registered as assistants set in each guild, and details of processing relating to calculation of the limit number will be described later with reference to FIG.

  For example, as shown in FIG. 8, the assistant data includes a guild name “Guild A”, an assistant limit “3”, an assistant player character name “□□□ ○”, a player ID “ddda”, an assistant player character name “ □□□ △ ”, player ID“ dddc ”, assistant player character name“ □□□ × ”, and player ID“ dddb ”are associated with each other.

  Next, an assistant registration process executed by the server apparatus 100 will be described with reference to FIGS.

  FIG. 9 is a diagram illustrating an example of a helper registration screen 61 that the arithmetic processing unit 101 of the server device 100 displays on the display screen of the terminal device 2 when the player registers a helper in the participation guild limited battle event. The assistant registration screen 61 is displayed on the display screen of the terminal device 2 by tapping a predetermined icon from the top screen of the participation guild limited battle event, for example. In the present embodiment, the assistant registration screen 61 is displayed on the display screen of the accessed terminal device 2 when accessing the server device 100 based on the player ID of the master of each guild. This allows only guild masters to invite helpers to their own guilds. In this way, you can invite helpers in line with the guild master policy. Note that the assistant registration screen 61 can be displayed in association with the player ID of a player other than the guild master by performing predetermined settings. A certain condition may be provided for inviting an assistant. For example, the guild's battle history (winning rate) must be greater than a certain level, the guild level must be greater than a certain level, the level of players belonging to the guild (all members or the average value) must be greater than a certain level, etc. It may be configured so that a guild satisfying can invite a helper.

  As shown in FIG. 9, a search start button 62 and a search setting 63 are displayed on the assistant registration screen 61. The search setting 63 includes a battle history button 64, a solo player button 65, a friend button 66, and an all button 67. The battle history button 64 is a button for instructing a setting for searching for a helper from the battle history, the solo player button 65 is a button for instructing a setting for searching for a helper from the solo player, and the friend button 66 is a friend or guild of the master. Is a button for instructing a setting for searching for an assistant from any one of the players belonging to the player, and the all button is a button for instructing a setting for searching for an assistant from all of the battle history, the solo player, and the friend. The search setting may be performed by tapping one or more from the battle history button 64, the solo player button 65, and the friend button 66, or all the buttons 67 may be tapped. Then, after the desired setting is made by the guild master, the search start button 62 is tapped to start the assistant registration process.

  Next, processing of the server device 100 after the search start button 62 is tapped on the terminal device 2 by the guild master will be described. FIG. 10 is a flowchart showing an example of processing until another player is invited as an assistant by the master of the guild.

  As illustrated in FIG. 10, the arithmetic processing unit 101 determines whether or not the search start button 62 has been tapped from the terminal device 2 (ST101). When it is determined that the search start button 62 has not been tapped (ST101: NO), the arithmetic processing unit 101 continues the standby state.

  If it is determined that the search start button 62 has been input (ST101: YES), the arithmetic processing unit 101 acquires search settings (ST102). More specifically, the arithmetic processing unit 101 acquires information related to the search setting from the terminal device 2 based on the setting of the search setting 63.

  Next, the arithmetic processing unit 101 searches for a player who is an object of an assistant (ST103). More specifically, the arithmetic processing unit 101 refers to at least one of the battle history data storage unit 51, the solo player data storage unit 52, and the friend data storage unit 53 based on the search setting acquired in step S102. And the corresponding player ID is extracted. For example, the arithmetic processing unit 101 temporarily stores the extracted player ID in the RAM 103. At this time, if a plurality of storage units are selected from the battle history data storage unit 51, the solo player data storage unit 52, and the friend data storage unit 53, the player ID may be extracted in duplicate. In this case, the arithmetic processing unit 101 deletes the duplicate player ID.

  Next, the arithmetic processing unit 101 performs processing for excluding a predetermined player ID from the searched player ID (ST104). More specifically, the arithmetic processing unit 101 refers to the excluded player data storage unit 54, temporarily stores the excluded player data in the RAM 103, the player ID stored in the RAM 103 in step S103, and the player stored in the RAM 103 in step S104. If there is a matching player ID, the player ID is deleted from the player ID that is the target of the assistant.

  Next, the arithmetic processing unit 101 displays information relating to the player corresponding to the player ID that is a helper target on the display screen of the terminal device 2 (ST105). At this time, for example, the arithmetic processing unit 101 may display a player with a level close to the master of the guild preferentially (for example, at the top of the search result), or duplicate player IDs as described above. If the information is extracted, the information of the player ID is stored in the RAM 103, and based on the information, information on the player corresponding to the player ID extracted from the plurality of storage units is preferentially displayed. You may do it.

  Next, based on the operation of the terminal device 2 of the master of the guild, the arithmetic processing unit 101 determines whether or not a player who is the subject of the assistant has been selected (ST106). If not selected (ST106: NO), the arithmetic processing unit 101 enters a standby state.

  If it is determined that the player has been selected (ST106: YES), the arithmetic processing unit 101 determines whether or not the selection of the player who is the assistant is within the limit of the assistant (ST107). More specifically, the arithmetic processing unit 101 determines whether or not the number of player IDs selected by the master is equal to or less than the limit number of assistants set in the guild to which the master belongs stored in the assistant data storage unit 55. Determine whether.

  In the process of step ST107, when it is determined that the number is less than or equal to the assistant limit (ST107: YES), the arithmetic processing unit 101 determines whether or not the selected player is participating in the assistant (ST108). This is because in this embodiment, it is set so that only one guild can participate as an assistant. Therefore, if the setting is such that participation in a plurality of guilds is possible, the process of step ST108 is not necessary.

  When it is determined in step ST107 that the number is not less than the assistant limit (ST107: NO) or in step S108, it is determined that the assistant is participating (ST108: YES), the arithmetic processing unit 101 displays the terminal device 2 A message is displayed on the screen indicating that the player selected by the guild master as an assistant cannot be selected as an assistant (ST108). If the arithmetic processing unit 101 determines NO in step ST107, for example, the message “Limit number of assistants” and “Please select again because the number of players selected as assistants exceeds the limit number of assistants” are displayed. It is displayed on the display screen of the terminal device 2. In addition, when it is determined YES in step ST108, the arithmetic processing unit 101 displays, for example, a message “The player is participating in an assistant. Please select another player”.

  Next, arithmetic processing section 101 determines whether or not to select again based on the operation of master terminal device 2 (ST110). If it is determined that the selection is to be made again (ST110: YES), the arithmetic processing unit 101 returns to the process of step ST106, repeats the subsequent processing, and if it is determined not to select again (ST110: NO), the arithmetic processing unit 101. Ends this processing.

  On the other hand, when it is determined in step ST108 that the assistant is not participating (ST108: NO), the arithmetic processing unit 101 transmits an invitation message (ST111). More specifically, the arithmetic processing unit 101 transmits an invitation message whose main content is that it is invited as an assistant from the guild to which the master belongs to the player with the player ID that has received the selection from the player (ST111). : Invitation means).

  Next, based on the operation of the master terminal device 2, the arithmetic processing unit 101 determines whether or not to end this process (ST112), and determines that an end instruction has been input (ST112: YES). This process is terminated. In the above-described process, the case where the process of searching for a player who is a helper target is executed based on the player ID has been described. However, the specification may be such that a player who is a helper target is searched based on the player character. .

  FIG. 11 is a flowchart showing an example of processing until the player who receives the invitation message sends a reply to the invitation message.

  When the player who has received the invitation message accesses the server device 100 based on his / her player ID, the player recognizes that the message has arrived and performs a predetermined operation on the terminal device 2 to confirm the content of the message. . The arithmetic processing unit 101 of the server device 100 accepts the operation and transmits an invitation message to the terminal device 2 (ST201). The invited player can confirm which guild has received the invitation as an assistant by displaying the message on the display screen of the terminal device 2. In addition, the invitation message may include information on the invitation guild, for example, information on players belonging to the guild (eg, guild master, guild level, level of players belonging to the guild, etc.). Further, the invitation message may include a link to a screen on which information on the above guild can be confirmed.

  Next, arithmetic processing section 101 determines whether or not the invitation has been accepted based on the operation of the player who has received the invitation (ST202). When it is determined that the invitation has been accepted (ST202: YES), the arithmetic processing unit 101 transmits an acceptance message indicating that the player has accepted the invitation to the master that is the source of the invitation message (ST203). Then, the arithmetic processing unit 101 stores the player ID and the player character name of the player in the assistant related data storage unit 55 in association with the master guild (ST204: participation means).

  In addition, when it is determined that the invitation has not been accepted (ST202: NO), the arithmetic processing unit 101 has not accepted the invitation to the master that is the source of the invitation message, that is, that the invitation has been rejected. Is transmitted (ST205). When a plurality of players are invited, the master transmits an invitation message to each player via the server device 100, and receives an acceptance message or a rejection message from each player to which the invitation message is transmitted. Note that the rejection message may not be transmitted regardless of the selection or selection of the invited player.

  FIG. 12 is a flowchart showing an example of processing until a player (master) who receives a reply to the invitation message confirms a player belonging to the guild and a player who participates as an assistant.

  The master to which the acceptance message or the rejection message has been transmitted accesses the game based on his / her player ID and recognizes that the message has arrived, and performs a predetermined operation on the terminal device 2. The arithmetic processing unit 101 of the server device 100 accepts the operation and transmits an acceptance message or a rejection message to the terminal device 2 (ST301). Thereby, the content of the acceptance message or the rejection message is displayed on the display screen of the terminal device 2. This display content includes an instruction button (not shown) for instructing to display the status of players belonging to the guild.

  Next, based on the operation of the master terminal device 2, the arithmetic processing unit 101 determines whether or not the instruction button has been input (ST302). When determining that the instruction button has not been input (ST302: NO), the arithmetic processing unit 101 ends this process.

  If it is determined that the instruction button has been input (ST302: YES), the arithmetic processing unit 101 displays on the display screen of the terminal device 2 the player status display screen 71 indicating the status of the player who belongs to the guild and the player who participates as an assistant. Is displayed (ST304). On the player status display screen 71, for example, as shown in FIG. 13, the players belonging to the guild A and the players invited to the guild A and accepted the participation are displayed in different areas. Each area can be scrolled, and the master can confirm all players who can participate in the participation guild limited battle event as players belonging to the guild.

  Next, the arithmetic processing unit 101 determines whether or not a close button (not shown) has been input (ST305). If it is determined that an end button has been input (ST305: YES), the player status display screen 71 is displayed. Is closed, and this process ends.

  Next, a process for changing the assistant limit number will be described. FIG. 14 is a flowchart illustrating an example of the assistant limit number changing process executed by the server apparatus 100. This process will be described with reference to an example in which the process of inviting an assistant is started for each predetermined guild, but it is performed for all guilds at a predetermined time. Alternatively, a desired timing may be set for each guild.

  First, when the arithmetic processing unit 101 determines that a master of a predetermined guild operates the terminal device 2 and starts a process of inviting an assistant, the arithmetic processing unit 101 reads the winning rate of the battle of the guild (ST401). The level is read (ST402), and the start time from the guild formation is read (ST403).

  Next, arithmetic processing section 101 substitutes the data read out in steps ST401 to ST403 into a predetermined calculation formula, and calculates a helper limit number (ST404). When the assistant limit number is calculated, the arithmetic processing unit 101 stores the calculated assistant limit number in the assistant data storage unit 55 in association with the guild (ST405).

  In addition, the winning percentage of the battle, the level of the player, and the start time from the formation of the guild used to calculate the limit number of assistants are only examples, and these items are not all necessary and include other items. May be calculated.

  According to the control method of the server apparatus 100 configured as described above, the server apparatus 100, and the program, a participation guild limited battle such as a championship game, a selection game, and a league exchange game, in which a certain restriction is provided on the participating guild. The event is provided to a player who operates the terminal device 2. Then, a player who belongs to one of the guilds participating in the participation guild restriction battle event operates the terminal device 2 to restrict the participation guild restriction to a player who does not belong to the group participating in the participation guild restriction battle event. It is possible to send an invitation message to invite to the battle event, and cause the player who has sent the acceptance message to accept the invitation to the invitation message to participate in the participation guild limited battle event as a player of the guild to which the invited player belongs. it can. Therefore, the social graph can be expanded by interacting with a player belonging to a guild participating in the participation guild restricted battle event and a player belonging to a guild not participating in the participation guild restricted battle event. Further, when sending an invitation message, the master of the guild can invite a player who operates a strong player character belonging to a guild that does not participate in the participation guild limited battle event, for example. When the player participates in the participation guild limited battle event as an assistant with this invitation, a sense of solidarity that they fought the battle event together is generated, so that the master can easily invite the player to his guild. It becomes possible. Furthermore, while the participation guild restriction battle event is being executed, even if the game has a specification in which other battle events are not executed, the players belonging to the guild that does not participate in the participation guild restriction battle event are restricted. It becomes possible to participate in a battle event. Therefore, even if the game specification is changed and a new battle event is not provided for a player who does not participate in the participation guild limited battle event, a player who does not participate in the participation guild limited battle event cannot enjoy the game at all. It can be avoided.

  In addition, since an invitation message can be sent to a player who does not belong to a guild participating in the participation guild limited battle event and belongs to a guild with a battle history, the invitation message can be sent to a guild that has played as an enemy in the past. You can communicate with the players you belong to, and you can further expand your social graph.

  In addition, the player who does not belong to the guild participating in the participation guild limited battle event and has a predetermined relationship with the player who transmitted the invitation message is a friend in the above embodiment. Since it can transmit with respect to a player, it becomes possible to expand a social graph further with respect to the player who has not participated in the said game, for example. In addition, an invitation message is sent to a player who does not belong to the group participating in the participation guild restricted battle event and has a predetermined relationship with any of the players belonging to the group participating in the participation group restricted battle event. You may be made to do.

  In addition, since the invitation message can be transmitted to a player who does not belong to a guild participating in the participation guild limited battle event and does not belong to any guild in the game, that is, a solo player, It is possible to convey the joy of performing a battle event belonging to the guild to players who are not good at human relations. By experiencing such fun, the solo player can newly participate in the guild, and can expect to play the game continuously.

  Further, the number of players that can be invited for each guild participating in the participation guild limited battle event is limited by the number of assistants, and the number of assistants is limited by the characteristics of the guild, for example, in the above embodiment, the winning rate of the battle, the guild Can be changed for each guild based on the level of the player belonging to the guild and the period since the guild was formed. As a method of changing the number of assistants, for example, if a setting (calculation formula) that increases the number of assistants if the winning rate of the battle event increases, the advantage that the number of assistants can be increased arises. When fighting, the player who belongs to the guild becomes more solid, and the social graph in the guild can be improved.

  Furthermore, since the player who sent the acceptance message in response to the invitation message cannot receive other invitations for a certain period of time, when the player participates in the participation guild limited battle event as an assistant, the player participates in the participation guild limited battle event. It becomes possible to strengthen the impression when doing. Further, it may be configured such that a player who once sent an invitation message is prohibited from sending another invitation message from another player for a certain period of time.

  Moreover, in the said embodiment, although demonstrated by the case where only one invitation message was transmitted with respect to a player, it is also considered that several invitation messages are transmitted with respect to one player. In preparation for such a situation, an acceptance message can be sent only to the player who sent the invitation message to the player the earliest to the player who sent a plurality of invitation messages. Anyway.

  Furthermore, in the above embodiment, a predetermined incentive (reward) may be given to the assistant's attack. For example, when an attack of a player who participates as an assistant is included in the combo, the combo effect may be pushed up, or a setting that increases the attack power of the assistant may be provided, or the assistant will have a certain activity Special items may be given to the guild when you do. By comprising in this way, the player who belongs to a guild will also invite other players actively as a helper, the improvement of a social graph can be aimed at, and also the activation of the whole game can be aimed at.

  In addition, as above-mentioned, this invention is not limited to said embodiment and the modification already described, A various deformation | transformation is possible in the limit which does not change the summary. For example, the configuration of the server device 100 illustrated in FIG. 1 is applicable to the client computer 21 and the mobile terminal 22 that are the terminal devices 2 although there are differences in processing capability and the like. In other words, the client computer 21 and the mobile terminal 22 can be used as the server device 100. That is, any computer device connected via the network 200 can function as a server device.

  Further, the server device 100 is configured to perform the same function as a memory device loaded in the ROM 102, the RAM 103, the external memory 106, the slot drive 108 using a mass storage device such as a hard disk or an SSD. These storage devices may or may not be redundant by RAID or the like, and may not be connected to the arithmetic processing unit 101 via the transmission path 120. As part of the networking, it may be connected to another external device or the like via the network 200.

  Furthermore, the network interface in the server device 100 and the terminal device 2 may be either a wireless LAN device or a wired LAN device, and may be either installed inside or of an external device type such as a LAN card. . Furthermore, as the terminal device 2, a game machine that can be connected to the network 200 may be used. In addition, for example, a communication karaoke device may be used.

  As described above, the control method of the game management server device, the game management server device, and the program of the present invention can improve the social graph and promote the activation of the entire game as a result of the battle event. it can. In particular, games that are distributed, provided, and implemented in a server-client type network configuration (in particular, those that include elements of social games), software and hardware related technologies that are related to the distribution, provision, and implementation of such games, and It can be used widely and effectively for activities such as design, manufacture, and sales.

1: Game system 2: Terminal device 2a: Display screen 21: Client computer (terminal device)
22: Mobile terminal (terminal device)
31, 32, 33: Cards 43, 44: HP gauge 51: Battle history data storage unit 52: Solo player data storage unit 53: Friend data storage unit 54: Excluded player data storage unit 55: Helper data storage 61: Helper registration screen 71: Player status display screen 100: Server device 101: Arithmetic processing unit 102: ROM
103: RAM
104: External interface 105: Input unit 106: External memory 107: Image processing unit 108: Slot drive 109: Audio processing unit 110: Network interface 111: Display monitor 112: Speaker device 120: Transmission path 200: Network (communication line)
A1-A3, B1-B3: Player characters A4, A5, B4, B5 belonging to the guild: Helper player characters Cm1, Cm2: Combo gauge D: Deck F: Event fields G1, G2: Guild (group)

Claims (12)

A method for controlling a game management server device, which is connected to a plurality of terminal devices operated by a player via a communication line, and that provides a game including a participation group limited battle event in which a certain limitation is provided to the participating groups. Because
Based on the operation of the terminal device of a player who belongs to any one of the groups participating in the participation group restricted battle event, the participation group for players who do not belong to the group participating in the participation group restricted battle event Sending invitation information to invite to the limited battle event;
And a step of causing a player who has transmitted acceptance information for accepting an invitation based on the invitation information to participate in the participation group restricted battle event as a player of a group to which the invited player belongs. In the step of transmitting the invitation information, the invitation information is transmitted to a player who does not belong to the participating group and belongs to a group having a battle history with a group to which the invited player belongs. The control method according to claim 1. 2. In the step of transmitting the invitation information, the invitation information is transmitted to a player who does not belong to the participating group and has a predetermined relationship with the player who transmitted the invitation information. The control method described in 1. In the step of transmitting the invitation information, the invitation information is a player who does not belong to the participating group and has a predetermined relationship with any one of the players belonging to the group participating in the participation group restricted battle event. The control method according to claim 1. In the step of transmitting the invitation information, the invitation information is transmitted to a player who does not belong to the participating group and does not participate in any group other than the participating group. The control method described. The number of players that can be invited to the participation guild limited battle event is limited for each participating group,
The control method according to any one of claims 1 to 5, further comprising: changing the number of players whose invitation is restricted for each group based on characteristics of each group. The step of transmitting the invitation information includes a step of prohibiting transmission of other invitation information for a certain period to a player who has transmitted acceptance information for the invitation information. The control method according to one item. The step of transmitting the invitation information includes a step of prohibiting the player who has transmitted the invitation information once from transmitting the invitation information for a certain period of time. Control method. 2. In the step of transmitting the invitation information, the consent information is transmitted only to a player who has transmitted invitation information earliest to the player to a player to whom a plurality of the invitation information has been transmitted. The control method as described in any one of thru | or 8. The control according to any one of claims 1 to 9, further comprising: a step of giving a predetermined reward to the player who has participated in the participation group restricted battle event based on the invitation information. Method. A game management server device that provides a game including a participation group restricted battle event that is connected to a plurality of terminal devices operated by a player via a communication line and that has a certain restriction on the participating group.
Based on the operation of the terminal device of a player who belongs to any one of the groups participating in the participation group restricted battle event, the participation group for players who do not belong to the group participating in the participation group restricted battle event A means of sending invitation information to invite to the limited battle event;
A game management server apparatus comprising: means for allowing a player who has transmitted acceptance information for accepting an invitation based on the invitation information to participate in the participation group restricted battle event as a player of a group to which the invited player belongs. A game management server device that is connected to a plurality of terminal devices operated by a player via a communication line, and that provides a game including a participation group restricted battle event in which a certain restriction is provided on a group to participate in the terminal device,
Based on the operation of the terminal device of a player who belongs to any one of the groups participating in the participation group restricted battle event, the participation group for players who do not belong to the group participating in the participation group restricted battle event A means of sending invitation information to invite to the limited battle event;
A program for realizing means for allowing a player who has transmitted acceptance information for accepting an invitation based on the invitation information to participate in the participation group restricted battle event as a player of a group to which the invited player belongs.

Images