JP7405621B2 - Game systems, server systems and programs - Google Patents

Description

The present invention relates to a game system, a server system, a program, etc.

Various game systems that utilize friend lists have been known. Conventional techniques for such game systems include, for example, the techniques disclosed in Patent Documents 1 and 2. For example, in Patent Document 1, a smartphone and a game console store a friend list used in an application. In other words, a friend list is shared between the smartphone and the game console. When a certain player is registered as a friend on the smartphone, the player is also registered as a friend on the game machine. This makes it possible to encourage a player who uses one of the smartphone application and the game console application to use the other application.

International Publication No. 2017/72857 Japanese Patent Application Publication No. 2014-195701

A related player list (friend list), which is a list of related players such as friend players, is created for each game played by a player. Therefore, at the time when the player starts the game, no related players related to the player are registered in the related player list. Therefore, the player has to start the game in a state where there are no related players such as friend players, which impairs the player's convenience.

According to some aspects of the present embodiment, it is possible to provide a game system, a server system, a program, etc. that can appropriately present related players to the player and improve the player's convenience.

One aspect of the present disclosure includes, for each game of a plurality of games played by a player, a related player list storage unit that stores a related player list in which related players of the player in each game are associated; a common related player list storage unit that stores a common related player list in which related players of each player and game play history information of the related players are associated with each other; a processing unit that performs processing on the related player list, and the processing unit is configured to update the common related player list when the player performs an operation on a terminal device to update the play history information of the common related player list. Update processing is performed on the update target portion of the list, processing is performed to refer to the play history information of related players associated with the player in the common related player list, and based on the reference result, the player of the terminal device is The present invention relates to a game system that performs display processing for the related player list, or list processing that is processing for the related player list. Further, one aspect of the present disclosure relates to a program that causes a computer to function as each of the above units, or a computer-readable information storage medium that stores the program.

According to one aspect of the present disclosure, when a player performs an operation to update play history information in a common related player list, an update process is performed on an update target location in the common related player list. This allows the common related player list to be maintained in an appropriate state. Further, a process of referring to the play history information of related players in the common related player list is performed, and based on the reference result, display processing for the player or list processing that is processing for the related player list is performed. By using the reference results of the common related player list in this way, it becomes possible to perform appropriate display processing regarding related players and appropriate list processing regarding the related player list. Therefore, it is possible to provide a game system or the like that can appropriately present related players to the player and improve the player's convenience.

Further, in one aspect of the present disclosure, the processing unit may perform the display process of displaying related player candidates of the player to the player based on the reference result.

In this way, it becomes possible to inform the player of players with whom the player has played in the past as related player candidates, thereby improving convenience for the player.

In one aspect of the present disclosure, the processing unit may perform, as the list processing, a process of creating a new related player list or a process of sorting the related player list based on the reference result. good.

This way, you can create a related player list that includes players the player has played with in the past, display it to the player, and sort it so that the players the player has played with in the past are in the appropriate sort position. processing can be realized.

Further, in one aspect of the present disclosure, when the player performs an operation to start a new game as the operation, the processing unit may cause a related player who has already played the new game to play the new game. You may perform a process of granting benefits in .

In this way, it becomes possible to give a benefit to a related player who has become related to the player based on the reference process of the common related player list as a reward for having become related.

Further, in one aspect of the present disclosure, when the player performs an operation to start a new game as the operation, the processing unit controls one of the related players who are already playing in the new game and the player. A process may be performed in which the player is permitted to perform a predetermined action against the other player in the new game.

In this way, when a player and a related player become related based on the reference process of the common related player list, one of the player and the related player can perform a predetermined action on the other player. It becomes like this.

Further, in one aspect of the present disclosure, the common related player list storage unit stores, for each player, related players of each player, the play history information of the related players, and relationship information of each player and the related players. The commonly associated player list may be stored.

In this way, by referring to the common related player list, it becomes possible to obtain not only the play history information of the related players but also the relationship information between each player and the related players.

Further, in one aspect of the present disclosure, the relationship information may include information about elapsed relationship time between each player and related players, information about cooperative play time between each player and related players, or information about a game between each player and related players. It may also be information about access times.

In this way, by referring to the common related player list, it is possible to obtain not only play history information of related players, but also information about elapsed relationship time, cooperative play time, and access time between each player and related players. become.

Further, in one aspect of the present disclosure, the processing unit may perform the display processing or the list processing based on the relevance information.

In this way, display processing and list processing that reflect the relationship between the player and related players can be realized.

Further, in one aspect of the present disclosure, the processing unit performs the display process of displaying overlap number information of related games to the player when the player and related players are related in a plurality of games. You may go.

In this way, the player can easily visually recognize how many games the player and related players have played together in the past by looking at the overlap information. This improves player convenience.

Further, in one aspect of the present disclosure, the processing unit determines the degree of intimacy between the player and related players based on the relationship information, and performs the display process or the list process based on the degree of intimacy. It's okay.

In this way, display processing and list processing that reflect the degree of intimacy between the player and related players can be realized.

Further, in one aspect of the present disclosure, the related player may be a friend player, the related player list may be a friend list, and the common related player list may be a common friend list.

In this way, it becomes possible to provide a game system or the like that can improve the player's convenience by appropriately presenting the player's friend players.

Further, one aspect of the present disclosure includes a related player list storage unit that stores, for each entertainment content of a plurality of entertainment contents played by a player, a related player list in which related players of the player in each entertainment content are associated. A common related player list storage unit that stores, for each of the plurality of players, a common related player list in which related players of each player and play history information of entertainment content of the related players are associated; a processing unit that performs processing on the common related player list, and the processing unit is configured to perform processing on the common related player list when the player performs an operation on the terminal device to update the play history information of the common related player list. Update processing is performed on the update target portion of the common related player list, processing is performed to refer to the play history information of related players associated with the player in the common related player list, and based on the reference result, the terminal The present invention relates to a server system that performs display processing for the player of the device or list processing that is processing for the related player list. Further, one aspect of the present disclosure relates to a program that causes a computer to function as each of the above units, or a computer-readable information storage medium that stores the program.

According to one aspect of the present disclosure, when a player performs an operation to update play history information in a common related player list, an update process is performed on an update target location in the common related player list. This allows the common related player list to be maintained in an appropriate state. Further, a process of referring to the play history information of related players in the common related player list is performed, and based on the reference result, display processing for the player or list processing that is processing for the related player list is performed. By using the reference results of the common related player list in this way, it becomes possible to perform appropriate display processing regarding related players and appropriate list processing regarding the related player list. Therefore, it is possible to provide a server system or the like that can appropriately present related players to the player and improve the player's convenience.

FIGS. 1A to 1F are explanatory diagrams of hardware devices that realize the game system of this embodiment. A configuration example of a game system according to the present embodiment. An explanatory diagram of the method of this embodiment using a common friend list. The figure which shows the example of player information. An explanatory diagram of a method of displaying friend candidates based on a reference result of a common friend list. FIG. 3 is an explanatory diagram of a method of creating a friend list based on a reference result of a common friend list. An explanatory diagram of a method of sorting a friend list based on a reference result of a common friend list. 5 is a flowchart illustrating the processing of this embodiment. Flowchart illustrating processing for granting benefits in a new game. 7 is a flowchart illustrating a process for permitting a predetermined action in a new game. An explanatory diagram of a method of providing benefits in a new game. An explanatory diagram of a method of permitting a predetermined action in a new game. The figure which shows the example of the relationship information of a player and a friend player. 5 is a flowchart illustrating processing of this embodiment using relevance information. An explanatory diagram of a method for displaying the number of game duplicates and friend ranks. 7 is a flowchart illustrating processing of the present embodiment using intimacy determined based on relevance information.

This embodiment will be described below. Note that this embodiment described below does not unduly limit the contents described in the claims. Furthermore, not all of the configurations described in this embodiment are essential configuration requirements.

1. Game System First, a hardware device that implements the game system of this embodiment will be explained using FIGS. 1(A) to 1(F).

In FIG. 1A, a server system 500 (information processing system) is communicatively connected to terminal devices TM1 to TMn via a network 510. For example, the server system 500 is a host, and the terminal devices TM1 to TMn are clients. Note that the game system of this embodiment and its processing may be realized by the server system 500, or may be realized by distributed processing between the server system 500 and the terminal devices TM1 to TMn.

