JP2013138837A - Game management device, game system, game management method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a player with a game environment allowing the player to have a chance to restore a game friend relationship with a past game friend player for whom the game friend relationship has been cancelled.SOLUTION: A game management device includes: a game friend information storing means 54a for holding past game friend information associating two players with each other after game friend relationship between the two players is cancelled; a game friend history transmitting means 101 for transmitting a past game friend list of the relevant player to a terminal device operated by the player, upon request from the terminal device; and a game friend relationship restoration request means 102 for receiving information on operation from the terminal device displaying the past game friend list when operation of selecting a past game friend player is performed at the terminal device, and executing processing of the request for restoration of the game friend relationship from the player to the past game friend player.

Description

  The present invention relates to a game management device, a game system, a game management method, and a program for managing game information of each player.

  Conventionally, a game system in which a player can receive various game services provided from the game server by connecting the terminal device (personal computer, mobile phone terminal, etc.) of the player to a game server installed on the Internet. There is.

  There has also been proposed a game system in which players who play a common game via the Internet can build a friendship (see Patent Document 1).

  In recent years, the game system has been incorporated into a social networking service (SNS) system, which is a community-type service that promotes and supports connections between people, and is provided as one of the SNS services. Games are prevalent. In such a social game, each player becomes a friend with another player who uses the game service, and the players interact with each other by communicating with each other's players or cooperating with each other. Be able to. Each player becomes a friend with a plurality of other players, and can enjoy the game while interacting with these friends.

JP 2003-47778 A

  By the way, the friendship relationship between players can be canceled by any one player performing a friend canceling operation. And in the conventional game system, there was no system for reconstructing the friend relationship once canceled.

  In a conventional game system, in order for a player to establish a friendship relationship with a past fellow player again, it is necessary to find a past fellow player as a fellow candidate and apply for the fellow. However, it is never easy for a player to find a past fellow player, as shown below. In other words, the player to whom the player applies for a friend is usually found and selected from the friend candidate list presented by the game server, but the game server randomly extracts the friend candidates from the game service registrants. ing. Therefore, the probability that past fellow players are extracted as fellow candidates from a large number (for example, tens of thousands) of game service registrants is not high. As described above, conventionally, once the friendship relationship is canceled, it is difficult to reconstruct the friendship relationship with the past friend player.

  The present invention has been made in view of the above problems, and its purpose is to provide a game management apparatus, a game system, and a game system that provide a player with a game environment that has an opportunity to reconstruct a friendship relationship with a past friend player, To realize a game management method and program.

  (1) A game management device according to one aspect of the present invention is a game management device that communicates with each player's terminal device and manages a friend of a game in which the players can establish a friendship relationship. Even after the friendship between the two players is released, in response to a request from the friend information storage means for holding past friend information relating the two players and the terminal device operated by the player Among the past fellow information of the player stored in the fellow information storage means, past fellow information corresponding to a predetermined condition is transmitted from the fellow history transmission means and the fellow history transmission means. Friend revival which performs application process of affiliation revival to the past fellow player selected by the operation of the player in the terminal device from the transmitted past fellow information And 請 means is configured to include.

  The game management device having this configuration can be configured by an information processing device such as a server that can communicate with the terminal device of each player. And this game management apparatus performs the friend management of games, such as a social game etc. in which the players can build a friendship relationship, for example, a game where players can become friends and enjoy exchange.

  Here, friendship is a collective term for virtual relationships between players built in the game. Acquaintance, friend, friend, classmate, partner, relative, family, brother, sister, company or organization colleague Including various in-game relationships.

  In addition, the game management device includes fellow information storage means for holding past fellow information related to the two players even after the fellow relation between the two players who have established the fellow relation is cancelled. Yes.

  Moreover, this game management apparatus is provided with a fellow history transmission means. In response to a request from the terminal device operated by the player, the fellow history transmission means includes past fellow information corresponding to a predetermined condition among the past fellow information of the player stored in the fellow information storage means. Is transmitted to the terminal device.

  Then, the fellow revival application means executes an application process for revivaling the fellow relations to the past fellow player selected by the player's operation on the terminal device from the past fellow information transmitted from the fellow history transmission means. . Thus, the past fellow information which corresponds to a predetermined condition among the past fellow information of the player stored in the fellow information storage means is transmitted to the terminal device. When the player performs an operation of selecting a desired partner to restore the friendship in the received terminal device, it is possible to easily apply for the friendship revival for the partner.

  Needless to say, if a partner who has received an application for reviving a friendship from a player (a past player of the player concerned) approves it, the friendship between the two will be restored.

  As described above, according to the present configuration, the past fellow player selected by the player's operation on the terminal device from the past fellow information transmitted from the fellow history transmission means, for example, the past to the terminal device of the player. It is possible to provide the player with an unprecedented novel function of displaying the fellow player and making it possible to easily apply for a friendship revival to a desired partner. Thereby, it is possible to provide the player with a game environment in which there is an opportunity to reconstruct a friendship relationship with a past friend player. Therefore, for example, the following (a) to (c) that could not be achieved conventionally can be performed.

  (A) When a player accidentally cancels a friendship relationship with a partner who has been a friend due to an erroneous operation or the like, an opportunity to reconstruct the friendship relationship with the same partner is obtained thereafter.

  (B) If the player needs to temporarily leave the game for some reason (for example, devoted to overseas business trips or taking an examination), the friendship with the fellow player is canceled during that time, and then the game is resumed. Occasionally, an application for reviving a fellowship is made to a past fellow player.

  (C) In a game in which an upper limit is set for the number of friends in which each player can build friendships with other players, the following becomes possible. That is, in order for a player whose number of friends has reached the upper limit to become a friend with another new player Y, the relationship with the friend player X is once released. After that, in the case where the exchange as expected with the player Y is not possible, the relationship with the player Y is canceled, and the player X is requested to revive the friendship. In this way, it is possible to enjoy a new game that effectively uses a limited companion frame.

  (2) Said structure WHEREIN: It is preferable that the said predetermined conditions are time conditions when the friendship relationship was cancelled | released.

  In the configuration in which the friendship relationship is automatically canceled by the end of the friendship period described above, the player's past fellow players are likely to increase cumulatively. Therefore, for example, it is preferable to specify a time condition for canceling the friendship relationship so that past player players can be extracted. If narrowing down can be performed according to the time condition for canceling the friendship relationship, the operability especially when the number of past friends increases will be improved.

  (3) In the above configuration, when one of two players who are in a fellow relationship voluntarily cancels the fellow relationship, the fellow information storage means voluntarily cancels the peer relationship among the two players. And the player who has voluntarily released the friendship from the other party, and the friend history transmitting means responds to a request from the terminal device operated by the player, Of the past fellow information of the player stored in the fellow information storage means, information when the player voluntarily releases the fellow relation is read, and the past fellow whose voluntary relation is voluntarily released by the player Information for displaying the player is preferably transmitted to the terminal device.

  According to this configuration, when the fellow information storage means stores the past fellow information relating the two players, the side that voluntarily canceled the fellow relation and the side that has been canceled are stored separately. . Then, in response to a request from the terminal device operated by the player, the fellow history transmission means transmits information for displaying the past fellow player, who has voluntarily canceled the fellow relation, to the terminal device. Therefore, in the terminal device of the player who has received the information transmitted by the fellow history transmission means, only the past fellow players whose fellow relations have been released by the player are displayed, and the fellow relations are released from the partner. The other party's information can be prevented from being displayed.

  With this configuration, the player who has been released from the friendship relationship does not apply to the player who has canceled the friendship. Thereby, it is possible to effectively avoid a situation in which the player who voluntarily cancels the friendship relationship receives an application for reviving the friendship relationship in an undesired form from the friend player who has canceled the break at a later date.

  In addition, it is considered that the player on the side whose friendship has been canceled by the opponent often does not want to apply for a resurrection to the opponent who has released himself. Therefore, the effect that it becomes easy for a player to find a desired other party by displaying a past fellow player in a state where the other party who has released himself / herself is omitted can be expected.

  (4) In the configuration of any one of (1) to (3) above, the game management device has established a friendship relationship between two players, a player who has applied for a friend and a player who has approved the application. It is preferable that the apparatus further includes a friend formation point giving means for giving a friend formation point to at least the approved player. And the said friend formation point grant means is the said friend relations point given to the said fellow player who approved the friend application by the application process of the said friend relation revival which the said friend revival application means performed. It is preferable to make it higher than the above-mentioned friend formation point given to a player who has approved a normal friend application not based on the application process for resurrection.

  According to this configuration, when a friendship relationship is established between the player on the friend application side and the player on the approval side, the friend formation point giving means gives a friend formation point to at least the player on the approval side. This includes a form in which a friend formation point is given to both the player on the friend application side and the approval side, and a form in which a friend formation point is given only to the player on the approval side.

  And the friend formation point grant means is higher than the point to be given to the player who has approved the normal friend application, the point to be given to the past friend player who has approved the friend application by the application process of the friend relationship revival. To do. Thereby, the approval of the player who has received the application for reviving the friendship relationship is promoted, and the friendship relationship is easily revived, whereby the effectiveness of the function of reviving the friendship relationship can be enhanced.

  (5) In the configuration of the above (4), the game management device approves a fellow application by the fellow relation revival application process executed by the fellow revival application means by the past fellow players of the player, and the two players When the friendship is revived between the two players, the resurrection time storage means for storing information on the resurrection time of the friendship relationship between the two players, and the resurrection of the two players stored in the resurrection time storage means It is preferable to further include a re-resurrection limiting unit that does not permit the re-restoration of the friendship between the two players until a predetermined period of time elapses.

  As mentioned above, if the person who approves the application for reviving the friendship can get more points than approving the normal friendship application, the friendship can be resolved only with the aim of earning points with each other. There is a possibility that an inappropriate situation will occur in which the resurrection is repeated in a short period of time. In this configuration, in order to avoid such a situation, the revival time storage means stores the revival time when the friendship is revival between the players, and the re-resurrection limiting means passes a predetermined period from the revival time. Until then, it is configured not to allow the revival of the fellowship again.

  Here, the resurrection time storage means stores time information such as year, month, day, hour, minute, second as “resurrection time”, but the unit of the time to be stored here can be arbitrarily set. In addition, an arbitrary period can be set as the “predetermined period”, which is a period during which re-revival is prohibited after the friendship is revived. For example, the predetermined period may be a certain period (for example, three months), or the predetermined period may be varied according to the number of revivals of the friendship (the longer the number of revivals, the longer the predetermined period is set). Good.

  With this configuration, even if the two players plan an inappropriate point aim by repeating the cancellation and revival of the friendship, a predetermined period (for example, three months) will be provided after the friendship is once restored. It will not be possible to revive again until it has passed. Therefore, it is possible to effectively suppress an inappropriate player's action of repeatedly canceling and reviving the friendship in a short period aiming only at the point acquisition between the friends.

  (6) In the configuration of the above (4), the game management device approves a fellow application by the fellow relation revival application process executed by the fellow revival application means by the past fellow players of the player, and the two players It is preferable that a recovery time storage unit is further provided for storing information on the recovery time of the friendship between the two players when the friendship is restored between the two players. The fellow history transmission means may cancel the fellow relation between the two players again until a predetermined period elapses from the resurrection time of the two players stored in the resurrection time storage means. Even so, information to be transmitted when information for displaying a past fellow player is transmitted to the terminal device in response to a request from the terminal device operated by one of the two players. It is preferable not to include the information of the other player in.

  According to this configuration, the resurrection time storage means stores the resurrection time when the friendship relationship is resurrected between the two players, and until the friend history transmission means passes a predetermined period from the resurrection time, It is configured not to include the information of the other player in the information for displaying the past fellow player transmitted to one terminal device of the two players. As a result, even if the two players plan to improperly aim for the point by repeating the cancellation and revival of the friendship, a predetermined period (for example, three months) elapses after the friendship is once restored. Until then, the players of each other are not displayed on the terminal device as past friend players, so that it is not possible to apply for reinstatement of friendships. Therefore, it is possible to effectively suppress an inappropriate player's action of repeatedly canceling and reviving the friendship in a short period aiming only at the point acquisition between the friends.

  (7) In the configuration of (1) above, the game management device sets a fellow period setting means for setting a fellow period in which the fellow relation between the players is continued for two players in which the fellow relation is established. And a friendship canceling means for automatically canceling the friendship between the two players at the end of the friendship period set for the two players with whom the friendship is established. Preferably it is.

  According to this configuration, as will be described below, it is possible to provide the player with an environment in which it is easy to build a favorite group of friends. That is, a relatively high level player tends to desire to be a friend with another player at the same level as or higher than himself. However, when a player receives a friend application from another player at a lower level than himself / herself, it may be difficult to refuse the application without permission, and in some cases, the player approves the application and becomes a friend. However, for a high level player, if there are many friends at a lower level than himself / herself, an unfair feeling may occur with respect to the cooperative battle in the game. The reason is that a high-level player has a large contribution in a cooperative battle or the like with respect to other players, but cannot receive a similar contribution from a low-level player.

  Specifically, in a social game, when a player battles with another player, he / she can ask for cooperation from his / her friends (sometimes referred to as cooperative battle). And the higher the level of peers seeking cooperation, the more advantageous the battle. Conversely, if the level of the fellow is low, the degree of advantage will be low. Therefore, in general, a player with a high level is often asked for cooperation from a player with a low level, and there are many cases where the player contributes to other players. On the other hand, there is no player with a higher level than himself / herself. Will be dissatisfied that they cannot enjoy the same benefits.

  For this reason, if possible, a high-level player may have a desire to cancel a friendship with a lower-level player at a lower level than himself and to make a group structure of his / her favorite friends. Moreover, even if it is a fellow player of a lower level than a player, it is sufficient if it is a fellow player who can interact happily in the game. For fellow players of level, the player often wants to cancel the friendship. However, in order to do so, it is necessary to cut off the relationship between the player and other players (friends at a lower level than himself), but many players think that it is difficult to perform psychologically.

  Therefore, the game management device includes fellow period setting means for setting a fellow period in which the fellow relation between the players is continued for the two players in which the fellow relation is established. Here, the length of the fellow period set by the fellow period setting means can be set to an arbitrary period length such as one week, ten days, two weeks, or one month. Also, the length of the fellow period may be fixed, for example, the period length may be randomly changed at the time of setting, or an appropriate period length may be determined according to the level relationship between players. Also good.

  Moreover, the timing at which the fellow period setting means sets the fellow period can be arbitrarily determined. For example, the setting period of the fellow period may be when the fellow relation is established, may be after a certain period (for example, one week) has elapsed since the fellow relation is established, or for example, between two players It may be when a state in which alternating current is not performed for a predetermined period occurs.

  Then, the friendship cancellation means automatically cancels the friendship between the two players at the end of the friendship period set for the two players with whom the friendship is established. . Therefore, the player can cancel the friendship relationship by the end of the friendship period without performing a friend canceling operation that is difficult to perform psychologically. Therefore, for example, for a low-level friend who cannot enjoy the game together with little interaction after becoming a friend, the player cuts off the friendship at the end of the friendship period, and renews his / her preference. You can find the right friends. Then, if the player wants to continue the fellowship, the above-mentioned fellowship revival may be applied to the same partner again after the fellowship period.

  Thus, it is considered that the player does not make an application for reviving a friendship relationship with a lower-level friend who cannot enjoy the game together at the end of the friendship period. On the other hand, an opponent that the player desires (for example, a player who is a higher level player or a player who can enjoy a game together even by a lower level through exchanges, etc.) It is possible to apply. Therefore, this configuration makes it possible to configure a fellow group that the player prefers while repeating the fellow period setting by the establishment of the fellow relation, the automatic cancellation of the fellow relation at the end of the fellow period, and the application for the revival of the fellow relation as necessary. A converged environment is prepared.

  As in this configuration, when the friendship relationship is automatically canceled by the end of the friendship period set for the two players instead of intentional release by the players, the friendship relationship is restored as much as the friendship relationship is released. Since there are also many opportunities to think about it, the configuration of (1) above, which allows a friend revival application to be easily performed with a simple operation, is preferable.

  (8) A terminal device of each user who receives a game service according to another aspect of the present invention, and a game for managing a friend of a game that communicates with the terminal device and allows each player to establish a friendship relationship with another user And a management apparatus that stores past fellow information related to the two players even after the fellow relation between the two players being established is cancelled. In response to a request from the terminal device operated by the player and the player, past friend information corresponding to a predetermined condition among the past friend information of the player stored in the friend information storage means is transmitted to the terminal device. A past friend selected by an operation of a player on the terminal device from among the past fellow information transmitted from the fellow history transmitting means to be transmitted from the fellow history transmitting means. Fellow revival application means for executing the application processing of peer relations revived layer, each unit of either one of said game management device or the terminal device is a structure that includes.

  (9) A game management method according to still another aspect of the present invention is a game management method in a game management apparatus that communicates with each player's terminal device and manages a friend of a game in which the players can establish a friendship. The game management device stores a fellow information storage step for holding past fellow information related to the two players even after the fellow relation between the two players in which the fellow relation is established is canceled. In response to a request from the terminal device operated by the player, the game management device stores past fellow information corresponding to a predetermined condition among the past fellow information of the player stored in the fellow information storage step. From the previous friend information transmitted by the friend history transmitting step and the friend history transmitting step in the terminal device. In the past fellow player selected by the player's operation, the game management device, and fellow revival application step for executing application processing in peer relations resurrection, it is configured to include.

  (10) A program according to still another aspect of the present invention is a program for causing a computer to operate as the game management device having any one of the above-described configurations (1) to (7). It is a program for making it function as each means with which a management device is provided.

  According to the present invention, it is possible to provide a player with an unprecedented novel function of displaying a past fellow player on a terminal device of a player so that a desired partner can be easily applied for reviving a fellow relation. . Thereby, it is possible to provide the player with a game environment in which there is an opportunity to reconstruct a friendship relationship with a past friend player.

It is explanatory drawing which shows the structural example of the game system which concerns on one embodiment of this invention. It is a block diagram which shows an example of the hardware constitutions of a game management apparatus. It is a block diagram which shows an example of the hardware constitutions of a terminal device. It is a functional block diagram which shows an example of a functional structure of a game management apparatus. It is a functional block diagram which shows an example of a functional structure of a game information management means. It is a functional block diagram which shows an example of a functional structure of an alternating current means. It is explanatory drawing which shows an example of the game information which a game information management means preserve | saves and manages in a database server. It is explanatory drawing which shows an example of the fellow information which a fellow information storage means memorize | stores. It is explanatory drawing which shows an example of the information regarding the friend of each player which a friend information storage part memorize | stores. It is explanatory drawing which shows the other example of the information regarding the friend of each player which a friend information storage part memorize | stores. It is explanatory drawing which shows an example of the present and past fellow information which a fellow information storage means memorize | stores. It is explanatory drawing which shows an example of the past fellow information which a fellow information storage means memorize | stores. It is explanatory drawing which shows an example of the received message information which a message memory | storage part memorize | stores. It is explanatory drawing which shows an example of a main screen. It is explanatory drawing which shows an example of a buddy list screen. It is explanatory drawing which shows an example of a message input screen. It is explanatory drawing which shows an example of the game screen in battle | competition mode. It is explanatory drawing which shows an example of a helper selection screen. It is explanatory drawing which shows the other example of the game screen in battle | competition mode. It is explanatory drawing which shows an example of the past buddy list screen. It is a flowchart which shows an example of operation | movement of a game system. It is explanatory drawing which shows an example of the memory | storage information for managing a fellow revival application. It is a flowchart which shows an example of operation | movement of a game system. It is a flowchart which shows an example of a game progress process. It is a flowchart which shows an example of the process of the game server at the time of friend cancellation | release. It is a flowchart which shows an example of the friend relationship revival process in a game system. It is a flowchart which shows an example of a fellow history transmission process. It is a functional block diagram which shows the other example of a functional structure of a game management apparatus. It is a flowchart which shows an example of a friend formation point provision process. It is a flowchart which shows an example of a resurrection restriction | limiting process. It is a flowchart which shows the other example of a resurrection restriction | limiting process. It is a flowchart which shows the other example of a friend log | history transmission process. It is a flowchart which shows the other example of a resurrection restriction | limiting process. It is a flowchart which shows the other example of a resurrection restriction | limiting process. It is a functional block diagram which shows the other example of a functional structure of a game management apparatus. It is explanatory drawing which shows an example of the table showing the relationship between the level difference between players, and a friend period. It is explanatory drawing which shows an example of the fellow period which a fellow period memory | storage means memorize | stores. It is explanatory drawing which shows the other example of a buddy list screen. It is a flowchart which shows an example of the process of the game server for two players with whom the friendship relationship was materialized. It is a flowchart which shows an example of a friend period determination process. It is a flowchart which shows the other example of a friend period determination process. It is a functional block diagram which shows the other example of a functional structure of a game management apparatus. It is explanatory drawing which shows an example of the level difference which a level difference memory | storage means memorize | stores. It is explanatory drawing which shows the other example of the level difference which a level difference memory | storage means memorize | stores. It is a flowchart which shows an example of the reset process of a fellow period. It is explanatory drawing which shows the other example of the information of the fellow period which a fellow period memory | storage means memorize | stores. It is explanatory drawing which shows an example of the information of the alternating current history which an alternating current history memory | storage means memorize | stores. It is a flowchart which shows an example of the extension process of a friend period. It is a flowchart which shows the other example of the extension process of a friend period. It is explanatory drawing which shows an example of the familiarity information which a familiarity memory | storage means memorize | stores. It is a flowchart which shows an example of the correction process of the friend period at the time of extension.

  Hereinafter, a game management device, a game system, a game management method, and a program according to an embodiment of the present invention will be described with reference to the drawings.