Furthermore, the game system and processing of this embodiment can also be realized using a blockchain technique. For example, each process of the game system of this embodiment may be executed using a program called a smart contract that can be executed on Ethereum. In this case, the terminal devices TM1 to TMn will be connected peer-to-peer. Furthermore, various information such as game information communicated between the terminal devices TM1 to TMn will be transferred using the blockchain. Note that, hereinafter, each of the terminal devices TM1 to TMn will be referred to as a terminal device TM as appropriate.

The server system 500 can be realized by, for example, one or more servers (a management server, a game server, a billing server, a service providing server, a content distribution server, an authentication server, a database server, a communication server, etc.). This server system 500 provides various services for operating community-type websites and online games, and can manage data necessary for game execution and distribute client programs and various data. As a result, for example, a terminal device TM that is a user terminal accesses the server system 500 in order to use SNS (Social Networking Service), etc., and a social game or a home game that is an online game provided from the server system 500 is accessed. It becomes possible to play network games such as

The network 510 (distribution network, communication line) is a communication path using, for example, the Internet or wireless LAN, and includes a dedicated line (dedicated cable) for direct connection, LAN using Ethernet (registered trademark), and telephone communication. It can include communication networks such as networks, cable networks, and wireless LANs. Also, the communication method may be wired or wireless.

The terminal device TM (player terminal) is, for example, a terminal having a net connection function (Internet connection function). These terminal devices TM include, for example, a home game device (stationary type) shown in FIG. 1(B), a portable communication terminal such as a smartphone or a mobile phone shown in FIG. 1(C), and a portable communication terminal such as a smartphone or mobile phone shown in FIG. 1(D). Various devices can be used, such as a portable game device, a commercial game device shown in FIG. 1(E), or an information processing device such as a personal computer (PC) or tablet PC shown in FIG. 1(F). Alternatively, a wearable device (HMD, watch-type device, etc.) that is worn on the player's head, arm, or other area may be used as the terminal device TM.

FIG. 2 shows an example of the configuration of the game system of this embodiment. Note that the configuration of the game system is not limited to that shown in FIG. 2, and various modifications such as omitting some of its components (each part) or adding other components are possible. Furthermore, the game realized by the game system of this embodiment may be a multi-play game or a single-play game. There is also no particular limitation on the genre of the game, and the present invention can be applied to various games such as RPG (role playing game), action game, fighting game, shooting game, competitive game, rhythm game (music game), or puzzle game. Further, in the case of a competitive game, it may be a one-on-one competition or a many-on-many competition. Alternatively, it may be a one-on-many battle (one person against multiple enemies) or a many-on-one battle (multiple allies vs. multiple enemies). Further, the opponent may be another player or an NPC (Non Player Character). For example, it may be a game in which a plurality of players form a party, cooperate, and compete against NPC enemies. Alternatively, AI (Artificial Intelligence) may operate the player's character without the player operating the character. All or some of the player's characters may be operated by the AI.

The game system includes a processing section 100, a related player list storage section 170, and a common related player list storage section 172. The game system can also include a player information storage section 174. This game system can be realized, for example, by the server system 500 in FIG. 1(A), and is communicatively connected to the terminal devices TM1 to TMn via a network 510.

The processing unit 100 (processor) performs processing based on various information, programs, operation information, etc. stored in storage units such as the related player list storage unit 170, the common related player list storage unit 172, and the player information storage unit 174. Performs game processing, management processing, list processing, storage management processing, communication processing, display processing, sound processing, etc.

Each process (each function) of this embodiment performed by each part of the processing unit 100 can be realized by a processor (a processor including hardware). For example, each process of this embodiment can be realized by a processor that operates based on information such as a program, and a memory that stores information such as a program. For example, the functions of each part of the processor may be realized by separate hardware, or the functions of each part may be realized by integrated hardware. For example, a processor includes hardware, and the hardware can include at least one of a circuit that processes a digital signal and a circuit that processes an analog signal. For example, a processor can be configured with one or more circuit devices (eg, an IC) mounted on a circuit board, or one or more circuit elements (eg, a resistor, a capacitor, etc.). The processor may be, for example, a CPU (Central Processing Unit). However, the processor is not limited to a CPU, and various processors such as a GPU (Graphics Processing Unit) or a DSP (Digital Signal Processor) can be used. Further, the processor may be a hardware circuit based on an ASIC. The processor may also include an amplifier circuit, a filter circuit, etc. that process analog signals. The memory (storage unit) may be a semiconductor memory such as SRAM or DRAM, or may be a register. Alternatively, it may be a magnetic storage device such as a hard disk drive (HDD), or an optical storage device such as an optical disk device. For example, the memory stores computer-readable instructions, and when the instructions are executed by the processor, the processing (functions) of each section of the processing section 100 is realized. The instructions here may be an instruction set that constitutes a program, or instructions that instruct a hardware circuit of a processor to operate.

The processing section 100 includes a game processing section 102, a management section 104, a list processing section 106, storage management sections 108 and 110, a communication section 112, a display processing section 120, and a sound processing section 130. Note that the configuration of the processing unit 100 is not limited to this, and various modifications such as omitting some of these components or adding other components are possible.

The game processing unit 102 performs various game processing for the player to play the game. The game processing includes, for example, processing to start the game when game start conditions are met, processing to progress the started game, processing to end the game when game end conditions are met, or calculation of game results. processing, etc. The game processing unit 102 can be realized by, for example, a game server. Specifically, for example, the game processing section 102, list processing section 106, display processing section 120, and sound processing section 130 can be realized by a game server.

Taking a browser game as an example, the game processing unit 102 controls the progress of the game for each player by managing various information about each player. Player information is stored in player information storage section 174. For example, the game processing unit 102 causes a terminal device to display a web page that constitutes a website that provides a game service in response to a request from the terminal device. Specifically, a web page is displayed by a web browser included in the terminal device. When the hyperlink of the displayed web page is selected by the player, the game processing unit 102 transmits new HTML data corresponding to the hyperlink to the terminal device, and the terminal device displays the web page based on the new HTML data. Is displayed. In this way, the game processing unit 102 sequentially provides web pages to the terminal device according to the player's operation, thereby making it possible to advance the game based on the player's operation on the terminal device.

The management unit 104 performs, for example, player authentication processing. For example, an authentication process is performed for a player who has logged in using a terminal device. This authentication process is performed based on, for example, a password or account information input by the player. The management unit 104 also performs various billing processes. For example, it performs billing determination processing, billing data creation processing, storage processing, etc. The management unit 104 also performs various management processes. For example, it performs management processing for various services and management processing for various information. The management unit 104 can be realized by, for example, a management server.

For example, a player performs a predetermined procedure to obtain an account in order to use a service provided by the server system 500 or the like in FIG. 1(A). By logging in by entering the password associated with the acquired account, players can play network games such as social games, use services on game sites, shop online for items, and send messages between players. You will be able to use various services such as exchanging and registering friend players. The management unit 104 also performs management processing of such player account information.

The list processing unit 106 performs various processes on the related player list and the common related player list.

The storage management unit 108 performs various processes on the related player list storage unit 170. For example, the storage management unit 108 performs storage management processing such as writing information to the related player list storage unit 170 and reading information from the related player list storage unit 170. That is, various processes are performed on the database of the related player list storage section 170. The storage management unit 108 can be realized by a database server for the related player list storage unit 170.

The storage management unit 110 performs various processes on the common related player list storage unit 172. For example, the storage management unit 110 performs storage management processing such as writing information to the common related player list storage unit 172 and reading information from the common related player list storage unit 172. That is, various processes are performed on the database of the common related player list storage section 172. The storage management section 110 can be realized by a database server for the common related player list storage section 172.

The communication unit 112 communicates with an external device, and its functions can be realized by hardware such as a communication ASIC or a communication processor, or communication firmware. For example, the communication unit 112, which is a communication interface, performs various communication processes for communicating with the terminal devices TM (TM1 to TMn) via the network 510.

The display processing unit 120 performs processing for displaying an image on the display unit of the terminal device TM. For example, image generation data (HTML data, etc.) for generating the image is generated. The display section of the terminal device TM can be realized by, for example, an LCD, an organic EL display, a CRT, or an HMD.

The sound processing unit 130 performs processing for outputting sound from the sound output unit of the terminal device TM. For example, sound generation data for generating the sound (voice, game sound, sound effect) is generated. The sound output section of the terminal device TM can be realized by a speaker, headphones, or the like.