[Outline of the game system]
FIG. 1 shows a configuration example of a game system in which a game management device according to an embodiment of the present invention is incorporated. As shown in the figure, this game system includes a game server 1 installed on a network 4 such as the Internet, a database server 2 connected to be communicable with the game server 1, and a game server via the network 4. 1 and the terminal device 3 of each player that can be communicably connected.

  The network 4 of the present embodiment is not limited to the Internet. For example, a dedicated line, a public network, or the like can be used as long as the game server 1 and the terminal device 3 of each player can be connected to each other. It may be a line (telephone line, mobile communication line, etc.), wired LAN (Local Area Network), wireless LAN, or the like, or a combination of the Internet and these.

  In this example of the game system, a game management device according to an embodiment of the present invention includes a game server 1 and a database server 2. The game server 1 receives access from the terminal device 3 of each player who receives the game service via the network 4 and stores and manages game information of each player in the database server 2 (storage device). A game service is provided via the network 4.

  In the present embodiment, an example of providing a so-called browser game in which a game can be played by a web browser installed in the terminal device 3 of each player will be described as one form of game service provided by the game server 1. In the service form for providing the browser game, it is not necessary to download or install software dedicated to the game to the terminal device 3 of the player, and the player can easily play the game server anywhere as long as the terminal device 3 can be connected to the network 4. The game service provided from 1 can be enjoyed.

  In this game system, a program (application software) for a browser game is installed in the game server 1, and the game server 1 performs arithmetic processing and data for progressing the game in accordance with an input operation on the terminal device 3 of each player. Execute the process. Then, the game server 1 updates the game information of each player in the database server 2 based on the execution result of the arithmetic processing and the like, and web page information for displaying the execution result on the screen of the terminal device 3 of the player. (Game screen data) is transmitted to the terminal device 3 of each player.

  The terminal device 3 of each player is equipped with a web browser having a website browsing function as a player agent so that the web page information transmitted from the game server 1 can be displayed on the screen of the terminal device 3. It has become. Examples of the terminal device 3 include a mobile phone terminal, a PHS (Personal Handy-phone System) terminal, a personal digital assistant (PDA), and a smartphone that is a mobile terminal in which a mobile phone and a mobile information terminal are integrated. Various terminals that can be connected to the game server 1 via the network 4 and receive a game service, such as a personal computer or a tablet computer, can be applied.

  In addition, the game provided in the present embodiment has a so-called social game element that allows a player to play while communicating with other players receiving game services. For example, by incorporating the game server 1 and the database server 2 of the present embodiment into a social networking service (SNS) system, a game system that provides a social game service as one of the SNS services can be obtained. As described above, the game service can be provided to the player by the game system operating on the SNS platform, but the game server 1 and the database server 2 can be constructed as independent game systems without being incorporated in the SNS system. Good.

  In this game system, each player can establish a special relationship of “friends” with one or more other players who are receiving game services. As one form for a certain player to establish a friendship relationship with another player, either one of the two players makes a friend application to the other player via the game server 1, and the friend application is made. A friend application made between the two players and an operation of the approval for approving that the received player becomes a friend through the game server 1 can be mentioned. When the friendship relationship is established between the two players, the game server 1 registers the friend information associated with the identification information (player ID) of the two players in the database server 2. And the game server 1 memorize | stores in the database server 2 the information of the fellow player who has the fellow relation which belongs to the fellow group centering on each player, and performs friend management for every player. Details of this friend application, its approval, and friend management by the game server 1 will be described later.

  Moreover, each player can cancel | release the friend relationship with a fellow player as needed. And the game server 1 of this Embodiment hold | maintains the past fellow information which linked | related the said two players in the database server 2, even after the fellow relation of two persons is cancelled | released. . In addition, the game server 1 transmits, to the terminal device 3, information for displaying a past fellow player who has had a fellowship with the player in the past in response to a request from the terminal device 3 operated by the player. It is like that. Therefore, the player can easily check his / her past friend history on the display screen of the terminal device 3 by operating his / her terminal device 3 at any time.

  Furthermore, the player confirms past fellow players displayed on the terminal device 3 and performs an operation of selecting a desired partner to revive the fellow relation, thereby making it easy to apply for the fellow relation restoration to the partner. To be able to do that. As a result, the player is given an opportunity to reestablish a friendship relationship with a past fellow player. If the opponent who received the application for reviving the friendship from the player approves it, the friendship between the two will be restored.

  The details of the configuration of the game management device (game server 1 or the like) according to the present embodiment, which can give the player the opportunity to reestablish the fellowship with the past fellow player as described above. explain.

[Configuration of game management device]
As described above, in the present embodiment, the game management device includes the game server 1 and the database server 2. FIG. 2 shows an example of the hardware configuration of the game server 1. As shown in the figure, the game server 1 mainly includes a CPU (Central Processing Unit) 11, a ROM (Read Only Memory) 12 and a RAM (Random Access Memory) 13 as a main storage device, and an auxiliary storage device 14. The communication control unit 15 and the input / output control unit 16 are connected to each other via a bus line 17 including an address bus, a data bus, a control bus, and the like. Note that an interface circuit is interposed between the bus line 17 and each component as necessary, but the illustration of the interface circuit is omitted here.

  The CPU 11 interprets and executes instructions of application software such as system software and game programs, and controls the game server 1 as a whole. The ROM 12 stores a program and the like necessary for basic operation control of the game management device 1. The RAM 13 stores various programs and data, and secures a work area for the CPU 11.

  The auxiliary storage device 14 is a storage device that stores application software such as a game program, various data, and the like. For example, a hard disk drive can be used as the auxiliary storage device 14. The program according to the present embodiment for causing the game server 1 (computer) to operate as a game management device is also stored in the auxiliary storage device 14, and the program is transferred from the auxiliary storage device 14 to the bus line when the game server 1 is started. 17 is loaded into the RAM 13 via the CPU 17 and executed by the CPU 11.

  The communication control unit 15 includes a communication interface 15 a connected to the network 4, and controls communication with each player's terminal device 3 via the network 4. The communication control unit 15 also controls communication with a server (not shown) connected to the network 4. For example, when it is set as the system configuration which incorporated the game server 1 in SNS, the communication control part 15 of the game server 1 controls communication between SNS servers.

  The input / output control unit 16 is connected to the database server 2 in a communicable manner, and is a database interface that performs input / output control when the CPU 11 executes reading / writing of data (records) with respect to the database server 2.

  The database server 2 includes a large-capacity hard disk device having a RAID (Redundant Arrays of Inexpensive Disks) configuration, for example, as a storage device having an area for storing game information of each player managed by the game server 1. The database server 2 stores, for example, various game information (player name, level, in-game points, possessed items, etc.) of each player in association with identification information (player ID) that uniquely identifies each player. It can be constructed as a database, an object database, an object relational database, or the like.

  In the present embodiment, an example in which the game management device is configured by the game server 1 and the database server 2 is shown, but the present invention is not limited to this. For example, the game server 1 can have the function of the database server 2 and the game management device can be configured only by the game server 1. Further, the game server 1 can be configured as a plurality of servers by distributing the functions of the game server 1 to a plurality of servers. For example, when a player operates the terminal device 3 to access the game server 1, an authentication server having an authentication function for determining whether the player is a regular player is provided separately from the main server of the game server 1, The game server 1 may be composed of a main server and an authentication server. As another configuration example, a billing management server that performs billing management when a player purchases an item to be billed in a game is provided separately from the main server of the game server 1, and the main server, authentication server, and billing management The game server 1 may be configured by a server.

  In addition, when the number of players using this game service reaches several hundred thousand, millions, or more, it is required to construct a server system that can withstand huge accesses from the terminal device 3 of many players. Therefore, by providing a plurality of game servers 1 on the network 4 for redundancy (multiplexing), a load distribution type system configuration may be adopted. In this case, it is desirable to provide a load balancer for adjusting the load among the plurality of game servers 1.

  Next, the configuration of the terminal device 3 of the player who accesses the game server 1 according to the present embodiment and receives a game service will be described.

[Configuration of terminal device]
As the terminal device 3 operated by the player, various terminals having a website browsing function such as a mobile phone terminal and a smartphone can be applied as described above. In the present embodiment, a mobile phone terminal is exemplified. The configuration will be described. Note that the terminal device 3 other than the mobile phone terminal is also basically required for playing a game such as displaying a game screen using a website browsing function or performing an input operation for executing the game. The configuration is the same as that of the mobile phone terminal.

  A mobile phone terminal having a website browsing function or the like is also referred to as a feature phone or a smartphone, and its configuration example is shown in FIG. As shown in the figure, the terminal device 3 mainly includes a CPU 31, a ROM 32 and a RAM 33 as main storage devices, an image processing unit 34, a display unit 35, a sound processing unit 36, and an audio input unit 37. , An audio output unit 38, an auxiliary storage device 39, an operation input unit 40, and a communication control unit 41. The components 31 to 34, 36 and 39 to 41 are connected to each other via a bus line 42. Has been. An interface circuit is interposed between the bus line 42 and each component as necessary, but the interface circuit is not shown here.

  The CPU 31 interprets and executes instructions of various programs including the web browser, and controls the entire terminal device 3. The ROM 32 stores a program and the like necessary for basic operation control of the terminal device 3. The RAM 33 stores various programs and data loaded from the ROM 32 or the auxiliary storage device 39, and secures a work area for the CPU 31. A web browser that displays game screen data described in HTML or the like is stored in the ROM 32 or the auxiliary storage device 39, loaded into the RAM 33, and executed by the CPU 31. Various plug-in software for extending the browser function of the web browser may be stored in the ROM 32 or the auxiliary storage device 39 together with the web browser.

  The image processing unit 34 drives the display unit 35 based on an image display command from the CPU 31 and displays an image on the screen of the display unit 35. Various known display devices such as a liquid crystal display organic LE (Electro-Luminescence) display can be applied to the display unit 35.

  The sound processing unit 36 converts an analog audio signal into a digital audio signal when audio is input from the audio input unit 37, generates an analog audio signal based on a sound generation instruction from the CPU 31, and outputs it to the audio output unit 38. Output. The voice input unit 37 includes a microphone built in the terminal device 3 and is used for telephone communication or recording. The voice output unit 38 is composed of a speaker that outputs a reception speaker at the time of telephone communication and a telephone ringtone or a sound effect at the time of game execution.

  The auxiliary storage device 39 is a storage device that stores various programs and data. As the auxiliary storage device 39, for example, a flash memory drive or the like can be used as the internal memory of the mobile phone terminal, and a memory card reader / writer or the like can be used as the external memory of the mobile phone terminal.

  The operation input unit 40 receives an operation input from the player and outputs an input signal corresponding to the operation input to the CPU 31 via the bus line 42. Examples of the operation input unit 40 include physical buttons such as a direction instruction button, a determination button, and an alphanumeric character input button provided on the main body of the terminal device 3. Further, in the case of the terminal device 3 in which the display unit 35 is configured as a so-called touch screen by mounting a touch panel (contact input type interface) on the screen of the display unit 35, the touch panel also becomes the operation input unit 40.

  The communication control unit 41 includes a communication interface 41a, and has a communication control function for performing data communication during game operation and the like, a communication control function for transmitting and receiving voice data as a mobile phone terminal, and the like. Here, for the communication control function for data communication, for example, a wireless LAN connection function, an Internet connection function via a wireless LAN or a cellular phone network, a predetermined frequency band (for example, a 2.4 GHz frequency band) is used. Includes short-range wireless communication functions. The communication control unit 41 transmits a connection signal for connecting the game apparatus 1 to a wireless LAN, the Internet, or the like based on a command from the CPU 31 and receives information transmitted from the communication partner side and supplies it to the CPU 31. To do.

  In addition, the terminal device 3 may include a GPS (Global Positioning System) signal receiving circuit, an imaging device (camera) such as a CCD (Charge Coupled Device) image sensor, a triaxial acceleration sensor, and the like. For example, GPS position information may be used in the game.

  In the terminal device 3 configured as described above, a player who wants to receive a game service performs an operation of starting a web browser and accessing a game site managed by the game server 1. When this access is authenticated by the game server 1, the communication control unit 41 of the terminal device 3 receives game screen data described in HTML or the like transmitted from the game server 1, and the CPU 31 executes the web browser. A game screen is displayed on the display unit 35. Here, the player selects and inputs selectable button objects and hyperlinks displayed on the game screen by operating the operation input unit 40. In response to this selection input, the game server 1 advances the game and transmits new game screen data to the terminal device 3. Then, this new game screen is displayed on the display unit 35 of the terminal device 3, and hereinafter, similarly, the player can select a button object or the like that can be selected on the game screen displayed on the display unit 35 by an operation. A game provided by the game server 1 can be played.

[Functional configuration of game management device]
Next, main functions of the game management device (game server 1 and database server 2) configured as described above will be described. FIG. 4 is a main functional block diagram of the game management device.

  The game management apparatus mainly includes game information management means 51, game progress means 52, authentication means 53, friend management means 54, exchange means 55, friend history transmission means 101, and friend recovery application means 102. Each of these means is realized by the CPU 11 of the game server 1 executing the program according to the present embodiment.

  The game information management means 51 accumulates and manages game information of each player in the database server 2. The item of game information managed by the game information management means 51 differs depending on the content of the game service that the game server 1 provides to the player.

  Examples of games provided by the game server 1 include sports games based on various sports such as baseball, soccer, and golf, battle games based on battles, music simulation games, and other various role-playing games and training. Various games such as games and simulation games can be listed regardless of the game format and genre. As an example, in the present embodiment, the case where the game server 1 provides a baseball game as a game service will be described below.

  In the present embodiment, a baseball game in which a player owns a player character in the game and can play a game (match) with another player in the game using the player character is taken as an example. The player character possessed by the player can be in a card format in which the form of the player character is visible on the screen of the terminal device 3. That is, the player character is managed as a digital player card by the game server 1 and displayed on the screen of the terminal device 3 of the player. FIG. 13 illustrates a player card 71 displayed on the screen of the terminal device 3 of the player. The player character form and the card rarity (the scarcity value is indicated by the number of ☆). Is displayed on the screen as a digital player card. Players can collect player cards while advancing the game, form their own original team, and compete against other players for ranking. In addition, the player can improve the ability of the player card (player character) by synthesizing the collected player cards (that is, nurture the player), and enjoy the game with the aim of creating a stronger team. It can be done.

  In such a baseball game, the game information management means 51 for managing the game information of each player, as shown in FIG. 5, is a player information storage means 51a, a level information storage means 51b (game level storage means), an owned player card. A storage unit 51c, an owned point storage unit 51d, an owned coin storage unit 51e, an owned item storage unit 51f, a game result storage unit 51g, a ranking storage unit 51h, and the like are provided. FIG. 7 shows an example of the game information of each player (in this example, one player ID = “000001”) that is stored and managed in the database server 2 by the storage means 51a to 51h of the game information management means 51. Game information).

  The player information storage unit 51a associates a player ID uniquely identifying each player with player information relating to each player such as a login ID, password, player name (nickname used in the game, etc.), team name, and the like. Each ID is stored in a predetermined storage area of the database server 2. Here, the login ID and the password are used for login authentication when each player accesses the game server 1 by operating the terminal device 3. The player name and the team name are arbitrary information set by the player when the player registers as a member for receiving the game service or when the game is executed for the first time. The player name and team name are displayed on the game screen as necessary.

  The level information storage unit 51b stores the level information such as the player level as the game level and the affiliation league level in a predetermined storage area of the database server 2 for each player ID in association with the player ID. In the baseball game, for example, experience values are accumulated as the player advances the game, and the level of the player is increased when the experience value reaches a certain amount. In this baseball game, for example, there are a plurality of different levels of leagues, and each player's team belongs to one of the leagues, and a game (league battle) is automatically played with another player's team in the league. To do. Further, according to the result of this league game, a replacement game between teams of players belonging to different leagues is automatically executed, and the league level to which the team of players belongs is changed. The level information storage means 51b stores the player level and the league level in association with the player ID.

  The owned player card storage means 51c stores information on player cards acquired and owned by the player in the game in a predetermined storage area of the database server 2 for each player ID in association with the player ID. Examples of the player card information include identification information (player card ID) for uniquely identifying the player card, an ability value indicating the height of the ability of the player, and a regular player flag.

  In FIG. 7, the example which can set a player's ability value with respect to three ability items (abilities 1-3) is shown. As an example of the ability item, when the player card is a fielder, the abilities 1 to 3 can be “blow”, “running power”, “defense”, etc., and when the player card is a pitcher, ability 1 ˜3 can be set as “sphere force”, “ball control”, “change”, and the like. The capability item is not limited to this example, and can be increased or decreased. The regular player flag is a regular player (player included in the team order) who participates in a match with another player's team among the player cards owned by the player, or a non-regular player other than the regular player This flag is “1”, indicating that it is registered as a player card for a regular player. By operating the terminal device 3, the player can select a regular player from an owned player card or set a team order.

  Further, the database server 2 stores the player card image data, the player name, the position, the affiliation team, the ability value (initial value not strengthened by the synthesis) and the like in association with the player card ID. There is a database, and the game information management means 51 can acquire the image data of the player card corresponding to the player card ID based on the player card ID stored in the owned player card storage means 51c. Yes.

  The owned point storage means 51d stores various points (including values corresponding to points) owned by the player in the game in a predetermined storage area of the database server 2 for each player ID in association with the player ID. To do. In this game, there are various game modes, and various points can be acquired and the acquired points can be used according to the game mode.

  As shown in FIG. 7, examples of points include behavioral power points, operating costs, reinforcement points, and exchange points in addition to the above experience values. The action power point is used in a “scout mode” in which the player card is searched and the player is scouted while consuming the action power point. The management cost is used in a “match mode” in which another player is designated to play an individual match, and the individual match is performed at a cost (point) necessary for managing the match. It is consumed by. For example, behavioral power points and operating costs consumed and reduced during the game are recovered over time (for example, 1 point is recovered every 3 minutes), or the experience value is set to a certain amount. And the player's level can be increased to recover.

  The strengthening points are used in the “strengthening mode” in which the ability of the player cards is improved by combining the player cards owned by the players, and is consumed by performing the combining. This strengthening point can be acquired, for example, by executing a scout mode or a match mode.

  In addition, the exchange point is a point that can be obtained when a player exchanges greetings with other players (particularly fellow players). Details of specific examples of AC will be described later. This exchange point can be used in, for example, “lottery mode” in which a predetermined number (for example, one) of player cards can be obtained by lottery based on random numbers or the like from all player cards managed by the game server 1. A player card lottery can be received once for a predetermined exchange point.

  The owned coin storage means 51e associates coins owned by the player in the game (in-game currency different from the points) in a predetermined storage area of the database server 2 for each player ID in association with the player ID. Remember. This coin is necessary, for example, when acquiring an item to be charged.

  The owned item storage unit 51f stores items acquired by the player in the game in a predetermined storage area of the database server 2 for each player ID in association with the player ID. As shown in FIG. 7, examples of items include recovery items, puzzle card pieces, fake cards, and the like. The recovery item is an item that recovers the above-described action power points and / or operation costs consumed and reduced during the game to the maximum value in an instant without waiting for the passage of time. For example, the recovery item can be acquired by consuming and purchasing the coin or satisfying a predetermined bonus condition in the game.

  The pieces of the puzzle card are items that can obtain a powerful (high ability value) player card by collecting a predetermined number of pieces (for example, six pieces P1 to P6) and completing the puzzle card. . For example, a piece of a puzzle card can be obtained when winning in a lottery based on a random number or the like during the execution of the scout mode, and when winning by fighting against a piece owned by another player in the game mode In addition, it can be taken from the opponent player.

  A fake card is an item that can be set to a piece of the puzzle card so that even if it is defeated by another player in a match in the match mode, the targeted piece cannot be taken once. For example, a fake card can be obtained by consuming and purchasing the coin or satisfying a predetermined bonus condition in the game.

  The game result storage means 51g associates a player ID with a game ID for uniquely identifying a game in which a player's team has played against another player's team, and a predetermined storage area of the database server 2 for each player ID. To remember. Here, the game uniquely specified by the game ID includes a game of an individual game performed by the player specifying an opponent and a game of a league game automatically performed by the game server 1.

  In addition, the database server 2 is associated with the game ID, the game date and time (the time when the real world game starts or ends), the player ID of the winning team, the player ID of the defeated team, the battle score, the winning pitcher character, A game database is stored in which information about game results such as a loser pitcher character, a player character who has made a home run, and game critical information is stored. And the game information management means 51 can acquire the information regarding the game result corresponding to the said game ID from a game database based on the game ID which the game result storage means 51g has memorize | stored.

  The ranking storage means 51h associates the player ID with ranking information such as the number of wins and losses of the team of the player in the league game or the exchange game, and the ranking within the league to which the player belongs based on the number of wins and losses. Each ID is stored in a predetermined storage area of the database server 2. For example, a league game is automatically performed at a predetermined time on each day from Monday to Friday in the real world (for example, 12 games per day), and a replacement game is performed at a predetermined time on Saturday and Sunday in the real world. It is assumed that a predetermined number of games (for example, 12 games each day) are automatically played. In this case, as shown in FIG. 7, the ranking storage unit 51h stores the ranking information for each day from Monday to Sunday in the real world, and updates the ranking information to the latest information every week.

  Next, the game progress means 52 shown in FIG. 4 will be described. The game progress means 52 executes a game in response to an operation on the terminal device 3 by the player, generates game screen data corresponding to the execution result, and transmits the game screen data to the terminal device 3. It has a function to advance the game by displaying a game screen according to the game. As shown in FIG. 4, the game progress means 52 includes a game execution means 52a, a game screen generation means 52b, and a game screen transmission means 52c.

  When the game screen is displayed by the web browser of the terminal device 3 of the player, when the player performs an operation of selecting a selectable button object, a character string set with a hyperlink, or the like on the game screen, the operation A game screen request corresponding to the request is transmitted to the game server 1 by the web browser of the terminal device 3. In the game server 1 that has received this request, the game execution means 52a reads the game information of the player in response to the request and executes the game by performing calculations and data processing.

  For example, taking as an example a case where the player has performed an operation of playing against a team of another player in the battle mode, the game execution means 52a has the player cards of both teams corresponding to the player IDs of both players in the battle. Information (player card information of regular players participating in the game) is read from the database server 2. And the game execution means 52a performs the calculation which determines a win / loss based on the ability value etc. of the player card of both teams. As an example of the calculation of this win / loss decision, the player with the highest total ability value of both teams may be the winning team, or the team with the higher total ability value will have a higher probability of winning. The winning team may be obtained by probability calculation. Moreover, the game execution means 52a performs the calculation which determines whether various effect productions which affect a win / loss are generated based on the combination of the player card which comprises a team before the calculation which determines a win / loss. May be.

  The game screen generation unit 52b generates game screen data composed of, for example, HTML data in accordance with the execution result by the game execution unit 52a. The HTML data may include image data such as a player card read from the database server 2. Moreover, the script (program) which operate | moves by the plug-in of the web browser of the terminal device 3 may be embedded in HTML data. When the script provided from the game server 1 is executed by the terminal device 3, the game screen displayed on the terminal device 3 can be a moving image.

  The game screen transmission unit 52c transmits the game screen data (HTML data or the like) generated by the game screen generation unit 52b to the terminal device 3 of the player as a response to the game screen request. In the terminal device 3 of the player that has received the game screen data, the game screen is displayed on the display unit 35 by the web browser.

  Next, the authentication unit 53 will be described. When a player who wants to receive a game service operates the terminal device 3 to access (log in) the game server 1, the authentication means 53 determines whether or not the player has a game participation qualification and performs login authentication. . As an example of this authentication, there is authentication based on a login ID and a password associated with a player ID. For example, when a player uses the game service for the first time, a login ID (any alphanumeric character, mail address, etc.) and a password are registered in the game server 1 as member information. Then, at the next login to the game server 1, the player operates the terminal device 3 to transmit the login ID and password to the game server 1. At this time, the authentication means 53 of the game server 1 determines whether or not the combination of the login ID and password received from the terminal device 3 of the player has been registered, and performs login authentication.

  When the game system is incorporated into the SNS system, the SNS member registration information (login ID and password) may be used as the registration information for receiving the game service of the game system. For example, when the player's terminal device 3 is logged in to the SNS server, when the game site managed by the game server 1 is first accessed, the player's login ID and password are automatically input from the SNS server to the game server 1. The game service may be registered for use without registering the login ID and password again.

  In addition, an individual identification number of a mobile phone or a smartphone that is the terminal device 3 (a terminal different from the telephone number is uniquely assigned so that the trouble of inputting the login ID and password each time the player accesses the game server 1 can be omitted. Identification information) or contractor's unique ID (information that uniquely identifies the contractor of the terminal and does not change as long as the contractor is the same even if the model is changed) Authentication may be performed. That is, when the player operates the terminal device 3 to register as a member, the game server 1 acquires the individual identification number or the contractor unique ID included in the data transmitted from the terminal device 3, and the login ID and password At the same time, the individual identification number or the contractor unique ID is also stored in the database server 2 in association with the player ID. When receiving the access request from the terminal device 3, the authentication unit 53 determines whether the individual identification number or the contractor unique ID has been registered, and performs login authentication. Thereby, when accessing the game server 1, the player can log in without inputting the login ID and password.

  In addition, as another method that can omit the trouble of inputting the login ID and the password each time the player accesses the game server 1, there is a method of using HTTP cookie information (hereinafter referred to as cookie). That is, when the player operates the terminal device 3 to register as a member, the game server 1 issues individual identification information corresponding to the login ID and password and registers it in the database server 2, and the individual identification information is used as a cookie. It transmits to the terminal device 3. At this time, the browser of the terminal device 3 stores the received cookie in the terminal device 3. When accessing the game server 1 from the next time, the browser of the terminal device 3 transmits a Cookie to the game server 1 together with the page browsing request, so that the authentication unit 53 receives the access request from the terminal device 3. Can perform login authentication by determining whether or not the individual identification number of the cookie has been registered.

  Next, the fellow management means 54 will be described. The fellow management means 54 is provided with fellow information storage means 54a for storing fellow information related to two players in which fellow relations are established in the database server 2 (storage device). FIG. 8 shows an example of friend information stored in the database server 2 by the friend information storage means 54a.

  As shown in FIG. 8, when the fellowship relationship is established between two players, the fellow information storage means 54a obtains the player ID of the player who applied for fellowship and the player ID of the player who approved the fellowship application. The related friend information is stored in the database server 2. And the fellow management means 54 adds fellow information ID for identifying these uniquely to each fellow information, and performs fellow management based on fellow information ID.

  In the example of FIG. 8, the fellow information relating the two players, the player A with the player ID = “000001” who applied for the fellow and the player B with the player ID = “000002” who approved it, is the fellow information ID. = Registered in the database server 2 as friend information of “1”. Thus, for player A, player B is a fellow player who has a fellow relationship, and for player B, player A is a fellow player.

  In addition, each player can create a plurality of friends, and a friend group centered on each player can be formed. In the example of FIG. 8, the player A with the player ID = “000001” has established a fellowship relationship with the players with the player IDs = “000005” and “000003”. And the fellow management means 54 memorize | stores in the database server 2 the information of the fellow player in the fellow relation which belongs to the fellow group centering on each player, and performs the fellow management for every player.

  FIG. 9A shows an example of information related to the friends of each player, which is managed by the friend management means 54 based on the friend information stored in the database server 2. The associate information storage means 54a of the associate management means 54 is associated with the player ID, information on the upper limit of the number of associates, the player ID of the associate player who is already in the associate relationship, the player ID of the player who is applying for the associate, and Information relating to a friend such as a player ID of an unapproved player who has received a friend application is stored in a predetermined storage area of the database server 2 for each player ID. In the example of FIG. 9A, information on a friend for one player with player ID = “000001” is shown, the upper limit of the number of friends is 45, the number of fellow players of the player is 10, and friends are being applied for. One player has received a friend application, but there are no unapproved players.

  In the baseball game of the present embodiment, by creating a friend, a bonus point is given to both players who are in a fellow relationship by the fellow establishment point granting means 103 described later (for example, the action point and the operating cost The maximum value can be increased by a certain point). Moreover, it is the game specification which can advance a game advantageously by playing a game in cooperation with a fellow player, or performing a present or cheering of a player card between friends. Thus, by giving the player the advantage of creating a friend in the game, the creation of the friend is promoted.

  However, an upper limit can be set for the number of friends that each player can establish a friendship with other players. As the upper limit of the number of friends, one upper limit (for example, 50 people) common to each player can be provided. Alternatively, the upper limit of the number of friends may vary within a predetermined range (for example, a range of 10 to 99 people) according to the degree of progress of each player's game. In the present embodiment, the upper limit of the number of friends varies in the range of 10 to 99, and the upper limit of the number of friends increases as the level of the player increases. Thereby, in order to make more friends and make the game advantageous, the player is given a motivation to continuously advance the game and improve the level. The fellow information storage means 54a stores the upper limit of the number of friends of each player in association with the player ID, and the fellow management means 54 manages the upper limit of the number of friends of each player.

  In the present embodiment, in order for two players to become friends, either one of both players makes a friend application to the other player via the game server 1. As an operation example of this friend application, first, a player who wants to make a friend performs an operation of listing target candidates of friend candidates on the screen of the terminal device 3. At this time, the player can specify the player level of the fellow candidate. In response to the operation by the player, the game server 1 transmits screen data listing the candidates for the fellow candidates, so that a screen on which a plurality of fellow candidates are listed is displayed on the terminal device 3 of the player. Here, the player confirms the player level, the league level, and the like of the target person listed on the screen, selects a player who wants to be a friend, and performs a friend application operation.

  For example, consider a case where a player A with a player ID = “000001” performs a friend application operation on a player B with a player ID = “000002”. As shown in FIG. 9A, in response to this operation, the fellow information storage means 54a of the game server 1 corresponds to the player ID = “000001” of the player A as the game information of the player A who has made the fellow application. In addition, the player ID = “000002” of the player B who is the applicant is stored as the “player ID being applied”.

  Further, as shown in FIG. 10 (a), the fellow information storage unit 54a makes a fellow application in association with the player ID of the player B = “000002” as the game information of the player B who is the applicant. The player ID of player A = “000001” is stored as “unapproved player ID”. Then, the game server 1 notifies the player A that a friend application has been made when the terminal device 3 of the player B logs in to the game server 1.

  Then, the player B who has received the friend application confirms the information such as the player level and the league level of the player A received from the game server 1 on the screen of the terminal device 3 and decides whether to approve or reject as a friend. Perform the operation to select. Here, when the player B performs an operation of approving as a friend, the friend management means 54 of the game server 1 establishes a friendship relationship between the player A and the player B in response to this operation, as shown in FIG. The friend information relating the player IDs of both players A and B is registered in the database server 2. Then, as shown in FIG. 9B, the fellow information storage unit 54a associates the player ID of the player A with “player ID =“ 000001 ”as the game information of the player A, and the player ID of the player B =“ 000002 ”. Is stored as “friend player ID”, and the player ID of player B is deleted from “player ID being applied”.

  Further, as shown in FIG. 10B, the fellow information storage unit 54a associates the player ID of the player B = “000002” with the player ID = “000001” of the player A as the “companion player ID”. The player ID of the player A is deleted from the “unapproved player ID”. Then, when the terminal device 3 of the player A logs in to the game server 1, the game server 1 notifies the player B that the friend has been approved.

  Further, the fellow information storage means 54a holds (stores) past fellow information related to the two players even after the relation between the two friends is canceled. Hereinafter, a mode in which the fellow information storage unit 54a holds past fellow information will be described.

  FIG. 11A shows an excerpt of a part of the current and past friend information stored in the predetermined storage area of the database server 2 by the friend information storage means 54a. In FIG. 11A, among all the players, a pair of players who are currently in a friend relationship and a pair of players who have been in a friend relationship in the past are listed together. As illustrated in FIG. 11A, the fellow information storage unit 54 a sets a fellow cancellation flag on two fellow information whose fellow relations are cancelled, and holds them as past fellow information. In the example of FIG. 11A, the friend information in which “1” is set as the friend release flag is past friend information, and the friend information in which the friend release flag is “0” is currently established friend information.

  Here, focusing on the player A with the player ID = “000001”, the description of FIG. 11A is continued. The friend information of the player A is friend information in which “000001” is included in either the player ID for which the friend application is applied or the approved player ID, and the friend information ID = “1”, “2”, “3”. The friend information “”, “22”, “23”, “81” corresponds to this. Among these, the friend information of the friend information ID = “3” and “81” is the current friend information because the friend release flag is “0”. Therefore, each player with player ID = “000035” and “000110” is the current friend player of player A. On the other hand, the fellow information with the fellow information ID = “1”, “2”, “22”, “23” is past fellow information because the fellow release flag is “1”. Therefore, each player with player ID = “000002”, “000005”, “0000010”, and “0000012” is a past fellow player of player A.

  In this manner, by adding the friend cancellation flag to the friend information, the current friend information and the past friend information can be distinguished, and the past friend information can be retained. This mode is a preferable mode because it is possible to retain the previous buddy information by using the current buddy information as it is just by setting the buddy release flag of only 1 bit.

  As another form of holding past fellow information, there is a form in which past fellow information is newly registered in the database server 2 separately from the current fellow information. For example, as shown in FIG. 11B, when the fellowship relationship between the two players is canceled, the fellowship information storage unit 54a displays past fellowship information that associates the player IDs of the two players. And stored in the database server 2. In the example of FIG. 11B, the player ID that voluntarily cancels the friendship relationship and the player ID that voluntarily cancels the friendship relationship from the other party are stored in association with each other. Then, the fellow management means 54 adds identification information (past fellow information ID) for uniquely identifying past fellow information, and performs management based on the past fellow information ID.

  Here, focusing on the player A with the player ID = “000001”, the description of FIG. 11B is continued. The past fellow information of the player A is information in which “000001” is included in either the canceled player ID or the canceled player ID, and the past fellow information ID = “100001” to “100004”. This applies to information. Therefore, each player with player ID = “000002”, “000005”, “0000010”, and “0000012” is a past fellow player of player A.

  As will be described later, the past fellow information stored in the fellow information storage means 54a is used when the fellow history transmission means 101 transmits information for displaying a past fellow player to the terminal device 3.

  Moreover, when one of the two players who are in a fellowship relationship voluntarily cancels the fellowship relationship, the fellowship information storage means 54a is a player who voluntarily releases the fellowship relationship among the two players, It is desirable to distinguish and memorize the player from the side on which the friendship is voluntarily released from the opponent. As a result, only the information on the released player or only the information on the released player can be extracted.

  As a form for distinguishing and storing the released side and the released side, the identification information for distinguishing the released side and the released side is added to past fellow information, or the released side is stored. A mode in which a region to be stored and a region to store the released side are separately provided is conceivable. Details of these modes will be described below.

  For example, as shown in FIG. 11A, 1-bit “releaser information” is added to past friend information as identification information for distinguishing the released side and the released side. When the canceler information is “1”, it is indicated that the player whose player ID is registered as “player ID who applied for friend” in FIG. 11A is a player who has automatically canceled the friendship. Further, when the canceler information is “0”, it indicates that the player with the player ID registered as the “approved player ID” in FIG. 11A is the player who has voluntarily canceled the fellowship. Note that since the information with the friend release flag “1” is past friend information, the releaser information is valid only when the friend release flag is “1” (information with the friend release flag “0” The canceler information is invalid because it is established friend information). A specific example will be described below.

  Here, associate information with associate information ID = “1” shown in FIG. 11A is taken as an example. Since the fellow information with the fellow information ID = “1” has the fellow cancellation flag set to “1”, the two fellow relations of the player ID = “000001” and “000002” have already been canceled. It is companion information. Since the canceler information is set to “1”, the player A having the player ID of “00000” described in the “player ID for applying for friend” field in FIG. A player who voluntarily releases the player. A player B having a player ID of “000002” described in the “approved player ID” column in FIG. 11A is the released player.

  Further, in the case of the fellow information with the fellow information ID = “2” shown in FIG. 11A, since the fellow cancellation flag is “1”, it is the past fellow information, and the canceller information is set to “0”. The player B having the player ID “000002” described in the “approved player ID” column in FIG. Then, the player A having the player ID “000001” described in the column “Player ID for applying for friend” in FIG. 11A is the released player.

  In the example of FIG. 11A, a mode in which at least one player ID on the released side or the released side is stored instead of the releaser information to distinguish between the two is also conceivable. However, in order to store the player ID, it is necessary to store information of a plurality of bits. On the other hand, the “releaser information” in FIG. 11A is a preferable form because the release side and the release side can be clearly distinguished by 1-bit information.

  In addition, as illustrated in FIG. 11B, in the form of storing past fellow information in the database server 2 or the like separately from the current fellow information, an area for storing the player ID of the released player, and the released player player By distinguishing and storing the area for storing the ID, both can be clearly distinguished and stored.

  Next, the AC unit 55 will be described. The alternating current means 55 receives information for performing predetermined alternating current with other players (particularly fellow players) from the terminal device 3 of the player, and from the player to the other player based on the received information. It has a function to execute all AC processing. As shown in FIG. 6, the AC unit 55 of the present embodiment includes a greeting unit 55a, a message transmission unit 55b, a message storage unit 55c, a present unit 55d, a battle cooperation unit 55e, an AC history storage unit 55f, and the like.

  The greeting means 55a has a function of receiving greeting information addressed to another player transmitted from the terminal device 3 of each player and transmitting the greeting information to the other player. The message transmission means 55b has a function of receiving a message addressed to another player transmitted from the terminal device 3 of each player and transmitting the message to the other player. The message transmission unit 55b includes a message storage unit 55c.

  FIG. 12 shows an example of information related to a received message that is stored and managed in the database server 2 by the message storage unit 55c. The message storage unit 55c associates with the player ID of the receiving player who has received the message, information about the message such as the sending player ID, the message content, and the transmission date and time for each player ID of the receiving player. The data is stored in a predetermined storage area of the database server 2. Further, a message ID for uniquely identifying each message is added to the information regarding each message. The example of FIG. 12 shows information related to a received message for one receiving player with player ID = “000002”, and the player receives “Thank you for the present!” From the player with player ID = “000001”, and the player ID. The message “Good morning! Let's do our best this week's event!” Is received from the player with “000038”, and the message “Thank you for this week!” From the player with the player ID = “000145”.

  Here, an example of an operation in which a player greets or sends a message to his / her fellow player will be described. For example, if the player operates the terminal device 3 and selects the “friend list” button in the main screen, the friend list request is transmitted from the terminal device 3 to the game server 1. The game server 1 receives this request from the terminal device 3 of the player and transmits information for displaying the buddy list of the player to the terminal device 3. Thereby, for example, a friend list screen as shown in FIG. 14 is displayed on the terminal device 3. On this buddy list screen, information of buddy players who are in a buddy relationship with the player is listed and displayed. Note that information about fellow players that cannot be displayed on the screen can be displayed as a separate screen by scrolling the screen or requesting the game server 1 for the second and subsequent pages of the peer list.

  In this friend list screen, an information display area for each friend player listed is provided. In each information display area, game information 81 of the friend player (player name, team name, player level, friend's level). The number of people, the league level, etc.), an avatar 82 which is a separate character of the player, a player card 83 of the leader owned by the player, and an object called a greeting button 84 are also displayed. Then, the player can virtually greet his fellow player in the game by selecting and operating this greeting button 84. For example, when the player A selects and operates the greeting button 84 of the fellow player B, greeting information is transmitted from the terminal device 3, and the greeting means 55 a that receives this greeting information is sent from the player A to the terminal device 3 of the fellow player B. Communicate that there was a greeting.

  Here, greeting is a general term for simple exchanges that can be performed virtually in the game as described above. Sending ale (cheering), sending guts, winking, smiling, hands This includes simple exchanges using other expressions such as waving.

  The player can only greet the fellow player, but can also send a message at the same time as the greeting, as described below.

  When the greeting button 84 is selected by the player's operation on the terminal device 3, the operation is transmitted from the terminal device 3 to the game server 1. Thereafter, from the game server 1, for example, data of a message input screen illustrated in FIG. 15 is transmitted to the terminal device 3, and the message input screen is displayed on the terminal device 3. On this message input screen, for example, a text indicating that the greeting has been given to the fellow player (player B in the example of FIG. 15) is displayed, and objects such as a message input area 85 and a send button 86 are also displayed. . Then, the player operates the terminal device 3 to input an arbitrary message in the message input area 85 and selects the transmission button 86, whereby a message addressed to the fellow player is transmitted from the terminal device 3 to the game server 1. The FIG. 15 shows an example in which the player inputs the message “Thank you for the present”. In consideration of the storage capacity in the database server 2, there may be a restriction (for example, within 30 full-width characters) on characters that can be input in the message input area 85.

  The message input screen displays a hyperlink 87 for transitioning to the page of the fellow player (player B in this example), and the details of the game information of the fellow player are described by selecting this link. Displayed pages. In addition, a hyperlink 88 for transitioning to the buddy list and a hyperlink 89 for transitioning to the main screen are also displayed on the message input screen. By selecting these links, a buddy list or main screen is displayed. You can come back.

  When a message is transmitted from the terminal device 3 by the player's operation on this message input screen, in the game server 1, the message storage unit 55 c of the message transmission means 55 b receives the message addressed to the fellow player received from the terminal device 3. The data is stored in the database server 2 in association with the player ID of the fellow player (see FIG. 12). When the friend player's terminal device 3 accesses the game server 1, the message transmission means 55 b of the game server 1 transmits to the terminal device 3 screen data for displaying a message, a transmission source player name, a transmission time, and the like. To do. Thus, a message or the like is displayed on the terminal device 3 of the player who has received this screen data, and the message received from another friend can be confirmed on the screen.

  As described above, in the game system according to the present embodiment, the friends can communicate with each other at any time using the communication tool illustrated in FIG. 14 and FIG.

  In the example of FIG. 14 and FIG. 15, the example in which the message is sent to the friend of the player has been described. However, it is also possible to greet or send a message to other players who are not in the friend relationship. For example, it is also possible to send a greeting or message to other players who are not friends listed in the friend candidate list by the same operation as that of the friends.

  The present means 55d has a function of receiving present information addressed to other players transmitted from the terminal device 3 of each player and delivering presents to the other players. Examples of presents include player cards and various items owned by the player in the game.

  The battle cooperation means 55e receives information requesting a battle cooperation from a friend player from the terminal device 3 of the player (player A), and the character of the player A (may be a group or team consisting of a plurality of characters). Has a function of causing a friend player's character (for example, a leader's player card) to be added to the player A side as a "helper" and performing a battle cooperation when playing against other characters. In this way, the player A side's fighting power is improved as a result of the fellow player's character taking part in the player A side as an assistant, so that the player A's battle is advantageous compared to the case where there is no such battle cooperation. become.

  The “other character” when the player character battles with another character is a character of another player (may be a group or team of a plurality of characters) or a character prepared by the CPU of the game server 1 ( For example, it may be any boss character that appears at the end of each stage.

  When the player operates the terminal device 3 and selects a character (or fellow player) of a fellow player who wants to be an assistant, the terminal device 3 plays a battle including information on the selected fellow player character (or fellow player). Cooperation request information is transmitted to the game server 1. Then, the battle cooperation means 55e of the game server 1 receives the battle cooperation request information transmitted from the terminal device 3 of the player, and accepts the fellow player character selected by the player as an assistant.

  FIG. 16A shows an example of the game screen in the battle mode. On this game screen, information 91 of the opponent team (enemy army) designated by the player and information 92 of the player team (own army) are displayed. As the opponent's team (enemy army) information 91, for example, the opponent's player name, avatar, player card, information on strength, and the like are displayed. Further, as the player's team (self-army) information 92, the player's player name, avatar, player card, information on strength, and the like are displayed. Further, in the assistant display area 93 of the game screen, information such as characters cooperating with the army as assistants is displayed. This game screen is generated by the game screen generation means 52b of the game server 1 and is transmitted to the player's terminal device 3 by the game screen transmission means 52c, and is displayed on the display unit 35 of the terminal device 3. .

  Further, in the assistant display area 93, a “call assistant” button 93a (or a character string with a hyperlink set) is displayed so that an arbitrary fellow character can be requested as an assistant. When the player selects the “call helper” button 93a, for example, a transition is made to a helper selection screen shown in FIG. 16B. On this assistant selection screen, a fellow player who has a fellow relationship with the player and characters (player cards) possessed by the fellow player are listed and displayed. Note that information that cannot be displayed on the screen can be displayed as a separate screen by scrolling the screen or requesting the second or subsequent page of the assistant selection screen from the game server 1.

  In the assistant selection screen, an information display area for each listed player is provided, and in each information display area, the name 94a of the fellow player, the avatar 94b of the fellow player, and the player card 94c possessed by the fellow player. The player name 94d, information of the player card (level and attack power set on the player card, etc.) 94e, etc. are displayed. FIG. 16B shows an example in which a player card set as a leader among a plurality of player cards possessed by a fellow player can be selected as a helper character. For example, a representative character such as an ace pitcher or a player card set as a fourth batter may be selectable as a fellow assistant. Then, when the player operates the terminal device 3 and selects, for example, a hyperlink display portion set in the name 94a of the fellow player, the fellow character that is desired to be an assistant can be selected.

  For example, on the assistant selection screen of FIG. 16B, when the player A operates the terminal device 3 and selects the character of the fellow player B as an assistant, the game screen illustrated in FIG. Player B's player card 95 is displayed as an assistant. In addition, in the assistant display area 93, avatars of fellow players who cooperate in the battle, information on strength improvement by the battle cooperation, and the like are also displayed. In the screen example of FIG. 16C, “attack power + 200” is displayed as the strength-up information by battle cooperation.

  If the player selects a fellow assistant, the game server 1 stores the fellow assistant information in the database server 2 (storage device) in association with the player ID of the player. Therefore, if the player performs an operation of selecting a fellow assistant, the fellow character selected last time can be set as the assistant in the next battle. In addition, when the fellow character is set as a helper, a “change helper” button 96 (or a character string set with a hyperlink, etc.) is displayed in the helper display area 93. . When the player selects this button 96, the screen shifts to the assistant selection screen shown in FIG. 16B, and the friend character to be the assistant can be selected again.

  In the battle mode screen of FIG. 16A or FIG. 16C, when the player performs an operation of selecting the “start battle” button 97, a battle command is transmitted from the terminal device 3 of the player to the game server 1. The battle process is executed. Then, when the fellow character is displayed as an assistant in the assistant display area 93, an operation for selecting the “start battle” button 97 is performed, thereby requesting the partner player to cooperate with the battle command. Information is transmitted from the terminal device 3 to the game server 1. In this case, battle cooperation is performed in which the player's character is companion to the player side as an assistant.

  Next, the AC history storage means 55f will be described. The AC history storage means 55f stores the AC history of each player in the database server 2 (storage device). In the AC means 55, when an AC process from the player to another player is executed, the AC history storage means 55f displays the AC information ID and the exchanged player ID as shown in FIG. 43, for example, as an AC history. , The player ID of the exchange partner, the exchange type, the time information when the exchange process is executed, and the like are stored. The exchange type indicates specific contents of exchange such as greetings, messages, presents, and battle cooperation. Time information such as year, month, day, hour, minute, and second is stored as time information at the time of execution of AC processing. The unit of time stored here can be arbitrarily set.

  Note that the exchanges that are the targets of the exchange process performed by the exchange means 55 are not limited to the above greetings, message transmissions, presents, and support requests for cooperative battles, but various exchanges performed between fellow players. Can be included. Other examples of exchange include joint practice. The joint practice is a kind of exchange, and is a practice that a player virtually performs with a fellow player in the game. A player who desires joint practice applies for joint practice by designating a fellow player, and the joint practice is performed when the fellow player accesses (logs in) the game within a predetermined period (for example, on the day when the application is made). Is established.

  Next, the fellow history transmission means 101 will be described. In response to a request from the terminal device 3 operated by the player, the fellow history transmission unit 101 reads the past fellow information of the player stored in the fellow information storage unit 54a and has a fellow relationship with the player in the past. In addition, it has a function of transmitting information for displaying past fellow players to the terminal device 3.

  For example, when the player operates the terminal device 3 and selects a “past buddy list” button in the main screen, a past buddy list request is transmitted from the terminal device 3 to the game server 1. The buddy history transmission means 101 receives this request from the terminal device 3 of the player, and transmits information (screen data of the past buddy list) for displaying the past buddy list of the player to the terminal device 3. For example, a past buddy list screen as shown in FIG. 17 is displayed on the terminal device 3 that has received the information transmitted by the buddy history transmission means 101. On this past buddy list screen, information of the buddy players who have had a buddy relationship with the player in the past is listed and displayed. Note that information about past fellow players that cannot be displayed on the screen can be displayed as a separate screen by scrolling the screen or by requesting the game server 1 for the second and subsequent pages of the list.

  As will be described later, the past fellow players listed in the past fellow list screen shown in FIG. 17 are fellow players that have been voluntarily released by the player having the terminal device 3 displaying the screen. It may be.

  In the past buddy list screen, an information display area for each past buddy player listed is provided, and each information display area includes current game information 201 (player name, Team name, player level, number of friends, league level, etc.), an avatar 202 that is an alternate character of the player, a player card 203 of the leader owned by the player, and an object called a resurrection application button 204 Is displayed. Then, by performing an operation in which the player selects a past fellow player who wants to revive the fellowship (in this example, the past application player's restoration application button 204 is selected), information on the operation is transmitted from the terminal device 3. It is transmitted to the game server 1. The fellow revival application means 102 that has received this operation information from the terminal device 3 of the player executes application processing for revivaling the fellow relations to the past fellow player selected by the player.

  As shown in FIG. 17, it is desirable to display the current game level (player level, league level, etc.) of each listed past player in the past member list. The configuration of the game server 1 that realizes this is as follows. That is, the game level storage means (level information storage means 51b shown in FIG. 5) stores the game level of each player in the storage device (database server 2 etc.). Then, in response to a request from the terminal device 3 operated by the player, the fellow history transmission means 101 is stored in the previous peer information of the player stored in the fellow information storage means 54a and the game level storage means. Information for displaying the current game level of the past fellow player, together with information for reading the current game level of the past fellow player of the player and displaying the past fellow player of the player, Transmit to the terminal device 3. Details of the “game level” will be described later.

  Thereby, the player can determine whether or not to establish a friendship again while confirming the current game level of the past fellow player displayed on the terminal device 3. For example, when a friendship with another player X that has not accessed the game before is canceled, but the current game level of the player X can be confirmed to be much higher than before, It can be determined that the player X may become a friend again.

  In addition, when a player makes a friend revival application, it is desirable that a message can be attached to the opponent (that is, a friend revival application with a message can be made). For example, when the player performs an operation of selecting the resurrection application button 204, the game server 1 transmits the message input screen data similar to FIG. If such a message input screen allows the player to input and send a message to the game server 1 for a friend who is applying for friend recovery, a friend recovery application with a message can be made. Note that attachment of a message is an optional matter, and even if no message is attached, an application for reinstatement of a friend is possible.

  FIG. 19 shows an example of stored information for managing a fellow revival application. The fellow revival application means 102 that executes the fellowship revival application process associates the player ID of the player who applied for the resurrection with the database server in association with the fellow information ID for managing the fellow information, as illustrated in FIG. Register to 2. In the example of the fellow information ID = “1” in FIG. 19, an example in which the player A with the player ID = “000001” has applied for the restoration is shown. Then, the fellow revival application unit 102 transmits information for displaying that the player A has applied for a revival to the terminal device 3 of the past fellow player B of the application partner. In addition, when it is a friend revival application with a message, the mate recovery application means 102 also transmits a message from the applicant in cooperation with the message transmission means 55b. Note that these transmissions are performed when the terminal device 3 of a past fellow player B first accesses the game server 1 after the player A has applied for a resurrection.

  In the terminal device 3 of the past fellow player B that has received the information transmitted by the fellow revival application means 102, for example, an approval / rejection selection screen as shown in FIG. 18 is displayed. In this screen, the current game information 211 (player name, team name, player level, number of friends, league level, etc.) of the player A who has applied for friend revival, the avatar 212 of the player, and the player An object such as an approval button 214 and a rejection button 215 is displayed along with the player card 213 of the leader who performs the game. In addition, in the case of a friend revival application with a message, a message from the applicant is also displayed. Here, when the player selects the refusal button 215, the revival of the friendship can be refused. On the other hand, when the player B approves the revival of the friendship with the player A, information on the operation is transmitted from the terminal device 3 of the player B to the game server 1 by performing an operation of selecting the approval button 214. . The friend management means 54 of the game server 1 that has received the operation information accepts the approval from the player B, and executes the friendship revival process.

  For example, as shown in FIG. 19, the fellow management means 54 that executes the fellow relation revival process sets the fellow release flag stored in association with the fellow information ID for managing the fellow information to “0” ( (See fellow information ID = “22” in FIG. 19). At this time, the database server 2 may also store information on the player ID of the player who has approved the revival and information on the revival time (such as the revival date) of the friendship.

[Game system operation]
In the above configuration, an example of the operation of the game system according to the embodiment of the present invention will be described below with reference to the flowchart of FIG. FIG. 20 shows a processing flow of the terminal device 3 and the game server 1 when the player operates the terminal device 3 to access the game server 1 and receive a game service.

  When the player receives the game service, first, the web browser is activated by operating the operation input unit 40 of the terminal device 3 (S11). Thereafter, the player performs an operation of accessing a game site managed by the game server 1, and thereby an access request is transmitted from the terminal device 3 to the game server 1 (S12). At this time, the game server 1 performs login authentication for access from the terminal device 3 (S21), and confirms that the access is from a player who is registered for use of the game service. Thereafter, the game server 1 transmits main screen data described in HTML or the like to the terminal device 3 (S22). If there is a top screen different from the main screen, the top screen may be transmitted first. In the terminal device 3 that has received the main screen data, the web browser interprets the data and displays the main screen on the display unit 35 (S13).

  As illustrated in FIG. 13, the main screen includes a player team name 70, an image of a player card 71 selected as a leader among player cards owned by the player, player game information 72 (player level, action Strength points, operating costs, reinforcement points, exchange points, number of player cards owned, number of friends, etc.) are displayed. In addition, a button group 73 for selecting each mode of scout, order, reinforcement, lottery, and game is also displayed. Furthermore, on this main screen, various objects such as various menu buttons (not shown), movement information of friends, messages from other players, etc. are displayed by scrolling the screen by operating the direction keys or touch panel of the terminal device 3. And information are displayed.

  Here, when the player performs an operation of selecting an object such as a selectable button or a hyperlink displayed on the screen, a screen request corresponding to the operation is transmitted from the terminal device 3 to the game server 1 (S14). ). Receiving this request, the game server 1 executes arithmetic processing and data processing according to the player's operation to execute the game (S23), and transmits game screen data reflecting the execution result to the terminal device 3 (S24). ). And in the terminal device 3 which received screen data, a web browser interprets the said data and displays a game screen on the display part 35 (S15).

  Thereafter, the above-described S14 and S15 are repeated in the terminal device 3 of the player, and the above-described S23 and S24 are repeated in the game server 1, whereby the selectable buttons displayed on the screen of the terminal device 3 Etc., the game screen of the terminal device 3 is switched one after another and the game can be advanced.

  Thereafter, when the player operates the terminal device 3 to close the game screen (S16), the game server 1 performs logout processing (S25). For example, when the player closes the web browser, the game server 1 performs logout processing after a session timeout.

  By the way, in this game system, even when the player logs out from the game server 1, the game server 1 side can read the game information of the player and advance the game. For example, another logged-in player may start a battle (individual battle) against a team of players who are logged out. Also in this case, the game progress means 52 of the game server 1 reads out the game information of each player from the database server 2 and executes a battle regardless of whether or not the player is logged in, and reflects the execution result. The game information of each player is updated. In the league battle mode, the game progress means 52 of the game server 1 reads the game information of each player from the database server 2 and automatically executes the league game without the player operating the terminal device 3. Thus, the result of the battle executed when the player is logged out from the game server 1 can be confirmed on the screen when the player accesses the game server 1 thereafter.

[Operation of game management device]
Next, a more detailed operation example of the game management device according to the embodiment of the present invention will be described with reference to the flowcharts of FIGS. FIG. 21 shows the flow of processing of the game server 1 targeting one player, and the same processing is performed for each player managed by the game server 1.

  As shown in FIG. 21, the authentication means 53 of the game server 1 receives the access request from the terminal device 3 of the player (YES in S31), or the login ID / password transmitted from the terminal device 3, or the mobile phone Based on the individual identification number of the terminal or the like, login authentication is performed to determine whether or not to permit access (S32). Here, when access is not permitted (NO in S32), the game server 1 transmits screen data for prompting registration of use of the game service to the terminal device 3 (S33). On the other hand, when access is permitted (YES in S32), access information (log) is stored (S34).

  Then, the game server 1 transmits main screen data (or top screen data) to the terminal device 3 of the player who has permitted access (S35). Thereafter, when a screen request corresponding to the game operation of the player transmitted from the terminal device 3 of the player is received (YES in S36), the game executing means 52a performs arithmetic processing and data processing corresponding to the screen request. The game is executed (S37).

  Thereafter, the game server 1 determines whether or not the game information of the player needs to be updated by executing the game (S38). If the game server 1 needs to be updated (YES in S38), it is stored in the database server 2. The game information of the player is updated (S39). For example, when the player's game operation is an operation for performing an individual battle with another player, the game information of the player such as information on the game result, operation cost, reinforcement points, items, etc. is updated as a result of the battle being executed. Will be. On the other hand, for example, when the game operation of the player is an operation for confirming the result of the league game, the game execution process corresponding to the operation is only a data process for reading out the result information of the league game from the database server 2, There is no change in the player's game information before and after the process, and therefore there is no need to update the player's game information (NO in S38).

  Thereafter, the game screen generation means 52b generates game screen data reflecting the game execution result (S40), and the game screen transmission means 52c transmits the game screen data to the terminal device 3 of the player (S41). Thereafter, it is determined whether or not the terminal device 3 of the player has logged out (S42), and the game proceeds by repeating the processes of S36 to S41 until the terminal device 3 logs out.

  Next, with reference to FIG. 22, a processing example at the time of canceling a friend in the game server 1 will be described. The flowchart of FIG. 22 shows the flow of processing of the game server 1 targeting two players in whom a friendship relationship is established, and for all pairs of friends managed by the game server 1 The same processing is performed.

  The player can voluntarily cancel the friendship with his fellow player at any time. For example, the friendship relationship with the fellow player can be canceled by selecting a fellow player who wants to cancel the friendship relationship from the friend list shown in FIG. 14 and performing a predetermined operation. Unlike when a fellowship is established, the other party's approval is not required to cancel it. When the operation for canceling the friend is performed, a request for canceling the friend is transmitted from the terminal device 3 of the player to the game server 1.

  As shown in FIG. 22, when the game server 1 receives a friend cancellation request from the terminal device 3 of the player (YES in S51), the friend management unit 54 executes a friend relationship canceling process (S52). For example, as shown in FIG. 11A, the fellow information storage means 54a of the fellow management means 54 sets a fellow cancellation flag on the fellow information of two persons whose fellow relations have been canceled. As a result, even after the relationship between the two players is canceled, the past friend information relating the two players is retained (S53).

  Thereafter, the fellow management unit 54 sets the canceler information illustrated in FIG. 11A so that it is possible to identify which player voluntarily released the fellow out of the two persons whose fellow relations were canceled ( S54). The process of S54 can be omitted.

  In addition, as another example of the cancellation process of the friendship relationship, the friendship information of the two persons whose friendship relationship has been canceled is deleted (S52), and the friendship relationship is canceled with the side that has voluntarily canceled the friendship relationship as shown in FIG. 11B. Past fellow information relating the two players on the other side may be newly stored (S53 and S54).

  Thereafter, the game server 1 transmits information (such as screen data including the cancellation notice) for notifying the friendship cancellation to the terminal devices 3 of the two players whose friendships have been canceled, The fact that the friendship is canceled is notified to the two players (S55). As an example of the notification, in addition to displaying that the friendship is canceled on the game screen, notification by voice or notification using a combination of screen display and voice is also conceivable. The notification by voice can be realized by including voice data in screen data (HTML data or the like) transmitted from the game server 1 to the terminal device 3 of the player. In addition, in order for the game server 1 to notify the cancellation of the friendship, the terminal device 3 of the player needs to access the game server 1. The terminal device 3 of the player who voluntarily cancels the friendship can be notified immediately because it accesses the game server 1 at the time of cancellation, but the terminal device 3 of the released player accesses the game server 1. Not necessarily. Therefore, the game server 1 executes the notification process of S55 when the terminal device 3 of the player whose friendship has been released first accesses the game server 1 after executing the friendship release process. become.

  Next, with reference to FIG. 23, the revival of the friendship will be described. FIG. 23 shows an example in which the player A makes a friend revival application to the player B. Further, the terminal device of the player A is “terminal device 3A”, and the terminal device of the player B is “terminal device 3B”.

  The player can check his / her past buddy list on the screen of the terminal device 3 at any time. For example, if the player A operates the terminal device 3A and selects a “past buddy list” button in the main screen, a past buddy list request is transmitted from the terminal device 3A to the game server 1 (S61). The game server 1 receives this request (S71), and reads the past fellow information of the player A stored in the fellow information storage means 54a (S72). And the fellow history transmission means 101 transmits the information (screen data of a past fellow list) which displays the past fellow list of the player A to the terminal device 3A (S73). For example, a past buddy list screen as shown in FIG. 17 is displayed on the terminal device 3A that has received the information transmitted by the buddy history transmission means 101 (S62). Thereby, the player A can consider the other party who wants to return a friend relationship, confirming the past friend player on the screen of the terminal device 3A.

  Then, when the player A performs an operation of selecting a past friend player to restore the friendship in the terminal device 3A on which the past friend list is displayed (S63), information on the operation is obtained from the terminal device 3A. It is transmitted to the game server 1. In this operation, if the player A inputs a message to the player B, the message is also transmitted from the terminal device 3A to the game server 1 and can be made a friend revival application with a message.

  In this example, it is assumed that the player A has performed an operation of selecting a past fellow player B. The game server 1 receives this operation information (S74), and the fellow revival application means 102 executes a friendship revival application process from the player A to the player B (S75). For example, as shown in FIG. 19, the fellow revival application means 102 associates the players A and B with past fellow information (information of the fellow information ID = “1”) and makes a revival application. A player ID = “000001” is stored. Further, when the player A's terminal device 3B accesses the game server 1 for the first time after the player A has applied for a resurrection, the friend revival application means 102 has applied for a resurrection from the player A to the terminal device 3B. Send information to display that. In the case of a friend revival application with a message, in cooperation with the message transmission means 55b, the friend revival application means 102 also transmits a message from the player A to the terminal device 3B.

  In the terminal device 3B of the player B that has received the information transmitted by the fellow revival application means 102 (S81), for example, an approval / rejection selection screen as shown in FIG. 18 is displayed. Note that in the case of a friend revival application with a message, a message from the player A is also displayed. Although the player B can approve or reject the friend revival application from the player A, FIG. 23 illustrates an operation in the case of approval.

  When the player B performs an operation of selecting the approval button 214 (S82), information on the operation is transmitted from the terminal device 3 of the player B to the game server 1. In the game server 1 that has received the information of this operation (S76), the fellow management means 54 executes a revival process for the fellow relation between the players A and B (S77). For example, the friend management means 54 sets the friend release flag of the friend information that associates the players A and B to “0”. At this time, the information of the player ID approved and the recovery time (resurrection date, etc.) shown in FIG. 19 may be stored.

  Thereafter, the game server 1 notifies the terminal devices 3A and 3B of the two players A and B whose friendships have been restored to notify that the friendships have been restored (screen data including the effect of restoration). Etc.) is transmitted (S78). In the terminal devices 3A and 3B that have received this reversion notice (S64, S83), it is displayed that the friendship between the players A and B has been revived.

  As described above, by applying the game server 1 of the present embodiment, the player can display a past buddy list on his / her terminal device 3 and can easily apply for a buddy revival to a desired partner. Can be done. Thereby, the player is given an opportunity to reconstruct a friendship relationship with a past fellow player. Therefore, it becomes possible to enjoy a new game that was not possible in the past as exemplified below.

  For example, if the player accidentally cancels the friendship relationship with the partner who was a friend by an erroneous operation or the like, an opportunity to reconstruct the friendship relationship with the same partner is obtained thereafter.

  Also, if for some reason (for example, devoted to overseas business trips or taking an examination), the player needs to temporarily leave the game for a while, the following measures can be taken. That is, during the period away from the game, the friendship with the fellow player is canceled, and then, when the game is resumed, a friend revival application is made to the past fellow player to restore the friendship. In this case, before the player cancels the friendship relationship with the fellow player, the message is sent to the other party that the reason and the application for resurgence will be made at a later date. On the other hand, it is easy to obtain approval from the other party, and it is possible to smoothly restore the friendship. This correspondence is particularly effective in a game in which an upper limit (for example, 50 people) is set for the number of friends. In other words, if the player keeps maintaining the friendship while the player is away from the game, the fellow player's limited friendship frame may be wasted. Therefore, if the friendship during the period in which the player is away from the game is resolved, the fellow player can enjoy exchanges with other players using the vacant fellowship frame.

  In addition, the following is also possible in a game in which an upper limit is set for the number of friends. That is, in order for a player whose number of friends has reached the upper limit to become a friend with another new player Y, the relationship with the friend player X is once released. After that, in the case where the exchange as expected with the player Y is not possible, the relationship with the player Y is canceled, and then the friend X is applied to the player X to restore the friendship. Thus, if the game server 1 of this Embodiment is applied, the player can enjoy the new game which used the limited friend frame effectively.

  By the way, by making the friend revival application possible, there is a possibility that the player who voluntarily canceled the mate relationship will receive a friend revival application in an undesired form at a later date from the past fellow player who has released the corner. A configuration for avoiding this will be described below.

  As illustrated in FIG. 11A or FIG. 11B, the fellow information storage unit 54 a is a canceller who is a player who voluntarily cancels the fellowship and a player who voluntarily cancels the fellowship from the opponent. It is memorized separately by information. Then, in response to a request from the terminal device 3 operated by the player, the fellow history transmission means 101 voluntarily establishes the fellow relation among the past fellow information of the player stored in the fellow information storage means 54a. The information at the time of canceling is read, and the information for displaying the past fellow player who the friend relationship voluntarily canceled is transmitted to the terminal device 3. The fellow history transmission process in the game server 1 having this configuration will be described below with reference to FIG.

  Here, an operation example of the game server 1 that extracts and processes necessary information from the friend information shown in FIG. 11A in response to a request from the terminal device 3 operated by the player A will be described. If the player A operates the terminal device 3 and selects, for example, a “past buddy list” button in the main screen, a past buddy list request is transmitted from the terminal device 3 of the player A to the game server 1. If the game server 1 receives this request (YES in S91), first, the companion information of the target player A (player ID = “000001”) is extracted from the companion information shown in FIG. 11A (S92). That is, from the fellow information shown in FIG. 11A, fellow information in which “000001” is included in either the player ID that has applied for the fellow or the approved player ID is extracted. By this step S92, the fellow information of the fellow information ID = “1”, “2”, “3”, “22”, “23”, “81” is extracted. Further, the game server 1 extracts past friend information in which the friend release flag is set to “1” from the friend information extracted in step S92 (S93). By this step S93, the companion information of the companion information ID = “1”, “2”, “22”, “23” is extracted. The steps S92 and S93 can also be executed simultaneously by a multiple condition search of the database.

  Furthermore, the game server 1 extracts the past fellow information which the player A voluntarily canceled from the past fellow information extracted in step S93 (S94). That is, when the player ID of player A = “000001” is included in the “player ID for applying for friend” field, information whose “releaser information” is “1” is extracted. If the player ID of player A = “000001” is included in the “approved player ID” field, information with “0” is extracted for “releaser information”. By this S94, the companion information of the companion information ID = “1” and “23” is extracted. This step S94 can also be executed simultaneously with S92 and S93 by multi-condition search of the database.

  Thereafter, the game server 1 lists up the player IDs of the past friends of the player A's opponent from the past friend information extracted in step S94 (S95). By this step S95, “000002” and “0000012” are listed as the player IDs of the past fellow players that the player A voluntarily released.

  Thereafter, the fellow history transmission means 101 generates past fellow list screen data consisting only of past fellow players from which the player A has voluntarily canceled the fellow relation based on the player ID listed in step S95. Is transmitted to the terminal device 3 of the player (S96).

  As a result, only the past fellow players for whom the player has canceled the friendship relationship are displayed on the terminal device 3 of the player, and the partner information when the player cancels the friendship relationship from the opponent is not displayed. . Therefore, the player on the side where the friendship relationship has been canceled cannot make a friend revival application for the player on the canceling side. Thus, it is possible to effectively avoid a situation in which the canceled player receives an unwanted friend revival application from the canceled player.

  By the way, it is thought that a conscientious fellow player conveys the reason by a message before canceling the fellowship. If the friendship is suddenly canceled from the opponent without giving a reason, it is considered that there are many players who do not want to apply for a friend revival for the partner who has released himself. In consideration of such circumstances, the player can also expect an effect that it becomes easier to find a desired opponent by displaying a past fellow player on the terminal device 3 in a state where the opponent who has released him is omitted. .

[Another configuration example of the game management device]
Next, the configuration of the game management device that facilitates the approval of the player who has received the friend revival application and can easily restructure the friendship will be described with reference to the functional block diagram of FIG. . In addition, the same member number is attached | subjected about the structure similar to the structure shown in previous drawing, The description is abbreviate | omitted suitably.

  The game server 1 (game management device) according to the present embodiment further includes a friend formation point granting unit 103 in addition to the units shown in FIG. This friend formation point grant means 103 is implement | achieved when CPU11 of the game server 1 runs the program which concerns on this Embodiment. The friend formation point giving means 103 has a function of giving a predetermined friend establishment point to at least a player who has approved as a bonus when a friendship relationship is established between two players. That is, the fellow establishment point granting means 103 may grant the fellow establishment points to both the fellow application side and the approval side players, or may grant the fellow establishment points only to the approval side player. This Embodiment demonstrates the structure which provides a predetermined friend formation point to both the player of the friend application side and the approval side.

  In the present embodiment, the friend establishment point giving means 103 gives friend establishment points, for example, by three points to two new players who have established a friendship relationship. Here, the friend formation point can be used as, for example, the above-mentioned action power point or a point that increases the maximum value of the operation cost. When the friend establishment points are given to the two players who have established the friendship relationship, the two points stored in the possession point storage means 51d of the game information management means 51 are updated.

  In addition, in order to avoid the increase / decrease of the friend establishment point when the friendship relationship is canceled by any one player, the same 3 points as the friendship establishment point given to the two players when the friendship relationship is established May be reduced by the game information management means 51. Whether or not points are reduced when the friendship is released can be arbitrarily set.

  Moreover, the friend formation point grant means 103 of this Embodiment gives the point given with respect to the past friend player who approved the friend revival application to the player who approved the normal friend application instead of the revival application. It is designed to be higher than the point. For example, the fellow establishment point giving means 103 gives 3 points to a player who has approved a normal fellow application, and 5 points to a past fellow player who has approved a fellow revival application. In addition, the value of each point above is not limited to these, and it can be set to any value as long as it satisfies the condition that more points are granted when approving a fellow revival application than when approving a normal fellow application. it can.

  An example of the friend formation point giving process in the game server 1 of the present embodiment will be described below with reference to FIG.

  When the player performs an approval operation (S101), it is determined whether or not the approval is an approval for the fellow revival application (S102). Here, when the approval is not a friend revival application but an approval for a normal friend application (NO in S102), the friend management means 54 executes a normal friendship establishment process (S103). In this case, the fellow establishment point granting means 103 grants, for example, three fellow establishment points to the approved player (S104).

  On the other hand, when the approval is an approval for the fellow revival application (YES in S102), the fellow management means 54 executes a fellow relation revival process (S105). In this case, the fellow establishment point giving means 103 gives, for example, five fellow establishment points to the approved player (S106).

  After the process of S104 or S106, the fellow establishment point granting means 103 grants, for example, three fellow establishment points to the player on the application side (S107).

  As described above, in this embodiment, the approval of the player who has received the fellow revival application is promoted by giving more points when the fellow revival application is approved than when the normal fellow application is approved. doing. As a result, the friendship is easily revived, and the effectiveness of the function of restoring the friendship of the game server 1 is enhanced.

  By the way, if the person who approved the friend revival application can get more points than approving the normal friend application, it is said that the cancellation and revival of the friendship will be repeated in a short time aiming only to acquire points with each other Inappropriate situations may occur. For example, it is possible to plan to repeat the revival of the friendship aimed at points while exchanging messages between friends. Therefore, a configuration for avoiding such a situation will be described below.

  As shown in FIG. 25, the game server 1 further includes a resurrection time storage unit 104 and a re-resurrection limiting unit 105. These means are realized by the CPU 11 of the game server 1 executing the program according to the present embodiment.

  The revival time storage means 104 stores information on the revival time of the fellow relation when the past fellow player of the player approves the application by the fellow revival application process executed by the fellow revival application means 102 and the fellow relation is restored. It has the function of storing in the database server 2). Here, as the recovery time, time information such as year, month, day, hour, minute, second is stored, but the unit of time stored here can be arbitrarily set. For example, as shown in FIG. 19, the resurrection time storage unit 104 stores the resurrection time (resurrection date, etc.) in the database server 2 in association with the friend information IDs associated with the two players whose friendships have been resurrected. To do.

  In addition, the re-resurrection limiting means 105 determines the relationship between the two players until a predetermined period (for example, three months) elapses from the resurrection time of the two players stored in the resurrection time storage means 104. It has a function that does not allow re-resurrection. For example, after two players revive a fellowship relationship, even if an operation for a fellowship revival application is performed by either one of the players before a predetermined period of time elapses, the fellowship revival application is not accepted. Prevent processing from being executed. Then, after the predetermined period has elapsed, the friend recovery application process is executed when the friend recovery application operation is performed. Alternatively, the fellow revival application process is executed even before the predetermined period has elapsed, but the player has performed an approval operation for the fellow revival application before the predetermined period has elapsed. In such a case, the approval process is not accepted and the friend recovery process is not executed. Then, after the predetermined period has elapsed, the friend recovery process is executed when an approval operation for the friend recovery application is performed.

  Here, an arbitrary period can be set as the “predetermined period”, which is a period during which re-revival is prohibited after the fellowship is revived. For example, the predetermined period may be a certain period (for example, three months). Alternatively, as shown in FIG. 19, the number of revival of the friendship relationship between the two players may be stored in a storage device (database server 2 or the like), and the predetermined period may be changed according to the number of revival. For example, the predetermined number of times is set to 2 months if the number of resurrections of the two players is 2nd, 3 months for the 3rd time, 4 months for the 4th time, etc. The longer the predetermined period is set. As a result, the greater the number of repetitions of the revival of the friendship due to the point aim, the longer the period during which the revival is prohibited. Therefore, it is possible to effectively suppress the action of the player aiming at the inappropriate point.

  An example of the re-resurrection restriction process in the game server 1 according to the present embodiment will be described below with reference to FIGS. Note that the flowcharts of FIGS. 27 and 28 show the processing flow of the game server 1 for two players of friends (current or past friends), and are managed by the game server 1. The same process is performed for all pairs of friends.

  As shown in FIG. 27, when the fellow revival process is executed by the fellow revival application and approval between the two players (YES in S111), the revival time storage means 104 stores the revival time in the database. Store in the server 2 (S112). After that, when either one of the two players whose friendship has been restored performs a canceling operation and the friendship between the two players is canceled (YES in S113), the friendship is re-revitalized until a predetermined period has elapsed. The process proceeds to the process of limiting (loop process of S114 to S117). That is, even if any one of the players performs an operation for reviving a friend (YES in S114), if the predetermined period has not elapsed since the reactivation time (NO in S115), the re-resurrection limiting means 105 applies a friend reinstatement application. Is not permitted (S116). Thereby, the fellow revival application process by the fellow revival application means 102 is not executed. In this case, the game server 1 transmits information for notifying that the re-resurrection is prohibited until a predetermined period elapses from the previous resurrection to the terminal device 3 of the player who performed the friend resurrection application operation. (S117).

  On the other hand, when one of the players performs an operation for reviving a friend (YES in S114), if the predetermined period has already elapsed from the reviving time (YES in S115), the fellow reviving application means 102 is used. Executes the fellow revival application process (S118). Thereafter, when the other player approves the friend recovery application (S119), the friend management means 54 executes the friend recovery process (S120). Thereafter, returning to the processing of S112, the recovery time storage means 104 stores (updates) the recovery time.

  As described above, since the two players who have once returned the friendship relationship cannot accept the friend revival application until the predetermined period has elapsed after the return, the revival of the friendship relationship is limited.

  Next, another example of the re-resurrection restriction process in the game server 1 will be described with reference to FIG. When the friend revival process of two players is executed (YES in S111), the revival time storage means 104 stores the revival time in the database server 2 (S112). Thereafter, the relationship between the two members is canceled (YES in S113), and then, when an operation for applying for a friend revival is performed by any one player (YES in S121), a predetermined period has elapsed from the revival time. Regardless of whether or not there is, the fellow revival application means 102 executes the fellow revival application process (S122). In this fellow revival application process, information for notifying that it cannot be approved until a predetermined period has elapsed since the previous revival is transmitted to the terminal device 3 of the player who has received the fellow revival application. Also, it is desirable to transmit information for notifying that the opponent cannot be approved until a predetermined period has elapsed since the previous revival to the terminal device 3 of the player who performed the friend revival application operation.

  Thereafter, even if an approval operation is performed from the other player (YES in S123), if the predetermined period has not elapsed from the recovery time (NO in S124), the re-resurrection limiting means 105 does not permit the approval (S125). . Thereby, the fellow revival process by the fellow management means 54 is not executed. In this case, the game server 1 transmits information for notifying that the re-resurrection is prohibited until a predetermined period elapses from the previous resurrection to the terminal device 3 of the player who performed the approval operation ( S126).

  On the other hand, when the approval operation is performed (YES in S123), if the predetermined period has already elapsed from the recovery time (YES in S124), the fellow management unit 54 executes the fellow recovery process (S127). ). Thereafter, returning to the processing of S112, the recovery time storage means 104 stores (updates) the recovery time.

  As described above, since the two players who have once returned the friendship relationship are not accepted until the predetermined period has elapsed after the return, the reinstatement of the friendship relationship is limited.

  According to the configuration of the present embodiment, even if the two players plan an inappropriate point aim by repeating the cancellation and revival of the friendship, once the friendship is revitalized, a predetermined period (for example, 3 It will not be possible to revive again until a month). Therefore, it is possible to effectively suppress the inappropriate player's action of repeating the cancellation and revival of the friendship in a short period aiming only at the point acquisition between the friends.

  Next, another configuration for avoiding a situation in which the cancellation and revival of the friendship are repeated in a short period aiming only at the point acquisition between the friends will be described below.

  The fellow history transmission unit 101 releases the fellow relationship between the two players again until a predetermined period (for example, three months) elapses from the restoration time of the two players stored in the restoration time storage unit 104. Even if it is a case, when transmitting the information for displaying the past fellow player to the said terminal device 3 according to the request | requirement from the terminal device 3 which one player of the said two players operates, It has a function of not including information of the other player in the transmitted information. An example of the fellow history transmission process executed by this fellow history transmission means 101 is shown in the flowchart of FIG.

  If the player operates the terminal device 3 and selects, for example, a “past buddy list” button in the main screen, a past buddy list request is transmitted from the terminal device 3 to the game server 1. If this request is received by the game server 1 (YES in S131), the fellow history transmitting means 101 stores the resurrection time storage means 104 among the past fellow information of the players stored in the fellow information storage means 54a. Only the past friend information in which a predetermined period (for example, three months) has elapsed from the resurrection time of the player is extracted and read (S132). And the fellow history transmission means 101 transmits the past fellow list screen data not including the past fellow player who has not passed the predetermined period from the resurrection time to the terminal device 3 of the player (S133).

  In addition, the flowchart of FIG. 30 shows the flow of the re-resurrection restriction process in the game server 1 for two players of friends (current or past friends).

  When the friend revival process of two players is executed (YES in S111), the revival time storage means 104 stores the revival time in the database server 2 (S112). Thereafter, the relationship between the two friends is canceled (YES in S113), and then an operation for requesting a past friend list on the terminal device 3 of either one of the two players ("past friend list" button) Is selected (YES in S141), the subsequent processing branches depending on whether or not a predetermined period has elapsed from the revival time of the two players (S142). Here, if the predetermined period has not elapsed since the revival time of the two players (NO in S142), the fellow history transmission means 101 uses the past peer list screen data not including the opponent player as the terminal device of the player. 3 (S143). On the other hand, when the predetermined period has elapsed since the revival time of the two players (YES in S142), the fellow history transmitting means 101 sends past fellow list screen data including the opponent player to the terminal device 3 of the player. Transmit (S144).

  According to the configuration of the present embodiment, even if two players plan to make an inappropriate point aim by repeatedly canceling and reviving the friendship, once the friendship is revived, a predetermined period (for example, 3 Until the month), the opponent players are not displayed on the terminal device 3 as past fellow players, and it becomes impossible to apply for fellow revival. Therefore, it is possible to effectively suppress an inappropriate player's action of repeatedly canceling and reviving the friendship in a short period aiming only at the point acquisition between the friends.

  Next, yet another configuration for avoiding a situation in which the cancellation of the friendship relationship and the resurrection in a short period of time will be described with the aim of only earning points between friends.

  As shown in FIG. 25, the game server 1 is provided with a revival count storage means 106 for storing the revival count of friendship relationships between two players in a storage device (database server 2). For example, as shown in FIG. 19, the revival count storage means 106 stores the revival count in the database server 2 in association with the pal information ID associated with the two players whose pal relationships have been revived.

  Then, when the number of revival of the two players reaches a predetermined number (for example, five times), the re-resurrection limiting unit 105 does not permit the revival again after the predetermined number of times of the two players is exceeded.

  An example of the re-resurrection restriction process in the game server 1 will be described with reference to FIG. When the fellow revival process of two players is executed (YES in S151), the revival number storage means 106 stores (updates) the revival number N in the database server 2 (S152). If the number of resurrections of the two players reaches a predetermined number, the game server 1 transmits information for notifying the terminal device 3 of the two players that further resurrection cannot be performed. It is desirable.

  Thereafter, the friendship relationship between the two people is canceled (YES in S153), and then, if one of the players performs an operation to apply for a friend revival (YES in S154), the revival number N of the two people is Subsequent processing branches depending on whether the number is less than the predetermined number (S155). Here, when the number N of revival of two persons is less than the predetermined number (YES in S155), the mate revival application means 102 executes the mate revival application process (S156). Thereafter, when the other player approves the friend recovery application (S157), the friend management means 54 executes the friend recovery process (S158). Thereafter, returning to the processing of S152, the restoration count storage means 106 stores (updates) the restoration count N.

  On the other hand, when the number N of resurrections of the two has reached the predetermined number (NO in S155), the re-resurrection limiting means 105 does not permit the fellow resurrection application (S159). Thereby, the fellow revival application process by the fellow revival application means 102 is not executed. In this case, the game server 1 transmits information for notifying that it is no longer possible to revive the opponent who repeated the revival a predetermined number of times to the terminal device 3 of the player who performed the friend revival application (S160).

  As a result, even if the two players plan the inappropriate point aim by repeating the cancellation and resurrection of the friendship, it is not possible to revive more than a predetermined number of times, so that the inappropriate point aim can be suppressed. .