The terminal device TM also has an operation section. The operation section is for the player, who is the user, to input various information such as operation information, and its functions include operation buttons, direction keys, analog sticks, levers, various sensors (angular velocity sensor, acceleration sensor, etc.). etc.), a microphone, or a touch panel display. When a touch panel type display is used, a touch panel serving as an operation unit and a display unit serving as a display are provided integrally.

The related player list storage section 170 stores a related player list, and the common related player list storage section 172 stores a common related player list. Details of each of these storage units will be described later.

The player information storage unit 174 stores various information about the player. For example, the player information storage unit 174 stores personal information (name, gender, date of birth, email address, etc.) of a player who is a user as player information. For example, player account information (player ID, user ID) is also stored as player information. For example, billing information that is subject to billing processing is associated with each account information of each player.

Note that the related player list storage section 170, the common related player list storage section 172, and the player information storage section 174 can be realized by, for example, a semiconductor memory, an HDD, an SSD, an optical disc device, or the like. These storage units are, for example, databases used in server systems.

Further, the game system in FIG. 2 performs each process of this embodiment based on the program of this embodiment. This program is a program (a program for causing the computer to execute the processing of each part) for making a computer (a device including an operation part, a processing part, a storage part, and an output part) function as each part of this embodiment. This program is stored, for example, in an information storage medium. That is, the game system of this embodiment performs various processes of this embodiment based on the program (data) stored in the information storage medium. An information storage medium, which is a computer-readable medium, stores programs, data, etc., and its functions can be realized by optical discs, HDDs, semiconductor memories, and the like. Note that the program (data) for making a computer function as each part of this embodiment may be distributed via a network from an information storage medium included in a server system (host device). The use of information storage media by such server systems can also be included within the scope of this embodiment.

As shown in FIG. 2, the game system (server system) of this embodiment includes a related player list storage section 170, a common related player list storage section 172, and a processing section 100. Further, the program of this embodiment causes the computer to function as the related player list storage section 170, the common related player list storage section 172, and the processing section 100.

The related player list storage unit 170 stores a related player list (first related player list). The related player list is a list in which related players of the player in each game are associated with each of the plurality of games played by the player. For example, in the related player list, related players of a player in each game are registered in a list.

The related player is a player who is related to the player in, for example, a game that the player has played in the past, and is, for example, a player who has a specific relationship with the player. The related players are, for example, friend players, and the related player list is, for example, a friend list. However, the related player does not need to be a friend player who has authenticated and registered the player as a friend player in the game; for example, it is sufficient to be a player who played the game together with the player.

The common related player list storage unit 172 stores a common related player list (second related player list). The common related player list is a list in which related players of each player and game play history information of the related players are associated with each of the plurality of players. For example, in the common related player list, related players of each player and play history information of the related players are registered as a list.

As described above, the related players are, for example, friend players, and the common related player list is, for example, a common friend list. The play history information is a history of games played by related players. For example, play history information describes the history of games played by the player in the past.

For example, the related player list is a list for each player. For example, each related player list is prepared for each terminal device of each player. For example, the storage management unit 108 manages each associated player list for each player (each terminal device). Each associated player list can be transferred to each terminal device via the network 510, for example, and stored in each terminal device.

On the other hand, the common related player list is a list commonly used by a plurality of players. For example, a related player list for all the plurality of players is stored in the common related player list storage unit 172 as a common related player list. That is, the related players of each of the plurality of players and the play history information of the related players are associated with each other and stored in the common related player list storage section 172 as a common related player list.

For example, the related player list is prepared by a first manufacturer that provides a game (entertainment content in a broad sense) application. For example, a game server that implements the game processing unit 102 and the like is operated by this first manufacturer. Further, the database server of the storage management unit 108 is also operated by, for example, the first manufacturer.

On the other hand, the common related player list is prepared by a second manufacturer that provides the system and hardware of the game device (entertainment device). For example, the database server of the storage management unit 110 is operated by a second manufacturer. For example, assume that the game devices provided by the second manufacturer include multiple generations of game devices such as first generation, second generation, third generation, and so on. In this case, the common related player list can store play history information on games of these multiple generations of game devices. Therefore, the play history information of players related to the player includes the play history of games of these multiple generations of game devices. Note that the related player list storage section 170 and the common related player list storage section 172 may be provided as a storage section of the terminal device.

In this embodiment, the processing unit 100 processes the related player list and the common related player list. Specifically, when the player performs an operation on the terminal device to update the play history information of the common related player list, the processing unit 100 performs an update process on the update target portion of the common related player list.

The operation to update the play history information is an operation that requires updating the play history information of the common related player list, and is, for example, an operation by the player to start a new game. For example, when a player performs an operation to start a new game, the play history of the new game (history indicating that the new game has been played) is added to the play history information related to that player in the common related player list. It is necessary to update the play history information. Note that the operation for updating the play history information is not limited to such an operation for starting a new game, and may be, for example, an operation that requires deletion of the play history of a specific game from the play history information. For example, when a player performs an operation to delete the play history of the game, such as by withdrawing membership, an update process of play history information is performed to delete the play history of the game.

The update process for the update target location of the common related player list is an update process for the location of the play history information in the common related player list when the player performs an operation to update the play history information. For example, when a player performs an operation to start a new game, an update process is performed to add the play history of the new game to the play history information about the player.

The processing unit 100 also performs a process of referring to play history information of related players associated with the player in the common related player list. That is, as described above, in the common related player list, the related players of each player are associated with the play history information of the related players. Therefore, the processing unit 100 can refer to the play history information of the related player associated with the player who performed the above operation on the terminal device in the common related player list. Based on the reference result, the processing unit 100 performs display processing for the player on the terminal device or list processing that is processing for the related player list. That is, the processing unit 100 performs display processing based on the reference results and list processing based on the reference results. The display processing unit 120 performs display processing based on the reference results, and the list processing unit 106 performs list processing that is processing for the related player list based on the reference results.

The process of referring to the play history information of related players includes, for example, reading the play history information of players related to the player from the common related player list storage unit 172 and referring to what kind of games the related players have played in the past. It is processing. For example, when a player performs an operation to start a new game, a process is performed to refer to whether or not there is a play history of the new game in the play history information of players related to the player. Display processing and list processing are then performed based on the reference results.

For example, the processing unit 100 performs a display process of displaying related player candidates to the player based on the reference results. For example, the processing unit 100 performs display processing to display related player candidates on the display unit of the player's terminal device. This display processing is performed by the display processing section 120. For example, the processing unit 100 refers to play history information of players related to the player in the common related player list, and based on the reference results, displays a display for introducing players who are candidates for related players of the player in a game played by the player. Perform processing. For example, when a player performs an operation to start a new game, the player's related players (friend players) who have played the new game in the past are extracted by referring to the play history information in the common related player list. do. Then, display processing is performed to introduce the extracted related players (friend players) as related player candidates (friend candidates) for the new game started by the player.

Furthermore, the processing unit 100 performs a process of creating a new related player list or a process of sorting the related player list based on the reference result as list processing. This list processing is performed by the list processing unit 106. For example, the processing unit 100 refers to play history information of players related to the player in the common related player list, and creates a related player list for the game played by the player based on the reference result. The processing unit 100 then performs a process of displaying the created related player list on the player. For example, when a player performs an operation to start a new game, the player's related players who have played the new game in the past are extracted by referring to the play history information in the common related player list. Then, a process is performed to newly create a related player list consisting of the extracted related players and display it on the player's terminal device. The processing unit 100 also refers to the play history information of players related to the player in the common related player list, and performs a sorting process on the related player list of the player based on the reference result. For example, when a player performs an operation to start a new game, the player's related players who have played the new game in the past are extracted by referring to the play history information in the common related player list. Then, the related player list is sorted so that the extracted related players are placed at the top of the player's related player list (for example, at the top of the display order).

Note that the processing order of the update processing for the update target portion of the common related player list and the display processing and list processing based on the reference result is arbitrary, and it is not necessarily necessary to perform the display processing and list processing immediately after the update processing. For example, the processing timing of update processing and the processing timing of display processing or list processing may be temporally separate. Alternatively, a modified implementation is also possible in which the update process is performed after the display process and the list process.

Furthermore, when the player performs an operation to start a new game as an operation to update the play history information of the common related player list, the processing unit 100 controls the new game for related players who have already played in the new game. Perform the process of granting benefits in . For example, assume that related players (friend players) of the player in the new game are extracted based on the reference result of the play history information of the common related player list. In this case, the player has just started the new game, so he is a junior in the new game, and the related player has played the new game in the past, so he is a senior in the new game. Therefore, benefits in the new game are given to related players who are senior players. Game benefits are intended to give players more advantage or preferential treatment in the game. For example, if a benefit is given to a related player in a new game, the related player will be able to advance in the new game more favorably or receive more preferential treatment in the new game than if the benefit was not given. . For example, game parameters used in game processing are set to give the associated player a greater advantage. The game parameters are parameters such as attack power, defense power, durability, hit points, magic points, or level of the player or the character used by the player.

In addition, when the player performs an operation to start a new game as an operation to update the play history information of the common related player list, the processing unit 100 updates one of the related players and players who are already playing in the new game. A process is performed in which the player is permitted to perform a predetermined action against the other player in the new game. For example, suppose that players related to the player in the new game are extracted based on the reference result of the play history information of the common related player list. In this case, the relevant player who has already played in the new game is permitted to perform a predetermined action on the player in the new game. For example, an affiliated player may be allowed to interfere with the player's game play, or an affiliated player may be allowed to request support or the like from the player. Alternatively, a player who has started a new game is permitted to perform a predetermined action on related players who are already playing the new game. For example, a player is allowed to interfere with the game play of an affiliated player, or a player is allowed to make a request such as a request for support from an affiliated player.

Further, the common related player list storage unit 172 stores, for each player, a common related player list in which related players of each player, play history information of the related players, and relationship information of each player and the related players are associated. Memorize the list. That is, in the common related player list, in addition to play history information of related players of each player, relationship information (relationship information) between each player and related players is associated with each player. The relationship information between each player and the related players is information that is an indicator of the relationship between each player and the related players, and is information that indicates the relationship between each player and the related players. For example, the relationship information is information indicating how much relationship each player and related players have, what type of relationship they have, or how much the relationship is in terms of time factors. becomes.

Specifically, the relationship information is information about the elapsed time of the relationship between each player and the related players, information about the cooperative play time between each player and the related players, or information about the access time to the game between each player and the related players. This is the information. The information regarding the relationship elapsed time is information representing, for example, the elapsed time from the start of the relationship (friend relationship) between each player and the related player. For example, it is determined that the longer the relationship elapsed time, the higher the relevance (relationship) between each player and the related player. The information about the cooperative play time is the total cooperative play time (cumulative time) or the most recent cooperative play time when each player and an associated player played cooperatively in past games. For example, it is determined that the longer the cooperative play time, the higher the relationship between each player and the related player. Note that the relevance information may include information on the number of times of cooperative play, and this information on the number of times of cooperative play can also be equated with information about cooperative play time. The information about the access time to the game is information about the most recent access time to the game of each player and related players, or information about the time zone of the access time to the game. For example, if the most recent access times for each player and the related player to the game are close, or if each player and the related player access the game at the same time, the relationship between each player and the related player is high. be judged. Accessing the game is, for example, logging into the game and starting playing.

The processing unit 100 also performs display processing or list processing based on the relationship information between each player and related players. For example, the processing unit 100 determines the relationship information between each player and related players in addition to the play history information of the common related player list, and performs display processing for the player on the terminal device or list processing that is processing for the related player list. I do. For example, the display content and display mode of display processing may be different depending on whether the relevance represented by the relevance information of each player and related players is high or low, or the content of list processing for the related player list may be different. . For example, if each player and a related player have a high degree of relevance, an image such as a character or a mark indicating that the relationship between the two is high is displayed. Further, a related player list creation process is performed so that related players having a high degree of relevance to each player are preferentially entered into the related player list. Alternatively, the related player list is sorted so that related players with high relevance are sorted at the top of the related player list.

Furthermore, when the player and related players are related to each other in a plurality of games, the processing unit 100 performs a display process of displaying information on the number of duplicates of related games to the player. For example, assume that a player and a related player are registered as related players in a plurality of games played in the past. In this case, information on the number of games determined to be related is displayed on the player's terminal device as information on the number of duplicates of games. As a display mode for the number of duplicates information, it is possible to display characters or marks representing the number of duplicates.

The processing unit 100 also determines the degree of intimacy between the player and related players based on the relationship information, and performs display processing or list processing based on the degree of intimacy. For example, the processing unit 100 determines the level of intimacy between the player and the related players based on the relationship information between the player and the related players. For example, it is determined that the higher the relationship between the player and the related player, the higher the degree of intimacy between the player and the related player. Then, based on the obtained familiarity, display processing for the player on the terminal device or list processing that is processing for the related player list is performed. For example, the display content and display mode of the display process may be different depending on whether the degree of intimacy between each player and the related player is high or low, or the content of list processing for the related player list may be different. For example, when each player and a related player have a high degree of intimacy, an image such as a character or a mark that indicates that the degree of intimacy between the two is high is displayed. Further, a related player list creation process is performed so that related players who have a high degree of intimacy with the player are preferentially entered into the related player list. Alternatively, the related player list is sorted so that related players who have a high degree of intimacy with the player are sorted at the top of the related player list.

Also, for example, the related player is a friend player, the related player list is a friend list, and the common related player list is a common friend list. Note that friend players here include not only friend players in a narrow sense, such as those who have been approved and registered by the player, but also friend players in a broader sense, such as those who have played together with the player in the past. can.

Furthermore, the server system 500 of the present embodiment has a related player list storage unit that stores a related player list in which related players of the player in each entertainment content are associated with each entertainment content of a plurality of entertainment contents played by the player. 170, and a common related player list storage unit 172 that stores, for each of the plurality of players, a common related player list in which related players of each player and play history information of entertainment content of the related players are associated. include. The server system 500 also includes a processing unit 100 that processes a related player list and a common related player list. Then, when the player performs an operation on the terminal device to update the play history information of the common related player list, the processing unit 100 performs an update process on the update target portion of the common related player list. The processing unit 100 also performs a process of referencing the play history information of the player associated with the player in the common related player list, and performs display processing for the player on the terminal device or processing for the related player list based on the reference result. Perform some list processing.

The entertainment content here may include, for example, game content, video distribution content, movie or music content, virtual reality (VR) content, or communication-related content such as bulletin boards and chat. The entertainment content play history includes, for example, game play history, playback history of distributed videos, movie and music viewing history, VR experience history, viewing history and participation history of communication-related content, and the like. Alternatively, the play history of entertainment contents may include action history such as search history of these entertainment contents. For example, if a related player who has played a game together with the player is playing entertainment content other than the game, the player can refer to the play history information of the entertainment content other than the game and respond to the player on the terminal device. Display processing or list processing for the related player list may be performed. For example, by referring to play history information of videos played by related players (friend players), movies and music watched, VR experienced, and communication-related content viewed or participated in, display processing or list processing for the player is performed. Good too. Alternatively, display processing or list processing for the player may be performed with reference to the game play history of related players who are associated with the player in entertainment content other than games. That is, for related players who were associated with the player in the first type of entertainment content, display processing or list processing for the player is performed with reference to the play history of the second type of entertainment content that is different from the first type. You may go. For example, if the second player has watched a historical movie in the past, the second player may be introduced to the first player as a related player (friend player) in a historical simulation game, or Create a related player list (friends list) that includes players. Alternatively, if the first player has played a historical simulation game together with the second player, the first player may be introduced to a historical movie that the second player has watched. Good too. For example, assume that a play history of entertainment content is stored in a database managed by a second manufacturer that provides an entertainment device for playing entertainment content. In this case, big data regarding the play history of the entertainment content stored in the database is referred to, and display processing or list processing for the player is performed based on the reference result of the big data. This makes it possible to effectively utilize the big data in the database managed by the second manufacturer.

Note that the game system and processing of this embodiment shown in FIG. 2 described above may be realized by the server system 500 shown in FIG. It is possible to implement. Furthermore, the program of this embodiment can be applied to various programs such as an application program for a smartphone, a game program for a home game device, a game program for a PC, a browser game program for a smartphone or a PC, or a program for an arcade game device. Applicable.