[Another configuration example of the game management device]
Next, a description will be given of a game management apparatus in which the above-described configuration (a configuration in which a friend revival application is possible) is suitable. This game management device has a configuration in which a friendship period is set for two players who have established a friendship relationship, and the friendship relationship is automatically canceled when the friendship period ends. As described above, when the friendship relationship is automatically canceled by the end of the friendship period set for the two players instead of intentional release by the players, it is desired to restore the friendship as much as the friendship is released. Therefore, the above-described configuration that makes it easy to apply for a fellow revival with a simple operation is preferable.

  Below, the game management apparatus of this Embodiment is demonstrated, referring the functional block diagram of FIG. In addition, the same member number is attached | subjected about the structure similar to the structure shown in previous drawing, The description is abbreviate | omitted suitably.

  As shown in FIG. 32, the game server 1 (game management apparatus) further includes a fellow period setting means 56, a fellow relation releasing means 57, and a fellow period notifying means 58 in addition to the means shown in FIG. . These means 56-58 are implement | achieved when CPU11 of the game server 1 runs the program which concerns on this Embodiment.

  The fellow period setting means 56 has a function of setting a fellow period in which the fellow relation between the players is continued for two players in which the fellow relation is established. If the companion period ends, in principle, the companionship between the two will be automatically released.

  Here, the length of the fellow period set by the fellow period setting means 56 can be set to an arbitrary period length such as one week, ten days, two weeks, or one month. In addition, the length of the fellow period may be fixed, or for example, the period length may be changed randomly at the time of setting. Furthermore, an appropriate period length may be set according to the level relationship between players.

  In the present embodiment, a fellow period setting unit 56 configured to set a period length according to the level relationship between players will be described below.

  The companion period setting means 56 is a first player when a companion relationship is established between two players: a player who has applied for a friend (first player) and a player who has approved the friend application (second player). And a game period setting function based on a predetermined condition including the relationship between the game level of the second player and the game level of the second player.

  Here, the “game level” used to determine the fellow period is index information that directly or indirectly indicates the progress degree, skill level, ability, etc. of the player. The game level includes (a) the player's own level, (b) the level of the player's possession in the game (examples of possession: character, group / team unit that is a collection of characters, item, etc.), (C) The value calculated from the number of possessions in the game of the player, the ability value of the possession, etc., (d) the level of the stage achieved by the player, the level of the league to which the player currently belongs, and the like.

  As a specific example of the above (a), there is a level of the player in the game where the level is increased by the player progressing the game and accumulating experience values. Further, as a specific example of the above (b), there is a character level in a game in which the character possessed by the player is used in a practice mode, a game mode, a breeding mode, a synthesis mode, etc. to enhance and level up the character. . Here, the character level only needs to be a value representing the character's growth level, ability level, strength, and the like, and may be a character ability value.

  In addition, as a specific example of the above (c), there is a value for evaluating the number of characters and items owned by the player in a game in which the player acquires characters and items as the game progresses. For example, the number of characters (player cards) greater than or equal to a predetermined ability value owned by the player can be set as the game level of the player.

  As a specific example of the above (d), a plurality of stages having different levels (difficulty levels) are provided in the game, and when one stage is cleared, the game proceeds to another stage with a higher difficulty level. There is a level of the stage achieved by the player in the game. In addition, as another specific example of the above (d), there is a level of a league to which the player currently belongs in a game in which the player can belong to a higher level league by acquiring a higher score in the league game. .

  In the present embodiment, an example in which (a) the player's own level is applied as the game level used for determining the fellow period will be described below.

  The companion period setting means 56 determines the companion period based on a predetermined condition including a level relationship between the first player who has applied for the companion and the second player who has approved it. To do. The fellow period setting means 56 sets the fellow period that is set when the second player whose game level is higher than that of the first player approves the fellow application, the game level being the same as that of the first player or the first player. Also, it is shorter than the friend period set when the second player with a low game level approves the friend application. As a specific example, when the level of the first player who applied for the friend is L1, and the level of the second player who approved it is L2, the friend period setting means 56 is set to 5 days when L1 <L2. When L1 = L2, the fellow period is 7 days, and when L1> L2, the fellow period is 10 days. The number of days of the fellow period is not limited to these. For example, an arbitrary period can be set, such as 1 week when L1 <L2, 2 weeks when L1 = L2, and 3 weeks when L1> L2. .

  The case of L1 <L2 is a case where a second player with a higher game level than the first player approves the friend application. In this case, the approved second player becomes a friend with a player at a lower level than that of the player (that is, a player who has a low contribution level such as battle cooperation), so the friend who cannot exchange as he desires. In many cases, it would be desirable to cancel a fellowship in a short period of time. Therefore, the companion period is made shorter than in the case of L1 = L2 (establishment of companions between the same levels) or L1> L2.

  On the other hand, the case of L1> L2 is a case where a second player whose game level is lower than that of the first player approves the friend application. In this case, since the approved second player becomes a friend with a higher-level player (that is, a player with a higher contribution level such as battle cooperation) than himself, the case where L1 = L2 or L1 <L2 is satisfied. Many people want to continue long-term friendship. Therefore, the companion period is made longer than when L1 = L2 or L1 <L2.

  As described above, by changing the companion period depending on whether the side that approved the companion application is at a higher level than the application side, it is possible to set an appropriate companion period in accordance with the hope of the player on the approved side Become. As described above, the reason for setting an appropriate friend period from the viewpoint of the player who has approved the friend application, not the player who made the friend application, is as follows. In other words, the player who has applied for a friend must have applied for a friend considering that he wants to be a friend with the opponent regardless of the level of the player. On the other hand, for a player who has received a friend application, it can be rejected. However, it has often been regretted later because the application has been approved without permission without permission. Therefore, an appropriate friend period is set from the viewpoint of the player who has approved the friend application.

  Next, another example of the fellow period determination process by the fellow period setting means 56 will be described. The fellow period setting means 56 is configured to set the fellow period according to the level difference between the players in which the fellow relation is established. In the following description, the level of the first player who applied for the friend is L1, the level of the second player who has approved it is L2, and the difference between L1 and L2 is the level difference D. FIG. 33 illustrates a table representing the relationship between the level difference D and the fellow period. Information in this table is stored in the storage means (such as the RAM 13 or the auxiliary storage device 14) of the game server 1, and is referred to during processing by the fellow period setting means 56.

  First, consider a case where a second player whose level is higher than that of the first player who applied for a friend approves the friend application (in the case of L1 <L2). In this case, as shown in the table illustrated in FIG. 33, the fellow period setting means 56 sets the fellow period to be shorter in steps as the level difference D is larger. In the example of the table of FIG. 33, the level difference D is 1 to 9, 7 days, 10 to 29, 6 days, 30 to 49, 5 days, 50 to 69, 4 days, and 70 to 99, 3 days. If the date is 100 or more, it is set to 2 days. The number of days of the fellow period is not limited to these, and an arbitrary period can be set as long as the condition that the fellow period becomes shorter as the level difference D is larger is satisfied.

  Thus, when the 2nd player whose level is higher than the 1st player who applied for friend has approved the friend application, the level with the 1st player of a lower level than himself / herself for the approved 2nd player The greater the difference D, the smaller the degree of contribution from the first player due to the battle cooperation or the like. Therefore, in this case, by setting the fellow period shorter as the level difference D is larger, more appropriate fellow period setting is realized.

  Next, consider a case where a second player whose level is lower than that of the first player who applied for a friend approves the friend application (in the case of L1> L2). In this case, as shown in the table illustrated in FIG. 33, the fellow period setting means 56 sets the fellow period longer in steps as the level difference D is larger. In the example of the table of FIG. 33, the level difference D is 1 to 9, 7 days, 10 to 29, 8 days, 30 to 49, 9 days, 50 to 69, 10 days, and 70 to 99, 11 days. If the date is 100 or more, it is set to 12 days. The number of days of the fellow period is not limited to these, and an arbitrary period can be set as long as the condition that the fellow period becomes longer as the level difference D is larger is satisfied.

  Thus, when the 2nd player whose level is lower than the 1st player who applied for a friend approves a friend application, the level with the 1st player of a higher level than himself / herself for the approved 2nd player The greater the difference D, the greater the degree of contribution from the first player due to battle cooperation or the like. Therefore, in this case, by setting the companion period longer as the level difference D is larger, more appropriate companion period setting is realized.

  Moreover, when the level of the 1st player who applied for friend and the 2nd player who approved it are the same (when L1 = L2), as illustrated in FIG. 33, the friend period setting means 56 sets the friend period to 7 Set the day.

  The fellow period setting means 56 includes fellow period storage means 56a for storing in the database server 2 (storage device) a fellow period set for two players who have established a fellow relation. FIG. 34 shows an example of a fellow period stored by the fellow period storage means 56a. The companion period storage means 56a stores the companion period (period length), the companion period scheduled end time, and the like in association with the companion information ID. Here, the fellow period end scheduled time is real-world time information corresponding to the final time of the fellow period, and time such as year, month, day, hour, minute, and second is stored. Here, the unit of time can be set arbitrarily. In the present embodiment, an example is shown in which the fellow period storage means 56a stores the date (year / month / day) of the real world corresponding to the final time of the fellow period as the fellow period end scheduled time. Further, the fellow period storage means 56a may store time information such as the date and time when the fellow period is set and the date and time when the fellow relation is established in association with the fellow information ID.

  Next, the fellowship cancellation means 57 will be described. The fellow relation cancellation means 57 has a function of automatically canceling the fellow relation between the two players when the fellow period set for the two players in which the fellow relation is established ends. Here, “automatically cancel” means that the game server 1 side executes the canceling process of the friendship even if the player does not perform a voluntary canceling operation. The fellow relation cancellation means 57 adds a cancellation flag to the information corresponding to the fellow information for which the fellow relation is canceled among the fellow information shown in FIG. 8 registered in the database server 2 or deletes the information. As a result, the process of canceling the friendship is executed.

  Next, the fellow period notification means 58 will be described. The player can check how long the friend period set with his / her friend player is on a screen such as a friend list displayed on the terminal device 3. In order to realize this, the fellow period notification means 58 reads the fellow period information stored in the fellow period storage means 56a and displays the fellow period set between the player and the fellow player. It has a function of transmitting information to the terminal device 3 of the player and notifying the player of the fellow period. In other words, the fellow period notification means 58 performs control to display the fellow period on the screen of the terminal device 3 by transmitting screen data including the fellow period to the terminal device 3 of the player.

  As an example of the screen including the fellow period, there is a fellow list screen as shown in FIG. The buddy list screen is provided with a buddy period display area 80 for displaying a buddy period set between each buddy listed.

  FIG. 35 shows an example of a screen in which a friend period display area 80 displays a scheduled end date (up to 1/17) of the friend period. The information of the fellow period displayed in the fellow period display area 80 is not limited to the scheduled end date of the fellow period, but the scheduled end time of the fellow period (year, month, day, hour, minute, second, etc.) (Time information in arbitrary units). Alternatively, for example, the remaining number of days (for example, 10 days) and the remaining time (for another 20 hours, 10 minutes, 15 seconds, etc.) may be displayed in the friend period display area 80.

  Next, with reference to FIG. 36 thru | or FIG. 38, the friend period setting and friend cancellation | release process in the game server 1 are demonstrated. The flowcharts of FIGS. 36 to 38 show the processing flow of the game server 1 for two players who have established a friendship relationship, and all pairs of friends managed by the game server 1 are paired. The same processing is performed for the above.

  As shown in FIG. 36, when a friendship relationship is established between two players by the second player receiving a friend application from the first player approving it (YES in S251), the friend period setting is performed. The means 56 determines the fellow period based on a predetermined condition including the relationship between the level of the first player and the level of the second player (S252).

  An example of the fellow period determination process in S252 is shown in FIG. In FIG. 37, the level of the first player who applied for a friend is indicated as L1, and the level of the second player who approved it is indicated as L2. The fellow period setting means 56 sets the fellow period to 5 days when S1 <L2 (YES in S261) (S262). Moreover, when L1> L2 (NO in S261 and YES in S263), the fellow period setting unit 56 sets the fellow period to 10 days (S264). The fellow period setting means 56 sets the fellow period to 7 days when L1 = L2 (NO in S61 and NO in S63) (S265).

  Another example of the fellow period determination process in S52 of FIG. 36 is shown in FIG. The fellow period setting means 56 calculates a level difference D, which is the difference between the level L1 of the first player who applied for fellowship and the level L2 of the second player who approved it (S271). Then, when L1 <L2 (YES in S272), the fellow period setting unit 56 shortens the fellow period as the level difference D increases (S273). For example, with reference to the table illustrated in FIG. 33, the fellow period (in the case of L1 <L2) corresponding to the level difference D is acquired. Further, when L1> L2 (NO in S272 and YES in S274), the fellow period setting means 56 lengthens the fellow period as the level difference D increases (S275). For example, with reference to the table illustrated in FIG. 33, the fellow period (in the case of L1> L2) corresponding to the level difference D is acquired. Further, the fellow period setting means 56 sets the fellow period to 7 days when L1 = L2 (NO in S272 and NO in S274) (S276).

  Returning to FIG. 36 and continuing the description, the fellow period setting means 56 sets the fellow period determined when the fellow relation is established as described above for the first player and the second player (S253). For example, as shown in FIG. 34, the fellow period setting means 56 stores the fellow period in association with the fellow information related to the two players in which the fellow relation is established.

  Thereafter, when the fellow period set for the two players with whom the fellow relation is established has ended (YES in S254), the fellow relation cancellation means 57 automatically cancels the fellow relation between the two players. (S255). For example, the fellowship canceling unit 57 executes the fellowship canceling process by adding a canceling flag to the two fellows information registered in the database server 2.

  Thereafter, the game server 1 transmits information (such as screen data including a cancellation notice) for notifying that the friendship relationship has been released to the terminal devices 3 of the two players whose friendship relationships have been released. Then, the two players are notified that the friendship has been canceled (S256). As an example of notification, in addition to displaying that the friendship relationship has been canceled in the game screen, notification by voice or notification using a combination of screen display and voice is also conceivable. The notification by voice can be realized by including voice data in screen data (HTML data or the like) transmitted from the game server 1 to the terminal device 3 of the player. In addition, in order for the game server 1 to alert | report that the friendship relationship was cancelled | released, the terminal device 3 of a player needs to access the game server 1. FIG. Therefore, the game server 1 executes the notification process of S256 when the terminal device 3 of each player whose friendship is released first accesses the game server 1 after executing the friendship release process of S255. It will be.

  Next, in the configuration in which the fellow period setting means 56 sets the fellow period according to the level difference between the two players in which the fellow relation is established, when the level difference fluctuates during the fellow period, the level after change The configuration that is reset to the friend period according to the difference will be described. Here, the case where the fellow period setting means 56 sets the fellow period according to the level difference between players will be described as an example based on the table shown in FIG.

  As shown in FIG. 39, the game server 1 includes a level difference storage unit 60. The game server 1 shown in FIG. 39 includes the fellow history transmission means 101 and the fellow revival application means 102 shown in FIG. 4, but the description of these means 101 and 102 is omitted in FIG. Yes. Furthermore, the game server 1 shown in FIG. 39 may be configured to include the restoration time storage means 104, the restoration resume limiting means 105, and the restoration number storage means 106 shown in FIG.

  The level difference storage means 60 calculates a level difference, which is a difference between the level L1 of the first player who applied for the fellow and the level L2 of the second player who approved it when the fellow period is set (including resetting). The database server 2 (storage device) has a function of storing. For example, as shown in FIG. 40A, the level difference storage means 60 stores the level difference between the players when the friend period is set in association with the friend information ID that uniquely indicates the friend information of both players. Yes. In this example, the level difference is calculated as L1-L2, and the level difference when L1> L2 can be managed as a positive value, and the level difference when L1 <L2 can be managed as a negative value. The level difference storage means 60 is realized by the CPU 11 of the game server 1 executing the program according to the present embodiment.

  Then, the fellow period setting means 56 responds to the level difference after the change when the level difference between the players during the fellow period varies from the level difference at the time of the fellow period setting stored in the level difference storage means 60. Has a function to reset the fellow period. This fellow period resetting process will be described below with reference to the flowchart of FIG. Note that the same steps as those shown in the above-described flowcharts are denoted by the same step numbers, and detailed description thereof is omitted (the same applies to the following flowcharts).

  When the fellow period setting means 56 sets the fellow period for two players when the fellow relation is established (YES in S301), the level difference storage means 60 stores the level difference between the players when the fellow period is set (S302). ).

  Thereafter, during the fellow period (NO in S303), the fellow period setting means 56 detects a change in level difference between players due to a change in the level of at least one player (YES in S304). The necessity of resetting the fellow period is determined according to the level difference (S305). That is, it is determined whether or not the fellow period corresponding to the level difference after the change obtained based on the table shown in FIG. 33 has changed from the fellow period at the time of the fellow period setting. As a specific example, it is assumed that the level L1 of the player who applied for the friend is 30 and the level L2 of the player who has approved it is 57 when the friend is established. Therefore, it is assumed that 6 days is set as the friend period corresponding to the level difference between players of −27 (= 30−57) as shown in the friend information ID = “20” of FIG. 40A. Thereafter, during the companion period, even if the level L2 of the approved player is increased by 1 to 58 and the level difference between the players becomes −28, L1 <L2 is satisfied based on the table of FIG. In this case, since the fellow period remains 6 days in the level difference of 10 to 29, there is no need to reset the fellow period. For example, when the level difference becomes −30 during the fellow period, based on the table of FIG. 33, the fellow period corresponding to the level difference after the change becomes 5 days, and there is a need to reset the fellow period. .

  When resetting the fellow period is necessary (YES in S305), the fellow period setting unit 56 resets the fellow period corresponding to the level difference after the change (S306). For example, the friend period and the friend period end scheduled time of the friend information ID = “20” shown in FIG. 40A are updated to the information shown in FIG. 40B. That is, the companion period setting means 56 shortens the companion period stored in the database server 2 from the 6th to the 5th, and accordingly increases the estimated period of the companion period by one day (from 11/1/10) Update to 11/1/9).

  In the above example, the reset fellow period is shorter than the original period. Naturally, the reset fellow period may be longer than the original period. When the resetting of the fellow period is executed, the process returns to S102, and the level difference storage means 60 stores (updates) the level difference between the players at the time of resetting.

  In addition, when the friend period is ended (YES in S303), the friendship relationship is automatically canceled by the friendship canceling means 57 (S255), and the fact that the friendship relationship has been canceled is in the terminal devices 3 of the two players. Notification is made (S256).

  Thus, after setting an appropriate fellow period according to the level difference between players, when the level difference between players fluctuates during the fellow period, it resets to the fellow period according to the level difference after the fluctuation. Thereby, the adjustment of the suitable friend period which followed the level difference fluctuation | variation between players after a friend period setting is realizable.

  In the above description, the friend period setting unit 56 sets the friend period when the friend relationship is established between the players. However, the present invention is not limited to this, and the friend period setting unit 56 sets the friend period. The timing for setting can be arbitrarily determined.

  For example, the fellow period setting means 56 may set the fellow period setting timing after a certain period of time has elapsed since the fellow relation is established between the players. Here, as the fixed period, for example, an arbitrary period such as 3 days, 1 week, 10 days, 2 weeks, or 1 month can be set. Thus, it may be made not to shift to a state in which the friendship relationship can be automatically canceled by setting the friendship period, with a certain period immediately after the friendship is established as a grace period.

  As described above, in the present embodiment, the friendship period is set when the friendship relationship is established between the two players, and in principle, the friendship relationship between the two players is automatically determined by the end of the friendship period. To be released. Thus, for example, even if a friend application from a lower-level player is approved to become a friend, the friend period is set when the player becomes a friend. Without canceling, the friendship can be canceled by the end of the friendship period. Then, the player can determine whether or not the friendship should be continued from the establishment of the friendship to the end of the friendship period, based on the degree of exchange with the other party. And if it is the other party who wants to continue a friendship relationship, what is necessary is just to continue predetermined friendships, such as performing a friend application again after the friend period end, and continuing a friendship relationship.

  In other words, the fellowship period set when the fellowship is established is regarded as a trial period. For example, even if a fellowship application is received from a player at a lower level than yourself, this is positively accepted and it becomes a trialmate. It is also possible to consider whether or not the other party can have the exchanges that he / she desires by the end of the fellowship period.

  In addition, in a game in which an upper limit is set for the number of friends that each player can establish a friendship with another player, even if the number of friends of the player has reached the upper limit, With automatic cancellation, there is room for the upper limit. In other words, even if the number of friends once reaches the upper limit, it does not fall into a state in which the friends are substantially fixed as in the past, and there is an opportunity to build a new friendship with other players. Given.

  Then, it is considered that the player does not make a friend application or approval again with the lower level player who has not exchanged during the friend period, after completing the automatically canceled friend relationship. On the other hand, it is conceivable to perform operations such as the above-mentioned friend revival application and approval in order to continue the fellowship with an opponent that the player desires (a high-level player or a player who can have fun interacting). . Therefore, with the configuration of the present embodiment, a friend who likes the player while repeating the fellow period setting by the establishment of the fellow relation, the automatic cancellation of the fellow relation by the end of the fellow period, and the application for the revival of the fellow relation as necessary An environment that converges to the composition of the group is prepared. Therefore, it is possible to eliminate the dissatisfaction with the fact that the player has a number of lower-level fellow players who do not have much interaction, and the fellows are substantially fixed in a state in which the favorite group is not in the group configuration.

  In particular, in the case of a game in which an upper limit is set for the number of friends, in the past, a player with a relatively high level has reached the upper limit with a number of lower-level friends who do not have much interaction, It was often fixed. On the other hand, when the game server 1 is applied, even if the upper limit is set for the number of friends, an environment that facilitates building a new friendship with another player is provided to the player. You will be able to enjoy interaction with new friends continuously. Therefore, even if the game is continued for a long period of time, it is difficult for the sense of feeling to the game to occur.

  By the way, even if the friendship relationship is canceled, if the friendship relationship is established again due to the resurrection of the friendship relationship, the friendship period setting unit 56 sets the friendship period again. That is, the fellow period setting unit 56 establishes a fellow relation between two players, a player who has applied for fellow revival (first player) and a player who has approved the fellow revival application (second player). The fellow period is determined based on a predetermined condition including the relationship between the game level of the first player and the game level of the second player, and the fellow period is set for the two players.

  When the friendship is restored between the two players as described above, it is more likely that the two players want to continue the friendship than when the friendship is established for the first time. Accordingly, if the level relationship condition between the first player who applied for and the second player who approved it is the same, the fellow period setting means 56 sets the fellow period when the fellow relationship is established by the resurrection for the first time. It is desirable to make it longer than the fellowship period when the fellowship is established. For example, if the friendship period when the friendship is established for the first time is set to 5 days based on the level relationship of the two players, The friend period is set to 10 days, which is twice the above.

  In addition, if the level relationship condition between the first player who applied for and the second player who approved it is the same, the fellow period setting means 56 makes the fellow period longer as the number of fellow relation revival increases. It is desirable to set.

  In addition, it is considered that there is an extremely high possibility that players who have revived the friendship many times do not want the friendship to be automatically released. Therefore, the fellow period setting means 56 does not set the fellow period (or makes the fellow period unlimited) for the two players who have been revitalized for a certain number of times (for example, three times or more). Is desirable.

  Next, a configuration example of a game management apparatus capable of automatically extending the fellow period will be described with reference to the functional block diagram of FIG. In addition, the same member number is attached | subjected about the structure similar to the structure shown in previous drawing, The description is abbreviate | omitted suitably. The game server 1 (game management device) according to the present embodiment includes an extension means 61. In the extension means 61, a predetermined number of times (or a predetermined number of times or more) of AC processing is executed from the at least one of the two players for which the fellow period is set to the opponent player until the fellow period is completed. In some cases, it has a function to extend the fellow period. The extension means 61 is realized by the CPU 11 of the game server 1 executing the program according to the present embodiment.

  The fact that there is no exchange between players who have become friends is considered to be a lack of interest in each other. On the other hand, when the friends exchange with each other, it is highly likely that the player wants to maintain the friendship. Therefore, when there is an exchange that satisfies the conditions until the companion period ends, the companion period is automatically extended so that the companion relationship is continued.

  And the extension means 61 is whenever a predetermined number of alternating current processes are performed until the extended friend period is complete | finished with respect to the other player from at least one of two players by whom the friend period was extended, It has been repeated to extend the fellow period. Thereby, about the friends who are performing the exchange which satisfy | fills conditions continuously, a friend relationship is maintained continuously by repeating the automatic extension of a friend period.

  The exchanges to be extended can include various exchanges performed between fellow players, such as the above-mentioned greetings, message transmissions, gifts, cooperative support requests, and joint exercises. In addition, greetings are not subject to extension, but some of the exchanges provided in the game are subject to extension, such as sending messages, presents, requesting assistants for cooperative battles, and joint practice only. Only AC may be extended.

  Further, the extension condition is that at least one of the two players has exchanged with the opponent player a predetermined number of times. In the form that satisfies this condition, the form that satisfies the condition if there is a predetermined number of times of exchange with the other party from either one, and the form that both satisfy the predetermined number of exchanges with the other party. Including. Any form may be set as an extension condition. In particular, for the higher level players, which is a conventional issue, when the level of fellow players is lower than their own, it is more proactively resolved that there was an unfair feeling about cooperative battles in the game etc. In order to do this, it is desirable that at least a lower level player exchanges with a higher level player a predetermined number of times or more.

  In addition, regarding the extension condition that the “predetermined number of times of AC processing has been executed by the end of the fellowship period, an arbitrary number of times can be set as the“ predetermined number of times ”. For example, the predetermined number of times may be one time, or two or more times.

  The predetermined number of times N1 when the AC process is executed from the player with a relatively low game level to the opponent player is the AC process executed from the player with a relatively high game level to the opponent player. It is desirable that the setting be greater than the predetermined number of times N2. As an example, the predetermined number of times N1 is three times, and the predetermined number of times N2 is two times. Then, if there is the predetermined number of times of exchange with the other party from either one, the extension condition is satisfied. Alternatively, both satisfy the extension condition if there is the predetermined number of times of exchange with each other.

  According to this configuration, when two players having different levels become friends, a lower level player is more often than a higher level player in order to maintain a fellowship with a higher level player. Requires exchange. Therefore, it becomes easier for the upper level player to end the friendship with the lower level player, so that it is easier to build a favorite group of friends.

  Further, the extension means 61 may be configured to set a predetermined number of alternating currents for satisfying the extension condition according to the level difference between the players. In this case, it is desirable that the predetermined number of times N1 when the AC process is executed from the player having a relatively low game level to the opponent player is set to increase as the level difference D between the two players increases. For example, if the level difference D is 29 or less, the predetermined number N1 is 3 times, if the level difference D is 30 to 69, the predetermined number N1 is 4 times, and if the level difference D is 70 to 99, the predetermined number N1. If the level difference D is 100 or more, the predetermined number of times N1 is 6 times. Thus, the lower the level of the player, the higher the level difference from the higher level player, the greater the number of exchanges required to maintain the fellowship. Therefore, for the higher level player, the lower level player whose level is farther becomes easier to end the friendship.

  Conversely, the predetermined number of times N2 when the AC process is executed from the player having a relatively high game level to the opponent player may be set to be smaller as the level difference between the two players is larger. As an example, if the level difference D is 29 or less, the predetermined number N2 is 3 times, if the level difference D is 30 to 69, the predetermined number N2 is 2 times, and if the level difference D is 70 or more, the predetermined number N2 is set. Once. Thereby, if the exchange is performed from the upper level player to the lower level player, the friendship can be easily maintained with a smaller number of exchanges as the level difference is larger.

  As described above, in the configuration in which the extension means 61 sets a predetermined number of alternating currents to satisfy the extension condition according to the level difference between the players, when the extension means 61 detects a change in the level difference between the players, You may make it reset to the predetermined frequency | count according to the level difference after a fluctuation | variation. Accordingly, it is possible to appropriately adjust the predetermined number of alternating currents for satisfying the extension condition following the level difference fluctuation between the players.

  Here, the length of the period that the extension means 61 extends can be set to a certain period. When the length of the extension period is set to a certain period, an arbitrary period such as one week, ten days, two weeks, etc. can be set. Note that the length of the extension period is not limited to a certain period. For example, the extension period may be determined randomly every time extension is performed. Further, the extension period may be changed according to the number of AC exchanges (the extension period is set longer as the number of AC exchanges increases). Alternatively, the extension means 61 sets the same period as the friend period determined by the friend period setting means 56 based on the level difference between the players (the friend period stored in the friend period storage means 56a) as the extension period. Also good.

  Alternatively, the extension period may be set based on the level difference between the players when the extension means 61 executes the extension process. For example, the table representing the relationship between the level difference between players and the fellow period illustrated in FIG. 33 is used (or shared) as a table representing the relationship between the level difference between players and the extension period, and the extension process is executed. The extension period corresponding to the level difference between the players is acquired based on the table. Of course, a dedicated table representing the relationship between the level difference between players and the extension period may be prepared separately and stored in the storage means (RAM 13 or auxiliary storage device 14) of the game server 1. In the case of this configuration, every time the extension process is executed, an appropriate extension period can be set based on the level difference between the players when the extension process is executed.

  Further, in the configuration in which the extension means 61 sets the extension period based on the level difference between the players when the extension process is executed, when the extension means 61 detects a change in the level difference between the players, the level difference after the change You may make it reset in the period of the extension according to. Accordingly, the extension period can be appropriately adjusted following the level difference fluctuation between the players.

  Execution of the extension process by the extension means 61 can be performed by updating the information of the fellow period stored in the database server 2 to the information after extension. For example, as shown in FIG. 42, the extension means 61 extends the friend period end scheduled time stored in association with the stored friend information ID by the friend period storage means 56a to the date after extension. Execute the process. At this time, in association with the fellow information ID, the date of extending the fellow period is also stored as time information when executing the extension process. Time information such as year, month, day, hour, minute, and second is stored as time information when executing the extension process, but the unit of time stored here can be arbitrarily set. In addition, an extension flag may be set in association with the fellow information ID for information management of the extended fellow period.

  As one of the processing forms by the extension means 61, there is a form in which a friend period extension process is executed every time an extension condition is satisfied in the middle of a friend period. This type of extension processing will be described below with reference to FIG. Note that FIG. 44 and the flowcharts thereafter show the processing flow of the game server 1 targeting two players who are in a friendship relationship, and all pairs of friends managed by the game server 1 are paired. The same processing is performed for the above.

  As shown in FIG. 44, the extension means 61 determines whether or not the extension condition regarding AC has been achieved (S282) before the friend period set for the two players ends (NO in S281). For example, this determination can be made based on the information about the fellow period shown in FIG. 42 (such as the scheduled time for the end of the fellow period) and the information on the player's exchange history shown in FIG. That is, since the exchange history of each player is stored in the database server 2, there is an extended friend period after the friend period is set (or after the friend period is extended). It is possible to detect a state in which the player has exchanged a predetermined number of times defined as the extension condition until the end.

  When the extension condition regarding AC is achieved (YES in S282), the extension unit 61 executes a friend period extension process (S283). For example, the friend period end scheduled time shown in FIG. 42 is updated to the date after extension. At this time, the time information at the time of executing the extension process is stored (or updated).

  Here, a specific example of extension is given. If the fellow period set on January 1 is 7 days (until January 7) and the extension condition for exchange is achieved on January 3rd on the 3rd day, as of January 3rd For example, an extension of 7 days occurs, and the end date of the companion period is January 14th, 7 days after January 7th (current end date). Therefore, the remaining period (number of remaining days) of the fellow period as of January 3 is 11 days. For example, if the exchange extension condition is achieved again on January 6th, an additional extension of 7 days will occur on January 6th, and the end date of the fellow period will be January 14 (the current end date) ) 7 days after January 21st. Therefore, the remaining period of the fellow period as of January 6 is 17 days.

  In the case of this extension example, when the extension condition regarding AC is achieved continuously and early, the remaining period of the fellow period tends to increase. For example, considering a case where a large number of exchanges are performed in a short period and the remaining period of the fellow period increases rapidly, even if the exchange is interrupted for a long period of time, the fellow relations are maintained for a long period of time. Therefore, an upper limit may be set for the remaining period of the fellow period. For example, if the upper limit of the remaining period of the companion period is set to 30 days, the companion period ends if the extension condition regarding the exchange is not satisfied for 30 days or more. Therefore, in order to maintain the fellowship, it is necessary to satisfy the extension condition regarding the exchange within a period of up to 30 days, and it is possible to avoid the fellowship being maintained even though the exchange is interrupted for a long time.

  Therefore, after S283, the extension means 61 restricts the remaining period of the fellow period to the upper limit when the remaining period of the fellow period exceeds the upper limit (YES in S284) (S285). That is, the fellow period end scheduled time shown in FIG. 42 is updated to a date that matches the upper limit of the remaining period of the fellow period.

  If the remaining period of the fellow period after the extension does not exceed the upper limit (NO in S284) or after the remaining period of the fellow period is limited to the upper limit (S285), the process returns to S281, and thereafter, until the fellow period ends S281 The process of S285 is repeated.

  Here, another specific example of extension is given. If the fellow period set on January 1 is 7 days (until January 7) and the extension condition for exchange is achieved on January 3rd on the 3rd day, as of January 3rd For example, an extension of 7 days occurs, but the end date of the companion period is January 10, 7 days after January 3 (extended occurrence date). Therefore, the remaining period of the fellow period as of January 3 is 7 days. For example, if the exchange extension condition is achieved again on January 6, a 7-day re-extension occurs on January 6, and the end date of the fellow period is January 6 (extension occurrence date) ) 7 days after January 13th. Therefore, the remaining period of the fellow period as of January 6 is 7 days. In this extension example, the remaining period of the fellow period is at most an extended period (in this example, 7 days), so there is no need to set an upper limit on the remaining period of the fellow period. When no upper limit is set for the remaining period of the fellow period, the processes of S84 and S85 can be omitted.

  In addition, when the fellowship period ends without satisfying the extension condition regarding the exchange (YES in S281), the fellowship relation canceling unit 57 automatically cancels the fellowship relation (S255), and the fellowship relation is canceled by two people. Is notified to the terminal device 3 of the player (S256). The details of S255 and S256 are as described in FIG.

  As described above, the fellow period set for the two players in the fellow relation is extended every time the predetermined extension condition regarding the exchange is satisfied. And the above-mentioned friend period alerting | reporting means 58 transmits the information for displaying a friend period (when extended, friend period after extension) to the terminal device 3 of a player, and notifies a friend period to a player. Have Therefore, each player can confirm how long the friend period (expansion friend period) set between each player is displayed on the friend list screen illustrated in FIG. . And about a fellow player who does not want to end a fellow relation, a player can continue a fellow relation by performing exchange which satisfy | fills extension conditions by the time of the fellow period confirmed in the fellow list is complete | finished. In this way, by including the information of the fellow period (the fellow period after the extension) on the fellow list screen displayed on the terminal device 3 of the player, the fellow management by the player himself can be facilitated.

  As a processing form by the extension means 61, there is also a form in which it is determined whether or not the extension condition is satisfied at the end time of the fellow period, and when the extension condition is satisfied, the fellow period extension process is executed. In other words, it is a form in which the extension process is executed by determining whether or not the extension is necessary after waiting for the elapse of all the set fellow periods. This type of extension processing will be described below with reference to FIG.

  The extension means 61 determines whether or not the extension condition regarding AC has been achieved when the end time of the companion period set for the two players is reached (YES in S291) (S292). The process of S292 is the same process as S282 described above.

  When the extension condition regarding the alternating current is satisfied (YES in S292), the extension means 61 executes a friend period extension process (S293). On the other hand, if the extension condition regarding the exchange is not satisfied (YES in S293), the friendship relationship is automatically canceled by the friendship canceling means 57 at the end of the friendship period (S255), and the friendship relationship is cancelled. The information is notified to the terminal devices 3 of the two players (S256).

  As described above, in the configuration of the present embodiment, the player does not perform a special operation such as a friend revival application or a friend continuation application, and the friends automatically enjoy the exchange satisfying the extension condition in the game. The companion period has been extended to allow the friendship to continue. In particular, when providing a game service such as a social game that requires strong ease and simplification of player operations, the present configuration is preferable in which the friendship can be continued without requiring a special operation.

  On the other hand, if the exchange that satisfies the extension condition is not performed, it is possible that the mutual interest is sparse and the friends who can enjoy the exchange are not. In this case, since the friendship relationship is automatically released by the end of the friendship period without extending the friendship period, a special operation for releasing the friendship is not necessary.

  In addition, in this embodiment, by introducing the concept of extension of friendship period into a game that incorporates a social element of enjoying interaction with friends, a relationship that is close to real-world friendships (personal relationships) Can be realized virtually. In other words, in the real world, if you have been interacting continuously after becoming a friend (acquaintance), the relationship will be maintained, but once you become a friend, you have not had much interaction after that. On the other hand, friendships will naturally disappear without the intimate relationship between them. And in this Embodiment, the maintenance of the fellowship when the exchange is held is realized by the extension of the peer period and the repetition thereof, and the natural disappearance of the peer relation when the exchange is not held is extended by the extension of the peer period. This is realized by automatically canceling the friendship relationship when the friendship period ends without being made.

  On the other hand, in the past, even if there is no exchange or almost no exchange due to the necessity of an operation to cancel the friendship, most of them are maintained as a friend, and in the real world The current situation is that the friendship and the friendship in the game are greatly different.

  In a game to which the configuration of the present embodiment is applied, as long as the player plays the game normally while having interaction with the friends, a friend group composed of friends who are actually enjoying the interaction is naturally built. Will be.

  By the way, it is considered that there is a high possibility that players whose extension of the friend period by the extension means 61 has been repeated many times do not want the friendship to be automatically released. Therefore, the extension means 61, in addition to the extension process of extending the fellow period when there is a predetermined number of exchanges (or a predetermined number of times or more) before the fellow period ends, the fellow period extension process itself is performed a predetermined number of times ( For two players that have been executed (for example, three times or more), it is desirable that the companion period is unlimited (in other words, the companion period is extended indefinitely). However, if the companion period is unlimited, including the case where the extension process of the companion period is executed a predetermined number of times or more as a result of the unilateral exchange between the lower player and the upper player, the upper player is dissatisfied. May come out. Therefore, in this case, it is desirable that both of the two players make a predetermined number (or more than a predetermined number) of exchanges with each other as an extension condition. In both cases, when there is more than a predetermined number of interactions with each other, the fellow period extension process is executed, and this extension process is repeated a predetermined number of times. This is because it is assumed that they are thinking.

  It should be noted that making the friend period of two players unlimited means substantially not providing a friend period to the two players from the viewpoint of preventing the friendship from being automatically released. Is the same. Therefore, making the friend period of the two players unlimited includes releasing the setting of the friend period of the two players.

  Next, a configuration will be described in which a parameter called intimacy is set for two persons who have established a friendship relationship and the friendship period at the time of extension is adjusted according to the value of intimacy. Intimacy indicates the intimacy of two players in whom a friendship relationship is established, and can also be expressed as the degree of friendship between two players, the depth of friendship, the depth of bonds, and the like.

  As shown in FIG. 39, the game server 1 includes a closeness imparting unit 62 and a correcting unit 63. These means 62 and 63 are realized by the CPU 11 of the game server 1 executing the program according to the present embodiment.

  The intimacy giving means 62 has a function of giving intimacy to the two players when the AC processing is executed between the two players in which the friendship relationship is established by the exchange means 55. The intimacy providing means 62 of the present embodiment provides an intimacy of a predetermined value (for example, 1 point) every time an AC process is executed between two players. In addition, you may change the value of the intimacy given according to the contents of exchange. For example, the greeting may be 1 point, the message transmission may be 2 points, the present and the battle cooperation may be 3 points, and the like. In the present embodiment, for example, five ranks are provided according to the value of the closeness of the two persons. For example, the friendship rank is 0 to 24 points, the friendship rank is 25 to 49 points, the friend rank is 50 to 74 points, the friend rank is 75 to 99 points, the partner rank is 75 to 99 points, and the friend rank is 100 points or more.

  The closeness imparting means 62 includes closeness storage means 62a. For example, as shown in FIG. 46, the familiarity storage means 62a stores the information in the familiarity value database server 2 associated with the two players in association with the fellow information ID for uniquely identifying the fellow information. Yes. The rank of intimacy may also be stored.

  As a result of the mutual exchange between two players of friends, the value of intimacy of the two people increases, so it is considered that the higher the value of intimacy, the more they want to maintain their friendship. Therefore, the higher the value of intimacy, the longer the companion period in the extension process can be set, so that an appropriate companion period according to the intimacy can be set.

  Therefore, the correcting unit 63 has a function of correcting so that the friend period (extended period) extended by the extending unit 61 becomes longer as the closeness value of the two players is higher. For example, if the length of the friend period extended when the familiarity value of two players is the acquaintance rank is n (day), the friend rank is n × 1.5, and the best friend rank is n. X2.0, nx2.5 for partner rank, and nx3.0 for ally rank.

Further, the correction means 63 sets the friend period indefinitely (that is, eliminates the friend period when the closeness value of the two players is equal to or greater than the threshold value (for example, when the friend rank reaches 100 points or more). You may do it. This is because when the intimacy value of the two players increases to a threshold value or more, it is highly likely that no player wants to cancel the friendship anymore.
Processing for correcting the extended friend period according to the value of the familiarity will be described below with reference to FIG.

  Before the friend period set for the two players ends (NO in S281), if the extension condition regarding the exchange is achieved (YES in S282), whether the intimacy value of the two players is greater than or equal to the threshold value Is determined (S311). Here, when the value of closeness is equal to or greater than the threshold value (YES in S311), the correction unit 63 sets the fellow period to indefinite (S312). If the familiarity value is less than the threshold value (NO in S311), the correcting unit 63 corrects the fellow period (extended period) extended by the extending unit 61 according to the familiarity value (S313). That is, the correction means 63 corrects the extension period to be longer as the familiarity value is higher. After S313, the extension means 61 extends the fellow period by the extension period corrected by the correction means 63 (S314). After S314, the process returns to S81, and the loop processing (S281, S282, S311 to S314) is repeated until the fellow period ends or the closeness becomes equal to or greater than the threshold value.

  In addition, when the friend period is ended (YES in S281), the friend relationship is automatically canceled by the friend relationship canceling unit 57 (S255), and the fact that the friend relationship has been canceled is in the terminal devices 3 of the two players. Notification is made (S256).

[Other Embodiments]
In particular, in the configuration in which the fellow relationships are automatically canceled as described above, the number of past fellow players of the player is likely to increase cumulatively. Therefore, a configuration will be described in which a time condition for canceling the fellowship relationship is specified so that past fellow players can be extracted and displayed.

  The fellow information storage means 54a also stores in the storage device (database server 2) time information when the friendship relationship between the two players has been released, together with past friend information associated with the two players whose friendship relationship has been released. Remember. For example, as illustrated in FIG. 11A or FIG. 11B, the fellow information storage unit 54 a stores a fellow cancellation time (such as a date when the fellow relation is canceled) in association with the fellow information ID or the past fellow information ID.

  Then, in response to a request specifying a time condition when the friendship relationship is released from the terminal device 3 operated by the player, the friend history transmitting unit 101 stores the past of the player stored in the friend information storage unit 54a. The information satisfying the above condition is read out from the fellow information, and information for displaying the past fellow player who satisfies the condition and that is the past fellow player of the player is transmitted to the terminal device 3.

  With this configuration, when the player performs an operation for requesting a past buddy list, if a time condition in which the buddy relationship is canceled is specified, for example, only a past buddy player whose buddy relationship has been released within one month is displayed. It is possible to display on the terminal device 3 or to display only past player players whose friendships have been canceled in XX month XX. In this way, if narrowed-down display can be performed according to the time conditions for canceling the friendship relationship, the operability particularly when the number of past friends increases is improved.

  Next, a configuration for reducing the storage capacity for holding the past fellow information that increases cumulatively will be described. The fellow information storage unit 54a holds past fellow information related to the two players for at least a predetermined period (for example, one year) after the fellow relation between the two players is released. Then, in response to a request from the terminal device 3 operated by the player, the fellow history transmission means 101 is configured to execute the predetermined period (after the fellow relation cancellation of the player's past fellow information stored in the fellow information storage means 54a). For example, information of past fellow players who have not passed for one year is read and transmitted to the terminal device 3.

  Thereby, the holding | maintenance period of the information of the past friendship after cancellation | release of friendship can be limited to a predetermined period (for example, one year). The player thinks that there is not so much thinking of establishing a friendship relationship with the past fellow player again after a predetermined period, for example, one year has passed since the friendship relationship with the past fellow player is canceled. It is done. Therefore, if only the past fellow players who have not passed the predetermined period after the cancellation of the fellow relation are displayed on the terminal device 3 of the player, the holding period of the past fellow information after the cancellation of the fellow relation is set to the predetermined period. It can be limited to. Thereby, the memory capacity for holding the past fellow information which increases cumulatively can be significantly reduced.

  In the above-described embodiment, the game execution program is installed on the game server 1 side, and the game server 1 performs arithmetic processing and data processing for game progression in response to input operations on the terminal device 3 of each player. The application example to the game system in which the game progresses by transmitting the screen data reflecting the execution result to the terminal device 3 has been described. This is a so-called client-server game system, but is not limited to this. For example, the game server 1 manages game information including friend information of the player and provides game services such as friend management within the game to the player. The game management device, the game management method, and the program according to the embodiment of the present invention can also be applied to a game system performed on the terminal device side of the player.

  In other words, the present invention can also be applied to a game system in which a part or all of the game execution program is downloaded or installed on the terminal device side of the player and the game execution process is also performed on the terminal device. For example, a player terminal device communicates with other player terminal devices by Internet communication, wireless LAN communication, short-range wireless communication using a predetermined frequency band (for example, 2.4 GHz frequency band), or wired LAN communication. It is also possible to execute a peer-to-peer game by connecting two to peers.

  Therefore, as the terminal device of the player, various devices that can be connected to a game server (game management device) and receive game services such as friend management can be applied. The above-described mobile phone terminal, smart phone, PHS terminal In addition to personal digital assistants (PDAs), personal computers, and tablet computers, home video game devices having a network connection function (configured by connecting a home video game machine to a home television) Game devices) and portable game-dedicated devices are also applicable.

  The computer-readable program according to the present embodiment is recorded on various computer-readable recording media such as a hard disk, an optical disk (CD-ROM, DVD-ROM, etc.), a flexible disk, a semiconductor memory, and the like. Is executed by the CPU 11 of the game server 1. The means for providing the program to the game server 1 is not limited to the recording medium described above, and can be performed via a communication network such as the Internet.

  (1) A game management device according to one aspect of the present invention is a game management device that communicates with each player's terminal device and manages a friend of a game in which the players can establish a friendship relationship. Companion information storage means for storing fellow information related to the two players and holding past fellow information related to the two players even after the fellow relation between the two players is canceled In response to a request from the terminal device operated by the player, the previous fellow information of the player stored in the fellow information storage means is read out, and the past fellow player who has been in a fellow relation with the player in the past is read out. A fellow history transmission means for transmitting information to be displayed to the terminal device, and information transmitted by the fellow history transmission means is received to display past player players of the player. When an operation to select the past fellow player is performed on the terminal device, the information on the operation is received from the terminal device, and the friendship revival from the player to the past fellow player is resumed. It is the structure provided with the fellow revival application means which performs an application process.

  The game management device having this configuration can be configured by an information processing device such as a server that can communicate with the terminal device of each player. And this game management apparatus performs the friend management of games, such as a social game etc. in which the players can build a friendship relationship, for example, a game where players can become friends and enjoy exchange.

  Here, friendship is a collective term for virtual relationships between players built in the game. Acquaintance, friend, friend, classmate, partner, relative, family, brother, sister, company or organization colleague Including various in-game relationships.

  Moreover, this game management apparatus is provided with the fellow information memory | storage means which memorize | stores the fellow information which linked | related two players who are establishing the fellow relation. This fellow information storage means holds past fellow information related to the two players even after the relation between the two fellows is cancelled.

  Moreover, this game management apparatus is provided with a fellow history transmission means. In response to a request from the terminal device operated by the player, the fellow history transmission means reads past fellow information of the player stored in the fellow information storage means, and the past has been in a fellow relation with the player. Information for displaying the fellow player is transmitted to the terminal device. In the terminal device of the player who has received the information transmitted by the fellow history transmitting means, the past fellow players of the player can be displayed. Therefore, the player can easily check his / her past friend history on the display screen of the terminal device. That is, the player can reliably and easily specify his / her past fellow player.

  When the player performs an operation for selecting a past fellow player at the terminal device displaying the past fellow player, the fellow revival application means receives the operation information, and An application process for reviving a fellowship from the player to the past fellow player is executed. That is, the player can easily apply for reviving a fellowship by checking the past fellow players displayed on the terminal device and selecting a desired partner to restore the fellowship. It can be carried out.

  Needless to say, if a partner who has received an application for reviving a friendship from a player (a past player of the player concerned) approves it, the friendship between the two will be restored.

  As described above, according to the present configuration, the player has an unprecedented novel function of displaying a past fellow player on the terminal device of the player so that an application for reviving the fellow relation can be easily made to a desired partner. Can be provided. Thereby, it is possible to provide the player with a game environment in which there is an opportunity to reconstruct a friendship relationship with a past friend player. Therefore, for example, the following (a) to (c) that could not be achieved conventionally can be performed.

  (A) When a player accidentally cancels a friendship relationship with a partner who has been a friend due to an erroneous operation or the like, an opportunity to reconstruct the friendship relationship with the same partner is obtained thereafter.

  (B) If the player needs to temporarily leave the game for some reason (for example, devoted to overseas business trips or taking an examination), the friendship with the fellow player is canceled during that time, and then the game is resumed. Occasionally, an application for reviving a fellowship is made to a past fellow player.

  (C) In a game in which an upper limit is set for the number of friends in which each player can build friendships with other players, the following becomes possible. That is, in order for a player whose number of friends has reached the upper limit to become a friend with another new player Y, the relationship with the friend player X is once released. After that, in the case where the exchange as expected with the player Y is not possible, the relationship with the player Y is canceled, and the player X is requested to revive the friendship. In this way, it is possible to enjoy a new game that effectively uses a limited companion frame.

  (2) In the above configuration, when one of two players who are in a friendship relationship voluntarily cancels the friendship relationship, the friend information storage unit voluntarily cancels the friendship relationship among the two players. And the player who has voluntarily released the friendship from the other party, and the friend history transmitting means responds to a request from the terminal device operated by the player, Of the past fellow information of the player stored in the fellow information storage means, information when the player voluntarily releases the fellow relation is read, and the past fellow whose voluntary relation is voluntarily released by the player Information for displaying the player is preferably transmitted to the terminal device.

  According to this configuration, when the fellow information storage means stores the past fellow information relating the two players, the side that voluntarily canceled the fellow relation and the side that has been canceled are stored separately. . Then, in response to a request from the terminal device operated by the player, the fellow history transmission means transmits information for displaying the past fellow player, who has voluntarily canceled the fellow relation, to the terminal device. Therefore, in the terminal device of the player who has received the information transmitted by the fellow history transmission means, only the past fellow players whose fellow relations have been released by the player are displayed, and the fellow relations are released from the partner. The other party's information can be prevented from being displayed.

  With this configuration, the player who has been released from the friendship relationship does not apply to the player who has canceled the friendship. Thereby, it is possible to effectively avoid a situation in which the player who voluntarily cancels the friendship relationship receives an application for reviving the friendship relationship in an undesired form from the friend player who has canceled the break at a later date.

  In addition, it is considered that the player on the side whose friendship has been canceled by the opponent often does not want to apply for a resurrection to the opponent who has released himself. Therefore, the effect that it becomes easy for a player to find a desired other party by displaying a past fellow player in a state where the other party who has released himself / herself is omitted can be expected.

  (3) In the configuration of (1) or (2) above, the game management device at least approves a friendship relationship between two players, a player who has applied for a friend and a player who has approved the application. It is preferable that the apparatus further includes friend formation point giving means for giving a friend formation point to the player on the playing side. And the said friend formation point grant means is the said friend relations point given to the said fellow player who approved the friend application by the application process of the said friend relation revival which the said friend revival application means performed. It is preferable to make it higher than the above-mentioned friend formation point given to a player who has approved a normal friend application not based on the application process for resurrection.

  According to this configuration, when a friendship relationship is established between the player on the friend application side and the player on the approval side, the friend formation point giving means gives a friend formation point to at least the player on the approval side. This includes a form in which a friend formation point is given to both the player on the friend application side and the approval side, and a form in which a friend formation point is given only to the player on the approval side.

  And the friend formation point grant means is higher than the point to be given to the player who has approved the normal friend application, the point to be given to the past friend player who has approved the friend application by the application process of the friend relationship revival. To do. Thereby, the approval of the player who has received the application for reviving the friendship relationship is promoted, and the friendship relationship is easily revived, whereby the effectiveness of the function of reviving the friendship relationship can be enhanced.

  (4) In the configuration of (3) above, the game management device approves the fellow application by the fellow revival application process executed by the fellow revival application means by the past fellow players of the player, and the two players When the friendship is revived between the two players, the resurrection time storage means for storing information on the resurrection time of the friendship relationship between the two players, and the resurrection of the two players stored in the resurrection time storage means It is preferable to further include a re-resurrection limiting unit that does not permit the re-restoration of the friendship between the two players until a predetermined period of time elapses.

  As mentioned above, if the person who approves the application for reviving the friendship can get more points than approving the normal friendship application, the friendship can be resolved only with the aim of earning points with each other. There is a possibility that an inappropriate situation will occur in which the resurrection is repeated in a short period of time. In this configuration, in order to avoid such a situation, the revival time storage means stores the revival time when the friendship is revival between the players, and the re-resurrection limiting means passes a predetermined period from the revival time. Until then, it is configured not to allow the revival of the fellowship again.

  Here, the resurrection time storage means stores time information such as year, month, day, hour, minute, second as “resurrection time”, but the unit of the time to be stored here can be arbitrarily set. In addition, an arbitrary period can be set as the “predetermined period”, which is a period during which re-revival is prohibited after the friendship is revived. For example, the predetermined period may be a certain period (for example, three months), or the predetermined period may be varied according to the number of revivals of the friendship (the longer the number of revivals, the longer the predetermined period is set). Good.

  With this configuration, even if the two players plan an inappropriate point aim by repeating the cancellation and revival of the friendship, a predetermined period (for example, three months) will be provided after the friendship is once restored. It will not be possible to revive again until it has passed. Therefore, it is possible to effectively suppress an inappropriate player's action of repeatedly canceling and reviving the friendship in a short period aiming only at the point acquisition between the friends.

  (5) In the configuration of (3) above, the game management device approves the fellow application by the fellow revival application process executed by the fellow revival application means by the past fellow players of the player, and the two players It is preferable that a recovery time storage unit is further provided for storing information on the recovery time of the friendship between the two players when the friendship is restored between the two players. The fellow history transmission means may cancel the fellow relation between the two players again until a predetermined period elapses from the resurrection time of the two players stored in the resurrection time storage means. Even so, information to be transmitted when information for displaying a past fellow player is transmitted to the terminal device in response to a request from the terminal device operated by one of the two players. It is preferable not to include the information of the other player in.

  According to this configuration, the resurrection time storage means stores the resurrection time when the friendship relationship is resurrected between the two players, and until the friend history transmission means passes a predetermined period from the resurrection time, It is configured not to include the information of the other player in the information for displaying the past fellow player transmitted to one terminal device of the two players. As a result, even if the two players plan to improperly aim for the point by repeating the cancellation and revival of the friendship, a predetermined period (for example, three months) elapses after the friendship is once restored. Until then, the players of each other are not displayed on the terminal device as past friend players, so that it is not possible to apply for reinstatement of friendships. Therefore, it is possible to effectively suppress an inappropriate player's action of repeatedly canceling and reviving the friendship in a short period aiming only at the point acquisition between the friends.

  (6) In the configuration of (1) above, the game management device sets a fellow period setting means for setting a fellow period in which the fellow relation between the players is continued for two players in which the fellow relation is established. And a friendship canceling means for automatically canceling the friendship between the two players at the end of the friendship period set for the two players with whom the friendship is established. Preferably it is.

  According to this configuration, as will be described below, it is possible to provide the player with an environment in which it is easy to build a favorite group of friends. That is, a relatively high level player tends to desire to be a friend with another player at the same level as or higher than himself. However, when a player receives a friend application from another player at a lower level than himself / herself, it may be difficult to refuse the application without permission, and in some cases, the player approves the application and becomes a friend. However, for a high level player, if there are many friends at a lower level than himself / herself, an unfair feeling may occur with respect to the cooperative battle in the game. The reason is that a high-level player has a large contribution in a cooperative battle or the like with respect to other players, but cannot receive a similar contribution from a low-level player.

  Specifically, in a social game, when a player battles with another player, he / she can ask for cooperation from his / her friends (sometimes referred to as cooperative battle). And the higher the level of peers seeking cooperation, the more advantageous the battle. Conversely, if the level of the fellow is low, the degree of advantage will be low. Therefore, in general, a player with a high level is often asked for cooperation from a player with a low level, and there are many cases where the player contributes to other players. On the other hand, there is no player with a higher level than himself / herself. Will be dissatisfied that they cannot enjoy the same benefits.

  For this reason, if possible, a high-level player may have a desire to cancel a friendship with a lower-level player at a lower level than himself and to make a group structure of his / her favorite friends. Moreover, even if it is a fellow player of a lower level than a player, it is sufficient if it is a fellow player who can interact happily in the game. For fellow players of level, the player often wants to cancel the friendship. However, in order to do so, it is necessary to cut off the relationship between the player and other players (friends at a lower level than himself), but many players think that it is difficult to perform psychologically.

  Therefore, the game management device includes fellow period setting means for setting a fellow period in which the fellow relation between the players is continued for the two players in which the fellow relation is established. Here, the length of the fellow period set by the fellow period setting means can be set to an arbitrary period length such as one week, ten days, two weeks, or one month. Also, the length of the fellow period may be fixed, for example, the period length may be randomly changed at the time of setting, or an appropriate period length may be determined according to the level relationship between players. Also good.

  Moreover, the timing at which the fellow period setting means sets the fellow period can be arbitrarily determined. For example, the setting period of the fellow period may be when the fellow relation is established, may be after a certain period (for example, one week) has elapsed since the fellow relation is established, or for example, between two players It may be when a state in which alternating current is not performed for a predetermined period occurs.

  Then, the friendship cancellation means automatically cancels the friendship between the two players at the end of the friendship period set for the two players with whom the friendship is established. . Therefore, the player can cancel the friendship relationship by the end of the friendship period without performing a friend canceling operation that is difficult to perform psychologically. Therefore, for example, for a low-level friend who cannot enjoy the game together with little interaction after becoming a friend, the player cuts off the friendship at the end of the friendship period, and renews his / her preference. You can find the right friends. Then, if the player wants to continue the fellowship, the above-mentioned fellowship revival may be applied to the same partner again after the fellowship period.

  Thus, it is considered that the player does not make an application for reviving a friendship relationship with a lower-level friend who cannot enjoy the game together at the end of the friendship period. On the other hand, an opponent that the player desires (for example, a player who is a higher level player or a player who can enjoy a game together even by a lower level through exchanges, etc.) It is possible to apply. Therefore, this configuration makes it possible to configure a fellow group that the player prefers while repeating the fellow period setting by the establishment of the fellow relation, the automatic cancellation of the fellow relation at the end of the fellow period, and the application for the revival of the fellow relation as necessary. A converged environment is prepared.

  As in this configuration, when the friendship relationship is automatically canceled by the end of the friendship period set for the two players instead of intentional release by the players, the friendship relationship is restored as much as the friendship relationship is released. Since there are also many opportunities to think about it, the configuration of (1) above, which allows a friend revival application to be easily performed with a simple operation, is preferable.

  (7) A game management method according to another aspect of the present invention is a game management method in a game management device that communicates with the terminal devices of each player and manages the friends of a game that allows the players to build a friendship. In addition, the game management device stores friend information relating the two players who have established the friendship relationship, and also associates the two players even after the friendship relationship between the two players is cancelled. The fellow information storage step for holding the past fellow information, and the player's past fellow information stored in the fellow information storage step in response to a request from the terminal device operated by the player by the game management device. A friend history transmission step for transmitting information to the terminal device to display past friend players who have been in a friendship relationship with the player in the past; When an operation for selecting the past fellow player is performed on the terminal device that receives the information transmitted by the fellow history transmission step and displays the past fellow player of the player, the game management device However, it is a structure provided with the fellow revival application step which receives the information of the said operation from the said terminal device, and performs the application process of the fellow relation revival from the said player to the said past fellow player.

  (8) A program according to yet another aspect of the present invention is a program for causing a computer to operate as the game management device having any one of the above-described configurations (1) to (6). It is a program for making it function as each means with which a management device is provided.

1 Game server (game management device)
2 Database server (game management device)
3 Terminal device 4 Network 11 CPU
12 ROM
13 RAM
14 Auxiliary storage device 51 Game information management means 51b Level information storage means (game level storage means)
52 game progress means 54 fellow management means 54a fellow information storage means 55 exchange means 55e battle cooperation means 55f exchange history storage means 56 fellow period setting means 56a fellow period storage means 57 fellow relation release means 58 fellow period notification means 101 fellow history transmission means 102 fellow recovery application means 103 fellow establishment point grant means 104 recovery time storage means 105 re-resurrection restriction means

(4) In the configuration of (2) or (3 ) above, the game management device at least approves a friendship relationship between two players, a player who has applied for a friend and a player who has approved the application. It is preferable that the apparatus further includes friend formation point giving means for giving a friend formation point to the player on the playing side. And the said friend formation point grant means is the said friend relations point given to the said fellow player who approved the friend application by the application process of the said friend relation revival which the said friend revival application means performed. It is preferable to make it higher than the above-mentioned friend formation point given to a player who has approved a normal friend application not based on the application process for resurrection.

(9) A game management method according to still another aspect of the present invention is a game management method in a game management apparatus that communicates with each player's terminal device and manages a friend of a game in which the players can establish a friendship. The game management device stores a fellow information storage step for holding past fellow information related to the two players even after the fellow relation between the two players in which the fellow relation is established is canceled. the game management device, in response to a request from the terminal device operated by a player, of the past fellow information of the player of the being the result stored buddy information storage step, past fellow corresponds to a predetermined condition From the friend history transmission step of transmitting information to the terminal device and the previous friend information transmitted by the friend history transmission step, the terminal device In the past fellow player selected by the operation of the definitive player, the game management device, and fellow revival application step for executing application processing in peer relations resurrection, it is configured to include.

Claims (10)

A game management device that communicates with a terminal device of each player and manages a friend of a game in which the players can establish a friendship relationship.
A fellow information storage means for holding past fellow information related to the two players even after the fellow relation between the two players being established is cancelled,
In response to a request from the terminal device operated by the player, past fellow information corresponding to a predetermined condition is transmitted to the terminal apparatus among the past fellow information of the player stored in the fellow information storage means. Buddy history sending means,
A fellow revival application means for executing a fellow relation revival application process for a past fellow player selected by an operation of the player in the terminal device from the past fellow information transmitted from the fellow history transmission means. A game management device provided.   The game management device according to claim 1, wherein the predetermined condition is a time condition in which the friendship is released. When one of two players who are in a friendship relationship voluntarily cancels the friendship relationship, the friend information storage means includes a player who voluntarily releases the friendship relationship among the two players, and a partner It is distinct and memorized from the player who has voluntarily released the friendship,
In response to a request from the terminal device operated by the player, the fellow history transmission means voluntarily releases the fellow relation among the past fellow information of the player stored in the fellow information storage means. 3. The game management device according to claim 1, wherein the game management device reads information on the case, and transmits information for displaying a past fellow player whose voluntary relationship has been canceled by the player to the terminal device. When a friendship relationship is established between two players, a player who has applied for a friend and a player who has approved the application, it is further provided with a member-established point giving means for giving a friend-established point to at least the approved player. ,
The fellow establishment point granting unit is configured to provide the fellow establishment point to be given to the past fellow player who has approved the fellow application by the fellow relation restoration application process executed by the fellow restoration application unit. The game management device according to any one of claims 1 to 3, wherein the game management device is set higher than the friend establishment point to be given to a player who has approved a normal friend application not based on the application process. In the case where the previous friend player of the player approves the fellowship application by the fellowship revival application process executed by the fellow revival application means and the fellowship is restored between the two players, the two players' Revival time storage means for memorizing information on revival times of fellowships,
Re-resurrection limiting means that does not permit re-resurrection of the friendship between the two players until a predetermined period has elapsed from the resurrection time of the two players stored in the resurrection time storage means; The game management device according to claim 4, further comprising: In the case where the previous friend player of the player approves the fellowship application by the fellowship revival application process executed by the fellow revival application means and the fellowship is restored between the two players, the two players' It is further provided with a revival time storage means for storing information on the revival time of fellow relationships,
The fellow history transmission means is a case where the fellow relation between the two players is released again until a predetermined period has elapsed from the resurrection time of the two players stored in the resurrection time storage means. However, among the information to be transmitted when information for displaying a past fellow player is transmitted to the terminal device in response to a request from the terminal device operated by one of the two players. The game management device according to claim 4, wherein information on the other player is not included in the game management information. A fellow period setting means for setting a fellow period in which the fellow relation between the players is continued for two players in which the fellow relation is established;
The fellow relation cancellation | release means which cancels | releases the fellow relation of the said two players automatically by the completion | finish of the said fellow period set with respect to two players with which the fellow relation is materialized is further provided. The game management device described in 1. A terminal device of each user receiving the game service;
A game management device that communicates with the terminal device, and that manages a friend of a game that allows each player to build a friendship with another user,
A fellow information storage means for holding past fellow information related to the two players even after the fellow relation between the two players being established is cancelled,
In response to a request from the terminal device operated by the player, past fellow information corresponding to a predetermined condition is transmitted to the terminal apparatus among the past fellow information of the player stored in the fellow information storage means. Buddy history transmission means,
A fellow revival application means for executing a fellowship revival application process for a past fellow player selected by an operation of a player in the terminal device from the past fellow information transmitted from the fellow history transmission means;
A game system in which either one of the game management device and the terminal device is provided with each means. A game management method in a game management device that communicates with a terminal device of each player and manages a friend of a game that allows the players to build a friendship relationship.
A friend information storage step for holding past friend information related to the two players even after the game manager has canceled the friendship relationship between the two players who have established the friendship relationship;
In response to a request from the terminal device operated by the player, the game management device stores past fellow information corresponding to a predetermined condition among the past fellow information of the player stored in the fellow information storage step. Buddy history transmission step for transmitting to the terminal device;
The game management device executes an application process for reviving a fellow relationship to a past fellow player selected by the player's operation in the terminal device from the past fellow information transmitted in the fellow history transmission step. A game management method comprising a fellow revival application step. A program for causing a computer to operate as the game management device according to any one of claims 1 to 7, wherein the program causes the computer to function as each unit included in the game management device.

Images