2. Method of this embodiment Next, the method of this embodiment will be described in detail. Note that in the following explanation, related players, related player list, and common related player list will be referred to as friend player, friend list, and common friend list, respectively, in order to simplify the explanation and make the explanation easier to understand. . However, friend players here include not only friend players in a narrow sense, such as those who have been approved and registered by the player, but also friend players in a broader sense, such as those who have played a game together with the player in the past. can. Furthermore, although the following explanation will be given using an example in which the entertainment content is game content, the present embodiment can also be applied to cases where content other than games is used as the entertainment content.

2.1 Friend List, Common Friend List FIG. 3 shows an example of the friend list and common friend list of this embodiment. In the friend list (related player list in a broad sense), friend players (related players in a broad sense) of the player in each game are associated with each of a plurality of games played by the player. For example, in the friend list of player A's game 1, game 1 is associated with players B, C, and D, who are friend players of player A in game 1. In the friend list of player A's game 2, players B, E, and F, who are friend players of player A in game 2, are associated with game 2. In the friend list of player B's game 1, players A, C, and D, who are friend players of player B in game 1, are associated with game 1, and in the friend list of game 2, players A, C, and D are associated with game 1. , is associated with player A, who is a friend player of player B in game 2. In the friend list of player C's game 1, players A and B, who are friend players of player C in game 1, are associated with game 1.

For example, since player A played game 1 together with players B, C, and D, players B, C, and D are friend players. Furthermore, since player A played game 2 together with players B, E, and F, players B, E, and F are friend players.

Such a friend list for each game is prepared, for example, by a first manufacturer that provides applications for Game 1, Game 2, and Game 3. These friend lists are then stored in the related player list storage section 170 in FIG. 2. For example, these friend lists are stored in a database of the related player list storage unit 170 operated by the first manufacturer. If necessary, it is also stored in the storage units of the terminal devices of players A, B, and C.

In the common friend list (common related player list in a broad sense), each player's friend players (related players) and game play history information of the friend players are associated with each of the plurality of players. . For example, player A among a plurality of players A, B, and C is associated with players B, C, D, E, and F, who are friend players of player A, and their play history information. For example, player B's play history information indicates that player B has played game 1, game 2, game 3, and game 9 in the past. The play history information of player C indicates that player C has played games 1 and 3 in the past. The play history information of players D, E, and F indicates that players D, E, and F played game 1, game 2, and game 2, respectively, in the past.

Similarly, in the common friend list, player B among the plurality of players A, B, and C is associated with players A, C, and X, who are friend players of player B, and their play history information. , player C is associated with players A and B, who are friend players of player C, and their play history information.

The friend list in FIG. 3 is a friend list for each game, whereas the common friend list is a friend list commonly used by a plurality of players A, B, C, . . . . This common friend list is prepared, for example, by a second manufacturer that provides the system or hardware of the game device. For example, these common friend lists are stored in a database of a common related player list storage unit 172 operated by the second manufacturer. Note that it is also possible to implement a modification in which the common friend list database is operated by the first manufacturer, or the friend list database is operated by the second manufacturer.

For example, even if there are multiple generations of game devices provided by a second manufacturer, such as 1st generation, 2nd generation, 3rd generation, etc., the common friend list will include all of these multiple generations. The play history information of the game of the game device is stored. For example, game 1, game 2, game 3, and game 9 included in the play history information of player B, who is a friend player of player A, may include, for example, games of different generations of game devices. For example, if Game 1 and Game 2 are games for first and second generation game devices, respectively, then Player A is in a friend relationship with Player B in Game 1 of the first generation game device, and In Game 2 of the second generation game device, the relationship with Player B is also that of a friend.

In FIG. 3, as shown at A1, player A performs an operation to start playing a new game, Game 3. Such an operation to start a new game is an operation to update the play history information of the common friend list, and is an operation that requires updating the play history information of the common friend list. Therefore, in this embodiment, when the player performs such an operation on the terminal device, an update process is performed on the update target portion of the common friend list. Specifically, as shown in A2 of FIG. 3, an update process is performed to add the play history of Game 3 to the play history information of Player A in the section of Player B in the common friend list. Further, as shown in A3, an update process is performed to add the play history of game 3 to the play history information of player A in the location of player C in the common friend list. By performing such update processing, it becomes possible to maintain the common friend list as an appropriate list.

Note that the common friend list in FIG. 3 is created based on, for example, player information (user information) stored in the player information storage unit 174 in FIG. 2. For example, FIG. 4 shows an example of player information. In the player information in FIG. 4, each player (each user) is associated with a player ID, personal information, play history information, relationship information with friends, and the like. The personal information includes, for example, each player's name, gender, date of birth, and email address. The play history information is information about what games each player has played in the past. The relationship information with friends will be explained in detail later. The play history information of players A, B, C, D, E, F, and X in the common friend list of FIG. 3 is set based on the player information of FIG. 4. For example, the common friend list for player A is created by extracting the play history information of players B, C, D, E, and F, who are friend players of player A, from the player information in FIG. 4. The common friend list for player B is created by extracting the play history information of players A, C, and X, who are friend players of player B, from the player information shown in FIG. The common friend list for player C is created by extracting the play history information of players A and B, who are friend players of player C, from the player information shown in FIG. Furthermore, when a player uses multiple player IDs (user IDs), it is desirable to have a common friend list that stores all friend data linked to those multiple player IDs.

The present embodiment performs such update processing. Further, processing is performed to refer to play history information of friend players associated with player A in the common friend list. For example, in the common friend list of FIG. 3, players B, C, D, E, and F are associated with player A as friend players. Therefore, when player A starts game 3, a process is performed that refers to the play history information of players B, C, D, E, and F, who are friend players of player A. Then, based on the reference result, display processing for player A on the terminal device or list processing that is processing for the friend list is performed.

For example, by performing reference processing on the play history information of players B, C, D, E, and F, who are player A's friend players, it is possible to determine which of player A's friend players have played Game 3. As shown in A4 and A5 of No. 3, it is determined that the players are B and C. Therefore, as shown in A6, a list including players B and C is created as a friend list for player A's game 3. Alternatively, players B and C are introduced to the player as friend candidates for player A in game 3. Alternatively, a sorting process is performed so that players B and C are placed at the top of player A's friend list for game 3.

For example, FIG. 5 is an explanatory diagram of a method of displaying friend candidates (related player candidates in a broad sense) based on the reference result of the common friend list. When it is determined by the reference processing shown in A4 and A5 in FIG. 3 that the friend candidates for the game 3 newly started by player A are players B and C, the A friend candidate introduction screen as shown in 5 is displayed. This introduction screen informs player A that players B and C are friend candidates for game 3, which player A has newly started. Further, for example, it is reported that player B has played with player A in games 1 and 2 in the past, and that player C has played with player A in game 1 in the past.

By displaying such a friend candidate introduction screen to player A, player A can remember players with whom he has played in other games in the past. For example, it is difficult for Player A to remember players with whom he played a long time ago, players with whom he played with a previous generation game device, and the like. In this regard, in the present embodiment, players who are potential friends are extracted by referring to a common friend list prepared in the system of the second manufacturer that provides the game device. Therefore, even a player who has been forgotten by player A can be extracted as a friend candidate. After viewing the friend candidate introduction screen, player A selects players B and C, who he has played with in other games in the past, if he wishes to have them as friend players in game 3. and register as a friend. By doing this, players B and C are officially registered as friend players in game 3. As a result, as shown at A7 and A8 in FIG. 3, player A is also added to the friend list of players B and C in game 3.

Alternatively, a friend list made up of players extracted based on the reference results of the common friend list may be automatically created. FIG. 6 is an explanatory diagram of a method of creating a friend list based on the reference results of the common friend list. When players B and C are extracted as friend players in game 3 newly started by player A through the reference processing shown in A4 and A5 of FIG. As shown in 6, a newly created friend list is displayed based on the reference results. The created friend list includes players B and C with whom player A has played in other games in the past. Note that this friend list may include, for example, players automatically operated by a computer (NPC).

In this way, it becomes possible to automatically create a friend list in which players with whom the player has played in other games in the past are included as friend players. Therefore, players who frequently play together with the player, players who play games of the same genre as player A, or players who may have been forgotten from player A's memory in addition to these players. Even if the player is a new player, he or she can be automatically registered in the friend list as a friend player of a game newly started by player A, and the convenience of player A can be greatly improved.

Alternatively, the playlists may be sorted based on the reference results of the common friend list. FIG. 7 is an explanatory diagram of a method of sorting the friend list based on the reference results of the common friend list. When players B and C are extracted as friend players in game 3 newly started by player A through the reference processing shown in A4 and A5 of FIG. 3, sorting processing as shown in FIG. 7 is performed. That is, in FIG. 7, a sorting process is performed such that the extracted players B and C are ranked higher. For example, a sorting process is performed such that players B and C are preferentially displayed at the top of the friend list. In this case, the friend players other than players B and C are, for example, players automatically operated by a computer. In this way, players B and C, who have played games with previous players, can be displayed with priority at the top of the friend list, improving the convenience of player A.

FIG. 8 is a flowchart illustrating the processing of this embodiment. First, the game system determines whether the player has performed an operation to update the play history information in the friend list (step S1). For example, as shown in A1 of FIG. 3, when the player performs an operation to start a new game, it is determined that an operation to update the play history information has been performed. Alternatively, the operation of updating the play history information is not limited to an operation of adding the play history of the player's game, but may be an operation of deleting or changing the play history. Then, when such an operation to update the play history information is performed, an update process for the update target portion of the common friend list is executed (step S2). For example, in FIG. 3, the locations indicated by A2 and A3 are the locations to be updated. Specifically, in the common friend list of players B and C, an update process is performed to add the play history of player A, who is a friend player of players B and C, to the play history of game 3 that player A newly started. be exposed.

Next, the game system refers to play history information of friend players associated with the player in the common friend list (step S3). For example, in FIG. 3, as shown at A4 and A5, play history information of players B and C, who are friend players associated with player A, is referenced. Then, based on the reference result, display processing for the player on the terminal device or list processing, which is processing for the friend list, is executed (step S4). For example, in FIG. 5, a display process is performed to display players B and C extracted based on the reference results to player A as friend candidates. In FIG. 6, list processing is being performed to create a new friend list including players B and C extracted based on the reference results. In FIG. 7, list processing is performed to sort players B and C extracted based on the reference results to the top of the friend list.

As described above, in this embodiment, for each game, there is a friend list (related player list) in which friend players (related players) of the player in each game are associated, and for each player, a friend list of each player is associated. A common friend list (common related player list) is prepared in which play history information of players and friend players are associated with each other. When the player performs an operation to update the play history information of the common friend list, an update process is performed on the update target portion of the common friend list. For example, when the player performs an operation to start a new game as shown in A1 of FIG. 3, an update process is performed to add the new game started by the player to the player's play history as shown in A2 and A3. Further, processing is performed to refer to play history information of the player's friend players in the common friend list. For example, reference processing for friend player play history information as shown in A4 and A5 of FIG. 3 is performed. Then, based on the reference result, display processing for the player on the terminal device or list processing that is processing for the friend list is performed. For example, a process for displaying friend candidates as shown in FIG. 5, and a list process for creating a friend list and sorting friend players as shown in FIGS. 6 and 7 are performed.

In this way, the common friend list can be maintained in an appropriate state by performing update processing on the update target portions of the common friend list. By using the reference results of the common friend list, it becomes possible to perform appropriate display processing regarding friend players and appropriate list processing regarding the friend list. Specifically, for example, it becomes possible to introduce appropriate friend players to the player, create a friend list including friend players suitable for the player, and appropriately sort the friend list. For example, when a player starts a new game, he or she can make friends with players who are already familiar with the game, even though it is the first time playing the game, by referring to a common friend list that includes friend players from games played in the past. It becomes possible to enjoy the game with friends.

Further, in this embodiment, a display process is performed to display friend candidates of the player to the player based on the reference result of the play history information of the common friend list. For example, as shown in FIG. 5, players extracted based on the reference results of the common friend list are displayed on the player as friend candidates. In this way, players with whom the player has played in the past can be notified to the player as friend candidates. In this case, not only players with whom the player frequently plays, but also players who have been forgotten from the player's memory can be notified to the player as friend candidates, improving convenience for the player. can.

Furthermore, in this embodiment, the process of creating a new friend list or the process of sorting the friend list is performed as a list process, which is a process for the friend list, based on the reference result of the play history information of the common friend list. For example, as shown in Fig. 6, a new friend list is created in which the players extracted by reference processing become friend players, or as shown in Fig. 7, a friend list is sorted so that the extracted players are placed at the top. Processing takes place. This way, a player can create a friends list that includes players they have played with in the past and display it to the player, and the friends list can be sorted so that players the player has played with in the past are at the top. . Therefore, if a player is presented with a friend list that includes players that the player frequently plays with, or players that the player has played with in the past but does not currently play with, such players may be easily recognized. A friend list sorted by position can now be presented to the player, improving convenience for the player.

2.2 Granting Benefits and Permitting Actions In this embodiment, when a player performs an operation to start a new game as an operation to update the play history information of the common friend list, if the player has already played in the new game, Perform processing to grant benefits in the new game to friend players. That is, since the friend player extracted by the reference process has played the new game before the player, a privilege is given to the friend player that gives him an advantage in playing the game or gives him preferential treatment. In this way, benefits can be given to a friend player who has become friends (in a broad sense, related relationship) with the player based on the common friend list reference process in return for becoming friends. As a result, even in a situation where, for example, a friend player becomes a friend of a player against his or her will, the friend player can play the game in a way that satisfies the player by giving benefits. FIG. 9 is a flowchart illustrating the process of giving benefits in a new game.

First, the game system determines whether the player has performed an operation to start a new game (step S11). That is, it is determined whether the player has performed an operation to start a new game as an operation to update the play history information of the friend list. Then, when an operation to start a new game is performed, an update process for the update target portion of the common friend list is executed (step S12). Also, reference is made to play history information of friend players associated with the player in the common friend list (step S13). Then, based on the reference result, display processing for the player on the terminal device or list processing that is processing for the friend list is executed (step S14). Furthermore, a process is executed to grant benefits in the new game to friend players who have already played the new game (step S15). That is, in playing the new game, benefits are given to the friend player to make him or her more advantageous or to give him more preferential treatment. For example, a privilege is given to a friend player who has already played the new game, and the friend player is allowed to use this privilege in the new game. For example, by using this privilege, the friend player may be able to perform special actions such as giving commands to the player who has started playing the new game.

Furthermore, in this embodiment, when a player performs an operation to start a new game as an operation to update the play history information of the common friend list, one of the friend player and the player who has already played in the new game Processing is performed to allow a player to perform a predetermined action against the other player in the new game. For example, a privilege is granted to a friend player who has already played a new game, and the friend player uses this privilege to issue commands to a player who has started playing the new game. Allows you to perform special actions such as Or, conversely, a privilege can be granted to a player who has started playing a new game, and the player can use this privilege to perform special actions against friend players who are already playing the new game. You can also do this. In this way, when a player and a friend player become friends based on the common friend list reference process, one of the players and the friend player can perform a predetermined action toward the other player. It becomes like this. In this way, the relationship between the player and the friend player will be deepened, and the fun and enjoyment of playing together between the player and the friend player will be improved. It becomes possible. Note that as the above-mentioned privilege granting process, a privilege to be able to perform such a special action may be granted. FIG. 10 is a flowchart illustrating a process for permitting a predetermined action in a new game.

Since the processing in steps S21 to S24 in FIG. 10 is similar to the processing in steps S11 to S14 in FIG. 9, detailed explanation will be omitted. In FIG. 10, after the display process or list process based on the reference process is executed in step S24, a process is performed in which one of the player and the friend player is allowed to perform a predetermined action on the other player in the new game. Execute (step S25). For example, a friend player who is already playing a new game is allowed to perform a predetermined action on a player who has started playing the new game. Or, conversely, a player who has started playing a new game is allowed to perform a predetermined action on a friend player who is already playing the new game.

For example, FIG. 11 is an explanatory diagram of a method for providing benefits in a new game. For example, if a friend player is introduced to a player who has started a new game based on the common friend list, the friend player will become a junior player because the friend player has already played the new game, and the friend player will become a senior player. become. In this case, a friend player who is a senior player is given a privilege of being able to give a tutorial to a player who is a junior player. For example, since the friend player has already played the new game, it is assumed that the game playing skill is high, and the player who newly started the new game is assumed to have low game playing skill. Therefore, when a friend player and a player form a team to play a new game, the low skill of the player is disadvantageous to the friend player. Therefore, in this case, the friend player who is a senior player is given the privilege of being able to give a game play tutorial to a player who is a junior player. By doing so, the player's game playing skills are improved, and as a result, cooperative play between the player and a friend player becomes advantageous. Note that various benefits can be envisaged as the benefits given to the friend player. For example, a privilege that increases the ability parameters of a character operated by a friend player may be provided, or a specific item such as a rare item may be provided to a friend player. Alternatively, a benefit that increases the lottery probability in a lottery process such as Gacha played by a friend player may be provided, or a benefit that increases the game level or experience value of the friend player may be provided. Note that the content of the benefit given to the friend player may be changed depending on the degree of intimacy between the player and the friend player, the game performance of the friend player or the player, and the like.

FIG. 12 is an explanatory diagram of a method for permitting a predetermined action in a new game. In FIG. 12, a friend player who is a senior player is allowed to request support from a player who is a junior player. That is, a friend player who is already playing the new game is allowed to request support from a junior player, as a privilege as a senior player, when playing against an enemy. Or, conversely, a player who is a junior player may be allowed to request the support of a friend player who is a senior player. Note that various actions can be assumed as the predetermined action that one of the player and the friend player performs on the other player. For example, one player may be allowed to perform actions that allow him to interfere with the game play of another player. For example, one player can intervene in the game play of another player, regardless of the other player's intention. Also, for example, one player may be able to command the other player to perform tasks or actions. For example, in a game against an enemy, one player may be able to instruct the other player whether to fight in a position in the front line or in a position in the rear line. Alternatively, one player may be permitted to perform an action by temporarily taking over the game operations of the other player. Note that the content of the action permitted to one player and the effect of the action may be changed depending on the degree of intimacy between the player and the friend player, the game performance of the friend player or the player, and the like.

2.3 Relevance Information In the present embodiment, the common related player list storage unit 172 (common friend list storage unit) stores, for each player, each player's friend players (related players) and play history information of the friend players. and a common friend list (common related player list) in which each player is associated with relationship information of friend players. That is, in the common friend list, in addition to play history information of friend players, relationship information between each player and the friend player is associated with each player. In this way, by referring to the common friend list, it becomes possible to obtain not only the play history information of the friend players but also the relationship information between each player and the friend players. Then, using the acquired relevance information, it becomes possible to perform various processes such as display processing and list processing according to the relevance information.

Specifically, the relationship information includes, for example, information about the elapsed time of the relationship between each player and a friend player, information about the cooperative play time between each player and a friend player, or access to a game between each player and a friend player. This is information about time. In this way, by referring to the common friend list, you can obtain not only play history information of friend players, but also information about elapsed relationship time, cooperative play time, and access time between each player and friend players. Become. Then, using the acquired information, it becomes possible to perform various processes such as display processing and list processing according to the relationship elapsed time, cooperative play time, and access time between each player and the friend player.

FIG. 13 is a diagram showing an example of relationship information between a player and a friend player, and is a diagram showing a detailed example of a common friend list. In the common friend list of FIG. 13, for each of the plurality of players A, B, C, etc., the friend player, play history information, and relationship information between the player and the friend player are associated with each other. There is. For example, player A's friend players in the common friend list are players B, C, D, E, and F. Therefore, in FIG. 13, the play history information of players B, C, D, E, and F is associated with player A, and the relationship information of player A and players B, C, D, E, and F are associated with each other. There is. Also, player B's friend players on the common friend list are players A, C, and X. Therefore, player B is associated with play history information of players A, C, and X, and relationship information of player B and players A, C, and X. Also, player C's friend players on the common friend list are players A and B. Therefore, player C is associated with play history information of players A and B and relationship information of player C and players A and B.

Further, in FIG. 13, the relationship information between the player and the friend player includes the elapsed time of the friendship relationship, the total cooperative play time, the most recent cooperative play time, and the access time. The friend relationship elapsed time is, for example, the elapsed time from the start of the friend relationship between the player and the friend player until the present time, and is, for example, the cumulative time that the friend relationship has continued. It can be determined that the longer the friend relationship elapsed time, the higher the relevance (relationship) between the player and the friend player, and the higher the degree of intimacy. The total cooperative play time is the total play time of the game in which the player and the friend player cooperated, and is, for example, the cumulative play time. The most recent cooperative play time is the play time during which the player and a friend player cooperated in the most recent game play. One example is the cooperative play time in the game before the current game. For example, it can be determined that the longer the total cooperative play time or the most recent cooperative play time, the higher the relationship between the player and the friend player and the higher the degree of intimacy. The access time is information regarding the time when the player or friend player accessed the game. For example, if a player and a friend player frequently access and play a game during the same time period, it can be determined that the player and the friend player are highly related and have a high degree of intimacy. For example, if a player and a friend player access the game more frequently during midnight hours than at other times, it is determined that the relationship between the two is high and their intimacy is high. Alternatively, it is determined that the closer the access times between the player and the friend player, the higher the relationship between the two and the higher the degree of intimacy between them.

In this embodiment, display processing or list processing is performed based on the relevance information explained with reference to FIG. 14 and the like. That is, based on the relationship information between the player and the friend player, display processing for the player on the terminal device or list processing that is processing for the friend list is performed. In this way, the display content and display mode of the display process for the player can be changed according to the relevance represented by the relationship information, and the content and display mode of list processing such as friend list creation process and sorting process can be changed. begins to change. Therefore, it becomes possible to realize display processing and list processing that reflect the relationship between the player and the friend player. FIG. 14 is a flowchart illustrating the processing of this embodiment using relevance information.

First, the game system determines whether the player has performed an operation to update play history information in the friend list (step S31). Then, when an operation to update the play history information is performed, an update process for the update target portion of the common friend list is executed (step S32). Also, reference is made to play history information of friend players associated with the player in the common friend list (step S33). Furthermore, relationship information such as the elapsed time of the relationship between the player and the friend player, the total cooperative play time, the most recent cooperative play time, and the access time is acquired (step S34). For example, using the common friend list shown in FIG. 13, relationship information between a player and a friend player is acquired. Then, based on the reference result of the friend player's play history information and the relationship information between the player and the friend player, display processing for the player on the terminal device or list processing that is processing for the friend list is executed (step S35). For example, processing is performed to display images such as characters or marks indicating that the player and the friend player are highly related. Furthermore, in display processing and list processing, processing using weighting based on relevance information is performed. Specifically, friend players with high relevance are preferentially selected as friend candidates, preferentially inserted into the friend list, or sorted at the top of the friend list.

For example, in the present embodiment, when a player and a friend player have a relationship in a plurality of games, a process is performed in which information on the number of duplicates of the games that are related is displayed to the player. That is, when a player and a friend player have a friend relationship in a plurality of games, overlapping number information, which is the number of games in which the player has a friend relationship, is displayed to the player. In this way, the player can easily visually recognize how many games the player and friend player have played together in the past by looking at the overlap information. This improves player convenience.

FIG. 15 is an explanatory diagram of a method of displaying the number of duplicate games and friend rank. In FIG. 15, players FA, FB, FC, FD, and FE are in a friend player relationship with player P. For example, based on the reference results of the common friend list, a friend list including these players FA to FE is created, these players FA to FE are sorted to the top of the friend list, or these players FA to FE are Introduced as a candidate. In this case, the number of duplicate games and friend ranks are displayed in association with these players FA to FE. For example, since player P and player FA have played 11 games together in the past, the number of games overlapped is 11, and the friend rank is SS rank, which is a very high rank. Furthermore, since player P and player FB have played seven games together in the past, the number of games overlapped is seven, and the friend rank is S rank, which is a high rank. Similarly, player P and players FC, FD, and FE have played 5 games, 5 games, and 3 games together in the past, respectively, so the number of game overlaps is 5, 5, and 3. , the friend ranks will be A rank, A rank, and B rank. By displaying such information on the number of game overlaps, player P can easily visually recognize how many games players FA to FE have played together in the past. Therefore, for example, a player feels closer to a player who has played a large number of games, and can enjoy cooperative play with such a player who has played a large number of games as a friend player.

Further, in this embodiment, the degree of intimacy between the player and the friend player is determined based on the relationship information between the player and the friend player, and display processing or list processing is performed based on the degree of intimacy. That is, based on the degree of intimacy determined based on the relationship information between the player and the friend player, display processing for the player on the terminal device or list processing that is processing for the friend list is performed. In this way, the display content and display mode of the display process for the player can be changed according to the intimacy determined based on the relationship information, and the content of list processes such as friend list creation process and sorting process can be changed. The aspect begins to change. Therefore, it becomes possible to realize display processing and list processing that reflect the degree of intimacy between the player and the friend player. FIG. 16 is a flowchart illustrating processing of this embodiment using intimacy determined based on relevance information.

First, relationship information such as the elapsed time of the relationship between the player and the friend player, the total cooperative play time, the most recent cooperative play time, and the access time is acquired (step S41). For example, using the common friend list shown in FIG. 13, relationship information between a player and a friend player is acquired. Then, the degree of intimacy between the player and the friend player is determined based on the relationship information between the player and the friend player (step S42). For example, it is determined that the higher the relevance expressed by the relevance information, the higher the degree of intimacy between the player and the friend player. For example, the longer the relationship elapsed time, the total cooperative play time, the most recent cooperative play time, or the closer the access times between the player and the friend player, the higher the degree of intimacy between the player and the friend player. Then, based on the degree of familiarity, display processing for the player on the terminal device or list processing that is processing for the friend list is executed (step S43). For example, processing is performed to display images such as characters or marks indicating that the degree of intimacy between the player and the friend player is high. Furthermore, for example, in display processing and list processing, processing using weighting based on familiarity is performed. Specifically, friend players with high intimacy are preferentially selected as friend candidates, preferentially inserted into the friend list, or sorted higher on the friend list.

Although the present embodiment has been described in detail as above, those skilled in the art will easily understand that many modifications can be made without substantively departing from the novelty and effects of the present disclosure. Therefore, all such modifications are intended to be included within the scope of the present disclosure. For example, in the specification or drawings, a term (friend player, friend list, common friend list, etc.) appears at least once with a different term with a broader or synonymous meaning (related players, related player list, common related player list, entertainment content, etc.). , games, etc.) may be replaced with a different term anywhere in the specification or drawings. Further, the related player list, common related player list, update processing and reference processing of the common related player list, display processing and list processing based on the reference results, etc. are not limited to those described in this embodiment, but are equivalent to these methods. are also within the scope of this disclosure.

TM1 to TMn, TM terminal equipment,
100... Processing unit, 102... Game processing unit, 104... Management unit, 106... List processing unit,
108, 110...Storage management unit, 112...Communication unit, 120...Display processing unit,
130...Sound processing unit, 170...Related player list storage unit,
172...Common related player list storage unit, 174...Player information storage unit,
500...server system, 510...network

Claims (14)

a related player list storage unit that stores, for each of the plurality of games played by the player, a related player list in which related players of the player in each game are associated;
a common related player list storage unit that stores, for each of the plurality of players, a common related player list in which related players of each player and game play history information of the related players are associated;
a processing unit that processes the related player list and the common related player list;
including;
The processing unit includes:
When the player performs an operation on the terminal device to update the play history information of the common related player list, an update process is performed on the update target part of the common related player list, and the player is updated in the common related player list. performing a process of referring to the play history information of the associated related player, and based on the reference result, performing a display process of the terminal device to the player or a list process that is a process of the related player list;
The common related player list is
a list for a first player in which a player related to the first player is associated with the play history information of a game of a player related to the first player;
a list for a second player in which a player related to the second player is associated with the play history information of the game of the player related to the second player;
including;
The processing unit includes:
When the first player is a related player of the second player in the second player list, when an operation is performed to update the play history information of the first player, the second player list A game system characterized in that the update process is performed using the play history information of the first player as the update target location . In claim 1,
The processing unit includes:
A game system characterized in that the display process is performed to display related player candidates of the player to the player based on the reference result. In claim 1,
The processing unit includes:
The game system is characterized in that the list processing includes a process of creating a new related player list or a process of sorting the related player list based on the reference result. In any one of claims 1 to 3,
The processing unit includes:
As the operation, when the player performs an operation to start a new game, a process is performed in which a benefit in the new game is given to a related player who has already played in the new game. game system. In any one of claims 1 to 4,
The processing unit includes:
As the operation, when the player performs an operation to start a new game, a predetermined action is performed on one of the related players and the player who is already playing in the new game with respect to the other player. A game system characterized in that the game system performs a process of permitting the following in the new game. In any one of claims 1 to 5,
The common related player list storage unit is
The common related player list is stored for each player, in which related players of each player, the play history information of the related players, and relationship information of each player and the related players are associated with each other. game system. In claim 6,
The relationship information is information about the elapsed time of the relationship between each player and the related players, information about the cooperative play time between each player and the related players, or information about the access time to the game between each player and the related players. A game system characterized by certain things. In claim 6 or 7,
The processing unit includes:
A game system characterized in that the display processing or the list processing is performed based on the relevance information. In claim 8,
The processing unit includes:
A game system characterized in that, when the player and related players are related in a plurality of games, the display processing is performed to display information on the number of overlaps of related games to the player. In claim 8 or 9,
The processing unit includes:
A game system characterized in that a degree of intimacy between the player and a related player is determined based on the relationship information, and the display process or the list process is performed based on the degree of intimacy. In any one of claims 1 to 10,
A game system characterized in that the related player is a friend player, the related player list is a friend list, and the common related player list is a common friend list. a related player list storage unit that stores, for each of the plurality of entertainment contents played by the player, a related player list in which related players of the player in each entertainment content are associated;
a common related player list storage unit that stores, for each of the plurality of players, a common related player list in which related players of each player are associated with play history information of entertainment content of the related players;
a processing unit that processes the related player list and the common related player list;
including;
The processing unit includes:
When the player performs an operation on the terminal device to update the play history information of the common related player list, an update process is performed on the update target part of the common related player list, and the player is updated in the common related player list. performing a process of referring to the play history information of the associated related player, and based on the reference result, performing a display process of the terminal device to the player or a list process that is a process of the related player list;
The common related player list is
a list for a first player in which a player related to the first player is associated with the play history information of a game of a player related to the first player;
a list for a second player in which a player related to the second player is associated with the play history information of the game of the player related to the second player;
including;
The processing unit includes:
When the first player is a related player of the second player in the second player list, when an operation is performed to update the play history information of the first player, the second player list A server system characterized in that the update process is performed using the play history information of the first player as the update target location . a related player list storage unit that stores, for each of the plurality of games played by the player, a related player list in which related players of the player in each game are associated;
a common related player list storage unit that stores, for each of the plurality of players, a common related player list in which related players of each player and game play history information of the related players are associated;
As a processing unit that processes the related player list and the common related player list,
make the computer work,
The processing unit includes:
When the player performs an operation on the terminal device to update the play history information of the common related player list, an update process is performed on the update target part of the common related player list, and the player is updated in the common related player list. performing a process of referring to the play history information of the associated related player, and based on the reference result, performing a display process of the terminal device to the player or a list process that is a process of the related player list;
The common related player list is
a list for a first player in which a player related to the first player is associated with the play history information of a game of a player related to the first player;
a list for a second player in which a player related to the second player is associated with the play history information of the game of the player related to the second player;
including;
The processing unit includes:
When the first player is a related player of the second player in the second player list, when an operation is performed to update the play history information of the first player, the second player list A program characterized in that the update process is performed using the play history information of the first player as the update target location . a related player list storage unit that stores, for each of the plurality of entertainment contents played by the player, a related player list in which related players of the player in each entertainment content are associated;
a common related player list storage unit that stores, for each of the plurality of players, a common related player list in which related players of each player are associated with play history information of entertainment content of the related players;
As a processing unit that processes the related player list and the common related player list,
make the computer work,
The processing unit includes:
When the player performs an operation on the terminal device to update the play history information of the common related player list, an update process is performed on the update target part of the common related player list, and the player is updated in the common related player list. performing a process of referring to the play history information of the associated related player, and based on the reference result, performing a display process of the terminal device to the player or a list process that is a process of the related player list;
The common related player list is
a first player list in which a player related to the first player is associated with the play history information of the entertainment content of the player related to the first player;
a list for a second player in which a player related to the second player is associated with the play history information of the entertainment content of the player related to the second player;
including;
The processing unit includes:
When the first player is a related player of the second player in the second player list, when an operation is performed to update the play history information of the first player, the second player list A program characterized in that the update process is performed using the play history information of the first player as the update target location .

Images