JP2021058368A - Information processing device, game program, and information processing method - Google Patents

Abstract

To activate communication among players.SOLUTION: An information processing device includes: a storage unit for storing player information in which a predetermined condition that is satisfied by each player in a game, a time point in which the predetermined condition is satisfied, and other players, who are companions of each player are set for each player; a screen data creation unit for creating screen data for arranging other players who satisfy the predetermined condition of the other players, who are companions of the player, in a time series manner, and displaying them on a screen; a point imparting unit for imparting a point to any of the other players displayed on the screen in response to a game operation of the player for having communication with the any of the other players displayed on the screen; and a point exchange unit for exchanging the point obtained by the other player for a privilege.SELECTED DRAWING: Figure 1

Description

The present invention relates to an information processing device, a game program, and an information processing method.

There is known a game system configured so that players set as friends can play a game while communicating with each other (for example, Patent Document 1).

Japanese Patent No. 6475961

In such games, there was room for improvement in activating communication between players.
The present invention has been made in view of such circumstances, and an object of the present invention is an information processing device, a game program, an information processing method, and a game system capable of activating communication between players. Is to provide.

The main invention of the present invention for solving the above problems is
For each player, a storage unit that stores a predetermined condition satisfied by each player in the game, a time when the predetermined condition is satisfied, and player information set by another player who is a friend of each player, and a storage unit.
A screen data generation unit that generates screen data for displaying screens of other players who meet the above-mentioned predetermined conditions in chronological order among other players who are friends of the players.
A point-giving unit that grants points to the other player in response to the player performing a game operation for communicating with any of the other players displayed on the screen.
With the point exchange department that exchanges points earned by the other players for benefits,
It is an information processing device characterized by being equipped with.
Other features of the present invention will be clarified by the description of the present specification and the accompanying drawings.

It is a figure which shows the whole configuration example of a game system 1. It is a block diagram which shows the functional structure of the server apparatus 10. It is a figure which shows the data structure example of a character information. It is a figure which shows the data structure example of item information. It is a figure which shows the data structure example of a player information. It is a figure which shows the data structure example of the possession item information. It is a figure which shows the data structure example of deck information. It is a figure which shows the data structure example of the companion information. It is a figure which shows the data structure example of the fellow action information. It is a figure which shows the data structure example of the action history information. It is a figure which shows the data structure example of quest information. It is a figure which shows the data structure example of the entry information. It is a figure which shows the data structure example of the matching information. It is a block diagram which shows the functional structure of a player terminal 20. It is a flowchart for demonstrating the operation example about the event game which can play in a preset event period. It is a flowchart for demonstrating the operation example about the update of the fellow action information. It is a flowchart for demonstrating the operation example which concerns on giving friend points to a friend. It is a figure which shows an example of the fellow exchange screen 50. It is a flowchart for demonstrating the operation example concerning exchange of friend points owned by a player.

The description of this specification and the accompanying drawings will clarify at least the following matters.
That is, a storage unit that stores player information set for each player, a predetermined condition satisfied by each player in the game, a time when the predetermined condition is satisfied, and other players who are friends of each player. When,
A screen data generation unit that generates screen data for displaying screens of other players who meet the above-mentioned predetermined conditions in chronological order among other players who are friends of the players.
A point-giving unit that grants points to the other player in response to the player performing a game operation for communicating with any of the other players displayed on the screen.
With the point exchange department that exchanges points earned by the other players for benefits,
It is an information processing device characterized by being equipped with.
According to such an information processing device, every time another player (friend) set as a friend meets a predetermined condition in the game, the friends are arranged one after another in chronological order and displayed on the screen. You will be able to easily grasp the latest status of your friends on the screen. In addition, when the player operates the game to communicate with the companion displayed on the screen in this way, points are given to the companion, so that companion actively fulfills the predetermined condition in the game. I will participate. As a result, it becomes possible to activate communication between players.

Further, in such an information processing device, when the screen data generation unit generates screen data for displaying screen data by arranging other players satisfying the predetermined conditions in chronological order, any one of the other players. However, when the player is a returning player who has resumed the interrupted game, a mark indicating that the other player is a returning player may be displayed on the screen.
With such an information processing device, the player can easily grasp on the screen that a friend has returned to the game after a blank. On the contrary, the returning player himself can easily grasp the current status of the fellows on the screen by displaying them on the screen in chronological order each time the former fellows satisfy the predetermined conditions. In addition, when the player operates the game to communicate with the returning player, points are given to the returning player, so that the returning player can be motivated to continue the game even after returning.

Further, in the information processing device, when the point giving unit is a returning player who has restarted the interrupted game when giving points to the other player. , You may give more points than if you are not a returning player.
According to such an information processing device, the returning player can further increase the motivation to continue the game even after returning.

Further, in the information processing device, when the other player is a returning player, the point giving unit may give more points as the period from the interruption to the restart of the game is longer. ..
According to such an information processing device, the returning player can further increase the motivation to continue the game even after returning even if there is a blank for a long period of time.

Further, in the information processing device, when the point giving unit gives points to the other player, the longer the period of being a member of the player, the more points may be given.
According to such an information processing device, each player strives to maintain a friendship, so that communication between players can be further activated.

Further, in such an information processing device, when the screen data generation unit generates screen data for displaying screen data by arranging other players satisfying the predetermined conditions in chronological order, any one of the other players. However, in the case of a returning player who has resumed the interrupted game, the returning players may be displayed on the screen side by side at the top instead of in chronological order.
According to such an information processing device, as an exception, allies who have returned to the game after a blank are displayed on the screen side by side at the top instead of in chronological order, so that the player can easily return the allies on the screen. You will be able to grasp it.

Then on the computer
For each player, a process of storing in a storage unit a predetermined condition satisfied by each player in the game, a time when the predetermined condition is satisfied, and player information set by another player who is a friend of each player. When,
Screen data generation processing that generates screen data for displaying screens of other players who meet the above-mentioned predetermined conditions in chronological order among other players who are friends of the players.
A point awarding process for awarding points to the other player in response to the player performing a game operation for communicating with any of the other players displayed on the screen.
The point exchange process for exchanging points earned by other players for benefits, and
It is a game program characterized by executing.
According to such a game program, it is possible to activate communication between players.

Then the computer
For each player, the predetermined conditions satisfied by each player in the game, the time when the predetermined conditions are satisfied, and the player information set by other players who are friends of each player are stored in the storage unit. When,
To generate screen data for displaying screens of other players who meet the above-mentioned predetermined conditions in chronological order among other players who are friends of the players.
In response to the player performing a game operation for communicating with any of the other players displayed on the screen, points are awarded to the other player.
To exchange the points earned by the other players for benefits,
It is an information processing method characterized by having.
According to such an information processing method, it is possible to activate communication between players.

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

The game system 1 according to the present embodiment can provide a player with a competitive game played by using game contents. In the following, a competitive game played using an item as an example of game content will be described.

The player who plays the battle game according to the present embodiment selects one of the various quests and plays against one or more enemy characters set in the quest. In the battle against this enemy character, the player attacks using his / her own deck.

The deck is organized by the player selecting and combining attack items from the items he owns. At that time, the player organizes a deck by referring to the strength of the so-called attack item, such as various parameters and skills (attack characteristics) set for the attack item.

Further, in the battle game according to the present embodiment, when a player invites another player to a friend, the invited other user approves the invitation, so that the player is set as a friend to each other. Each player can increase his or her allies until the number of allies reaches the limit (upper limit of the number of allies).

Then, when the player cannot defeat the enemy character, by requesting support from another player set as a friend of that player, the friend who received the request can attack the enemy character. ..

Further, the battle game according to the present embodiment includes not only such a normal game but also an event game that can be played only during the event period. In the event game, each team is formed by assigning each of a plurality of players to one of the teams, and team battles are performed between the matched teams.

Further, in the battle game according to the present embodiment, each player can browse his / her own friend exchange screen so that the friends can enjoy the game play while communicating with each other.

On this friend exchange screen, among other players who will be your friends, other players who meet the prescribed conditions such as logging in to the game, entering the event game, and becoming the top ranking player in the event game. Are displayed side by side in chronological order.

That is, every time one's companion meets a predetermined condition, the companions who meet the condition are arranged one after another in chronological order and displayed on the screen. Therefore, each player can browse his / her own companion exchange screen. You can easily grasp the latest status of your friends on the screen.

Then, each player selects one of his / her friends arranged in chronological order on his / her friend exchange screen, and operates a game for communicating with that friend (for example, "for a friend". You can press the "Like" operation button).

In this way, when each player performs a game operation for communicating with his / her companion, friend points are given to that companion. Therefore, each player will actively participate in the game in order to satisfy a predetermined condition, and it will be possible to activate communication between the players.

By exchanging points, each player who has earned friend points in this way can obtain benefits such as special items instead of consuming his / her friend points.

In addition, on this friend exchange screen, among the other players arranged in chronological order as friends, the return player is referred to the other player who resumed the interrupted game (hereinafter, also referred to as "return player"). A mark indicating that is displayed.

Therefore, each player can easily grasp on the screen that his / her companion has returned to the game after a blank by browsing his / her companion exchange screen. On the contrary, the returning player himself can easily grasp the recent situation of his friends on the screen by browsing his friend exchange screen.

In addition, when each player performs a game operation for communicating with the returning player, friend points are given to the fellow who is the returning player. Therefore, the returning player can increase the motivation to continue the game even after returning by being able to obtain friend points by communicating with his / her friends.

<< About the configuration of the server device 10 >>
FIG. 2 is a block diagram showing a functional configuration of the server device 10. The server device 10 is an information processing device (for example, a workstation, a personal computer, etc.) used by a system administrator or the like when operating and managing various services. When the server device 10 receives various commands (requests) from the player terminal 20, the server device 10 uses a game program and various data that can operate on the player terminal 20 and a markup language (HTML, etc.) that matches the standard of the player terminal 20. Send (response) the created Web page (game screen, etc.). The server device 10 includes a control unit 11, a storage unit 12, an input unit 13, a display unit 14, and a communication unit 15.

The control unit 11 transfers data between each unit and controls the entire server device 10, and is realized by the CPU (Central Processing Unit) executing a program stored in a predetermined memory. .. The control unit 11 in the present embodiment includes at least an entry processing unit 111, a matching processing unit 112, a deck organization processing unit 113, a game progress unit 114, and a screen data generation unit 115.

The entry processing unit 111 has a function of executing various processes related to the entry in the battle game. The entry processing unit 111 in the present embodiment accepts participation registration of a plurality of players who wish to participate in an event game that is regularly held in a battle game.

The matching processing unit 112 has a function of executing various processes related to matching in the event game. The matching processing unit 112 in the present embodiment forms each team by assigning each of the plurality of players registered to participate in the event game to any team. Then, two teams that are opponents of each other are matched from the formed plurality of teams. In other words, since a plurality of players belong to each team, a plurality of players who are opponents of each other are matched with each other.

The deck organization processing unit 113 has a function of executing a process of organizing a deck used in a battle game. A deck is a group of items that combine a plurality of items with attack characteristics into one set. The deck formation processing unit 113 in the present embodiment organizes a deck (hereinafter, also referred to as a “player deck”) composed of a plurality of attack items owned by the player based on the operation of the player. You may also organize a player deck that includes attack items that the player does not own.

The game progress unit 114 has a function of executing a process of advancing the battle game according to the game program. The game progress unit 114 in the present embodiment includes a battle processing unit 114A, a point giving unit 114B, a point exchange unit 114C, and a companion setting unit 114D.

The battle processing unit 114A has a function of executing a process of determining the outcome of the battle with the enemy character. The battle processing unit 114A in the present embodiment determines the victory or defeat by comparing the ability parameter of the player deck with the ability parameter of the enemy character in each of the normal game and the event game, for example.

The point giving unit 114B has a function of executing a process of giving points to a player. The point giving unit 114B in the present embodiment performs a game operation for each player to select one of his / her friends arranged in chronological order on his / her friend exchange screen and communicate with that friend. If you do, give friend points to that fellow.

The point exchange unit 114C has a function of executing a process of exchanging points based on a player's operation. The point exchange unit 114C in the present embodiment consumes the friend points owned by the player and grants the player a privilege such as a special item.

The companion setting unit 114D has a function of executing various processes for setting a friend relationship between players. The companion setting unit 114D in the present embodiment performs a companion approval operation for the invited other user to approve the companion application operation for inviting another player to the companion. And, both players are set in the player information as friends with each other. Further, when a player satisfies a predetermined condition, the friend setting unit 114D in the present embodiment sets the player in chronological order in the player information associated with the player's friend. Further, the companion setting unit 114D in the present embodiment sets to delete the player from the player information associated with the player's companion when a predetermined period elapses after the player satisfies the predetermined condition.

The screen data generation processing unit 115 has a function of executing a process of generating screen data for displaying the game screen on the player terminal 20. The screen data generation unit 115 in the present embodiment generates data of a friend exchange screen that each player browses in order to communicate with his / her friends for each player. In this embodiment, HTML data is generated as screen data corresponding to the game screen.

The storage unit 12 includes a ROM (Read Only Memory), which is a read-only storage area in which a system program is stored, and a RAM (Random Access), which is a rewritable storage area used as a work area for arithmetic processing by the control unit 11. Memory), and is realized by, for example, a non-volatile storage device such as a flash memory or a hard disk. The storage unit 12 in the present embodiment stores at least character information, item information, player information, quest information, entry information, and matching information. In addition, these various information will be described in detail later.

The input unit 13 is for the system administrator or the like to input various data (for example, character information, item information, quest information, etc.) related to the game service, and is realized by, for example, a keyboard or a mouse.

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

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

FIG. 3 is a diagram showing an example of a data structure of character information. This character information includes at least the character name such as an enemy character, rarity, maximum attack power, maximum defense power, maximum physical strength (maximum HP), initial attack power, initial defense power, and initial physical strength in association with the character ID. Ability parameters such as (initial HP) are set.

FIG. 4 is a diagram showing an example of a data structure of item information. In this item information, at least the item name, rarity, characteristic, ability value, and usable number of times are set in association with the item ID. A characteristic is information that indicates an ability peculiar to the item. For example, skills are set for attack items. This skill has the ability to make continuous attacks on enemy characters and the ability to temporarily increase the attack power. The ability value is information indicating the ability parameter of the item. The number of times the item can be used is information indicating the number of times the item can be used during a match.

FIG. 5 is a diagram showing an example of a data structure of player information. At least the player name, login information, owned item information, deck information, owned points, fellow information, fellow action information, action history information, return flag, and event information are set in this player information in association with the player ID. There is. The login information is historical information indicating the date and time when the player logged in to the game and the date and time when the player logged out. Owned points are information indicating the number of friend points owned by the player. The return flag is flag information indicating whether or not the player is a return player. In the present embodiment, a player whose predetermined period (for example, one month) has elapsed from the interruption of the game to the resumption of the game is regarded as a return player, and a return flag is set for the return player. The event information is information about the event game entered by the player. Here, for example, scores and rankings in event games, quests during challenges, and the like are set.

FIG. 6 is a diagram showing an example of a data structure of owned item information. Owned item information is information about items owned by the player (hereinafter, also referred to as "owned items"). At least the number of possessed items is set in this owned item information in association with the item ID.

FIG. 7 is a diagram showing an example of a data structure of deck information. The deck information is information about the player deck used by the player in the battle. In this deck information, at least the attack items that make up the player deck and the number of times the attack items are used are set in association with the frame number of the deck. In this embodiment, a player deck can be constructed by using up to nine attack items selected by the player from among the items owned by the player.

FIG. 8 is a diagram showing an example of a data structure of companion information. Companion information is information about other players who are friends of the player. At least the player ID, the friend start date, the friend period, and the friend exclusion flag are set in this friend information in association with the friend number. The player ID is information indicating the player ID of another player set as a player's companion. The companion start date is information indicating the date when the player became a companion. The companion period is information indicating the period during which another player is a companion of the player. The ally exclusion flag is flag information indicating whether or not another player has been excluded from the player's ally. That is, other players with the ally exclusion flag set become old friends for the player.

FIG. 9 is a diagram showing an example of a data structure of companion action information. The companion action information is information about a companion who meets a predetermined condition among the player's companions. At least the player ID, the date and time, the content, and the number of operations are set in this fellow action information in association with the action number. The player ID is information indicating the player ID of another player who satisfies a predetermined condition among other players set as a player's companion in the companion information. The date and time is information indicating the date and time when another player who is a member of the player satisfies a predetermined condition. The content is information indicating the content of a predetermined condition satisfied by another player who is a member of the player. The number of operations is information indicating the total number of times the game operation has been performed for communication by another player who is a friend of the player (the total number of times the operation button of "Like" has been pressed by the friend). Here, information about other players who have performed such game operations (other players who have pressed the "Like" operation button) is also set. In addition, this fellow action information is updated every time another player who is a fellow of the player satisfies a predetermined condition.

FIG. 10 is a diagram showing an example of a data structure of action history information. The action history information is history information regarding a predetermined condition satisfied by the player. At least the date and time and the contents are set in this action history information in association with the action history ID. The date and time is information indicating the date and time when the player satisfies a predetermined condition. The content is information indicating the content of a predetermined condition satisfied by the player. The action history information is updated every time the player satisfies a predetermined condition.

FIG. 11 is a diagram showing an example of a data structure of quest information. Quest information is information about quests prepared for a normal game. At least the quest name, level, and enemy character are set in this quest information in association with the quest ID. The level is information indicating the difficulty level of the quest. The enemy character is information that indicates the opponent character that appears in the quest. Here, one or more enemy characters are set for each quest. Then, ability parameters (attack power, defense power, physical strength, etc.) are also set for each enemy character.

FIG. 12 is a diagram showing an example of a data structure of entry information. The entry information is information about the player who has entered in the event game. In this entry information, at least the player ID of the player who entered and the entry date and time are set in association with the entry ID.

FIG. 13 is a diagram showing an example of a data structure of matching information. The matching information is information about a plurality of players matched in the event game. In this matching information, at least the matched team, the members of the team, the stage number, the enemy character of each stage, the progress in each stage, and the points earned by the team in each stage are set in association with the match ID. ing. The enemy character of each stage is information indicating the character ID of the enemy character that appears in that stage. In this embodiment, three stages are prepared in advance for each team, and it is set so that a strong enemy character appears every time the stage is cleared. The progress in each stage is information indicating whether or not the stage has been cleared by defeating the appearing enemy character. The points earned by the team in each stage are information indicating the total amount of points earned by each player belonging to the team each time they attack. The points earned by this team are updated each time each player earns points.

<< About the configuration of player terminal 20 >>
FIG. 14 is a block diagram showing a functional configuration of the player terminal 20. The player terminal 20 is an information processing device (for example, a smartphone, a tablet terminal, a mobile phone terminal, etc.) that the player can possess and use. Since the player terminal 20 has a Web browser function, it is possible to display a Web page (game screen, etc.) transmitted from the server device 10 on the screen. The player terminal 20 includes a terminal control unit 21 that controls the entire player terminal 20, a terminal storage unit 22 that stores various data programs, a terminal input unit 23 for the player to perform operation input, and a game screen / operation. It has a terminal display unit 24 that displays a screen and a terminal communication unit 25 that performs information communication between the server device 10.

<< Operation of Game System 1 >>
<Event game>
FIG. 15 is a flowchart for explaining an operation example regarding an event game that can be played in a preset event period.

First, the server device 10 performs an entry process for entering a player who wishes to participate in the event game within the preset entry acceptance period (step S101).

Specifically, when the entry screen is displayed on the terminal display unit 24 and the entry operation is performed by the player, the player terminal 20 makes an entry request for registration of participation in the event game to the server device 10. Send to.

Upon receiving the entry request transmitted from the player terminal 20, the server device 10 registers the participation of the player who wishes to participate in the event game. That is, the entry processing unit 111 sets and registers various information in the entry information shown in FIG. 12 based on the entry operation performed by the player.

Next, when the preset entry acceptance period ends, the server device 10 performs a matching process for matching the players who are opponents with each other (step S102).

Specifically, the matching processing unit 112 refers to the entry information shown in FIG. 12, selects a plurality of players (for example, 10 players) from a plurality of registered players, and assigns them to the same team. Form each team. The matching processing unit 112 selects and matches two teams that are opponents from each other from the formed plurality of teams. Then, the matching processing unit 112 collectively registers two matched teams in the matching information shown in FIG. 13, and deletes each player belonging to the matched team from the entry information shown in FIG.

Next, when the opponent teams are matched in this way, the server device 10 performs a deck formation process for each player belonging to the matched team to form a player deck to be used for the battle play ( Step S103).

Specifically, when the deck formation screen (not shown) is displayed on the terminal display unit 24, the player terminal 20 designates the attack items constituting the player deck used for the battle play in association with the frame number. When the operation is performed by the player, the deck formation request is transmitted to the server device 10.

In this embodiment, each player belonging to the matched team can select up to 9 attack items from his / her own items and incorporate them into his / her deck. At this time, it is also possible to incorporate up to 3 sets of 3 attack items into one set in your deck.

After that, when the server device 10 receives the deck formation request transmitted from the player terminal 20, the server device 10 sets the deck of the player. That is, the deck formation processing unit 113 organizes a player deck composed of attack items designated by the player, and sets and registers the player deck in the deck information shown in FIG. 7.

Next, the server device 10 sets an enemy character to appear in the first stage battle for each of the matched teams at the preset start time of the team battle (step S104). That is, the battle processing unit 114A sets the enemy character associated with the first stage as the attack target with reference to the matching information shown in FIG.

Next, the server device 10 determines whether or not the enemy character of the first stage has been defeated by an attack from each player belonging to the team (step S105). That is, the battle processing unit 114A determines whether or not the physical strength parameter (HP) of the enemy character has reached a predetermined value (for example, zero). Then, when it is determined that the physical strength parameter (HP) of the enemy character is a predetermined value (step S105: YES), the process proceeds to step S107 described later. On the other hand, if it is determined that the physical strength parameter (HP) of the enemy character is not a predetermined value (step S105: NO), the process proceeds to the next step S106.

Next, the battle processing unit 114A determines whether or not the preset team battle end time has come when it is determined that the physical strength parameter (HP) of the enemy character is not a predetermined value (step S106).

Then, when it is determined that the end time of the team battle set in advance has come (step S106: YES), the process proceeds to step S113 described later. On the other hand, if it is determined that the end time of the team match set in advance has not been reached (step S106: NO), the process returns to step S105, and the attack from each player belonging to the team continues to cause the first stage. It is determined whether or not the enemy character of is defeated.

Next, when the enemy character of the first stage is defeated by any team, the server device 10 sets the enemy character to appear in the next battle of the second stage (step S107). That is, the battle processing unit 114A sets the enemy character associated with the second stage as the attack target with reference to the matching information shown in FIG.

Next, the server device 10 determines whether or not the enemy character of the second stage has been defeated by the attack from each player belonging to the team (step S108). That is, the battle processing unit 114A determines whether or not the physical strength parameter (HP) of the enemy character has reached a predetermined value (for example, zero). Then, when it is determined that the physical strength parameter (HP) of the enemy character is a predetermined value (step S108: YES), the process proceeds to step S110 described later. On the other hand, if it is determined that the physical strength parameter (HP) of the enemy character is not a predetermined value (step S108: NO), the process proceeds to the next step S109.

Next, the battle processing unit 114A determines whether or not the preset team battle end time has come when it is determined that the physical strength parameter (HP) of the enemy character is not a predetermined value (step S109).

Then, when it is determined that the end time of the team battle set in advance has come (step S109: YES), the process proceeds to step S113 described later. On the other hand, if it is determined that the end time of the team match set in advance has not been reached (step S109: NO), the process returns to step S108, and the second stage is continued by the attack from each player belonging to the team. It is determined whether or not the enemy character of is defeated.

Next, when the enemy character of the second stage is defeated by any team, the server device 10 sets the enemy character to appear in the final battle of the third stage (step S110). That is, the battle processing unit 114A sets the enemy character associated with the third stage as the attack target with reference to the matching information shown in FIG.

Next, the server device 10 determines whether or not the enemy character of the third stage has been defeated by the attack from each player belonging to the team (step S111). That is, the battle processing unit 114A determines whether or not the physical strength parameter (HP) of the enemy character has reached a predetermined value (for example, zero). Then, when it is determined that the physical strength parameter (HP) of the enemy character is a predetermined value (step S111: YES), the process proceeds to step S113 described later. On the other hand, if it is determined that the physical strength parameter (HP) of the enemy character is not a predetermined value (step S111: NO), the process proceeds to the next step S112.

Next, the battle processing unit 114A determines whether or not the preset team battle end time has come when it is determined that the physical strength parameter (HP) of the enemy character is not a predetermined value (step S112).

Then, when it is determined that the end time of the team battle set in advance has come (step S112: YES), the process proceeds to step S113 described later. On the other hand, if it is determined that the end time of the team battle set in advance has not been reached (step S112: NO), the process returns to step S111, and the third stage is continued by the attack from each player belonging to the team. It is determined whether or not the enemy character of is defeated.

Next, the server device 10 determines the outcome of the team battle when the preset end time of the team battle is reached or when the enemy character appearing in the final third stage is defeated (step S113). ).

Specifically, the battle processing unit 114A refers to the matching information shown in FIG. 13 and compares the earned points earned by each team in all the cleared stages for each matched team, and the earned points are obtained. The team with the most is decided as the winning team.

Next, the server device 10 determines the ranking in the event game (step S114). That is, the battle processing unit 114A determines the individual ranking in the event game based on the points individually acquired by each player belonging to each team, and updates the event information of each player belonging to each team.

<Update of fellow action information>
FIG. 16 is a flowchart for explaining an operation example related to updating the companion action information.

The server device 10 determines whether or not the player who plays the game using the player terminal 20 satisfies the predetermined conditions at the timing when various requests from the player terminal 20 are received or at a predetermined timing set in advance. (Step S201).

In the present embodiment, for example, entry into an event game, becoming a top ranking player (for example, within 10th place) in the event game, logging in to the game, and the like are preset as predetermined conditions. Therefore, the companion setting unit 114D refers to the player information associated with the player and determines whether or not such a predetermined condition is satisfied.

Then, if it is determined that the player does not satisfy the predetermined condition (step S201: NO), this process ends. On the other hand, if it is determined that the player satisfies the predetermined condition (step S201: YES), the process proceeds to the next step S202.

Next, when it is determined that the player satisfies the predetermined condition in this way, the server device 10 identifies another player set as a companion of the player (step S202).

Specifically, the companion setting unit 114D identifies the companion information of the player from the player information shown in FIG. 5, and is set as a companion of the player by referring to the identified companion information shown in FIG. Identify other players.

Next, when the other player set as the player's companion is identified in this way, the server device 10 updates the companion action information associated with each of the other players who are the identified companion. (Step S203).

Specifically, the companion setting unit 114D identifies companion action information from the player information associated with each of the other players who are the identified companions, and updates data for each of the identified companion action information. Do. That is, in association with the player ID of the player who satisfies the predetermined condition, the date and time and the content satisfying the predetermined condition are set and registered in the companion action information in the order of the action numbers.

The companion setting unit 114D sequentially deletes the companion information set in the companion action information according to the order of the action numbers, starting from the date and time when the predetermined condition is satisfied and the predetermined period (for example, 3 days) has elapsed. As a result, the data related to the old actions of the friends are deleted in order, and only the data related to the new actions of the friends can be left in the friend action information, so that the player can grasp the current status of the friends.

<Granting friend points>
FIG. 17 is a flowchart for explaining an operation example relating to the granting of friend points to a friend.

When the player logs in to the battle game, the player terminal 20 transmits a command (screen data request) for requesting screen data of the friend exchange screen that the player can use to communicate with the friend to the server device 10. (Step S301).

Next, when the server device 10 receives the screen data request transmitted from the player terminal 20, the server device 10 causes the screen data generation unit 115 to generate screen data corresponding to the friend exchange screen for the player to view (step S302). ..

Specifically, the screen data generation unit 115 specifies the fellow action information of the player from the player information shown in FIG. 5, and refers to the identified fellow action information shown in FIG. 9, and satisfies a predetermined condition. Identify other players set as companions.

Then, the screen data generation unit 115 refers to the fellow action information shown in FIG. 9, and sets the other player who is the specified fellow according to the date and time associated with the other player who is the specified fellow. Arrange them in chronological order on the screen.

Further, the screen data generation unit 115 refers to the companion action information shown in FIG. 9, and refers to the companion action information shown in FIG. Place them on the screen in correspondence with each player.

Further, the screen data generation unit 115 refers to the player information shown in FIG. 5 associated with the other player who is the specified companion, and whether or not there is another player for which the return flag is set. Check if. Then, for the other player whose return flag is set, a mark indicating that the player is a return player is placed on the screen in correspondence with the other player.

Further, the screen data generation unit 115 refers to the friend information shown in FIG. 8 associated with the other player who is the specified friend, and whether there is another player for which the friend exclusion flag is set. Check if not. Then, for other players for which the fellow exclusion flag is set, a mark indicating that they are old fellows is placed on the screen in correspondence with the other players.

The server device 10 transmits the screen data of the friend exchange screen generated by the screen data generation unit 115 in this way to the requesting player terminal 20 via the network.

Next, when the player terminal 20 receives the screen data transmitted from the server device 10, the player terminal 20 analyzes the screen data to display the friend exchange screen on the terminal display unit 24 (step S303).

FIG. 18 is a diagram showing an example of the fellow exchange screen 50. On the friend exchange screen 50, the friend display area 51, the mark 52 indicating that the player is a returning player, the mark 53 indicating that the player is an old friend, the operation button 54 for communicating with the friend, and the display of the friend are expanded. The operation button 55 for the operation and the companion reaction display area 56 are included.

In the friend display area 51, predetermined conditions such as logging in to the game, entering the event game, and becoming the top ranking player in the event game among other players set in the friend information as the player's friends are set. Other satisfied players are displayed side by side in chronological order.

In addition, among the friends arranged in the time series in the friend display area 51, the friends who have returned to the game through the blank are displayed in association with the mark 52 indicating that they are the returning player, and have been displayed by the players so far. A mark 53 indicating that the friend is an old friend is displayed in association with the friend who has been excluded from the friend.

In addition, an operation button 54 for communicating with the friends is displayed in the friend display area 51 in association with each of the friends arranged in chronological order. The character "Like" is displayed on the operation button 54. By selecting the operation button 54 associated with one of the friends arranged on the friend exchange screen 50, the player can convey the evaluation of "Like" to the other party and join the other party. You can interact.

Further, here, three friends (“player X”, “player S”, and “player G”) are displayed in the friend display area 51. By selecting the operation button 55, the player can also browse other companions following the three.

In the friend reaction display area 56, the evaluation of "like" by another player set in the friend information as a player's friend is displayed in a list. For example, "Player X" who is a friend of "Player A" discovers the "Player A" arranged in chronological order on his friend exchange screen 50 (friend display area 51), and the "Player A" When the operation button 54 associated with is selected, the evaluation of "like" by the fellow "player X" is displayed on the fellow exchange screen 50 (friend reaction display area 56) of the opponent "player A". Will be.

Next, returning to FIG. 17, when the friend exchange screen 50 is displayed on the terminal display unit 24 in this way, the player terminal 20 associates with any friend from the friend display area 51 by the operation of the player. When the selected operation button 54 is selected, a command (companion exchange request) requesting interaction with the selected companion is transmitted to the server device 10 (step S304).

Next, when the server device 10 receives the friend exchange request transmitted from the player terminal 20, friend points are given to other players who are friends selected by the player on the friend exchange screen 50 (step S305). ).

Specifically, the point giving unit 114B identifies the fellow information of the player from the player information shown in FIG. 5, and refers to the identified fellow information shown in FIG. 8, and the player displays the fellow exchange screen 50. Identify other players who are the selected companions. Then, the player information shown in FIG. 5 associated with the other player who is the specified companion is specified, the possession points set in the specified player information are updated, and the points for this time (for example). 1 point) is added.

Next, when friend points are given to another player who is a friend in this way, the server device 10 sets the number of operations (the number of "like" operations) set in the friend action information of that player. Count up (step S306).

Specifically, the companion setting unit 114D identifies the companion action information of the player from the player information shown in FIG. 5, and refers to the identified companion action information shown in FIG. 9, and the player interacts with the companion screen. The number of operations associated with another player who is a companion selected in 50 is specified, and the specified number of operations is counted up by one.

As described above, according to the game system 1 according to the present embodiment, every time one's friends satisfy a predetermined condition in the game, the actions of the friends are arranged one after another on the own friend exchange screen 50. The player can easily grasp the latest status of his / her friends on the screen. In addition, the player can acquire friend points by selecting the "Like" operation button 54 in order to communicate with the friend displayed on the friend exchange screen 50 in this way. Therefore, each player actively participates in the game in order to satisfy a predetermined condition, and as a result, it becomes possible to activate communication between the players.

<Point exchange>
FIG. 19 is a flowchart for explaining an operation example relating to the exchange of friend points owned by the player.

When the player terminal 20 receives the screen data transmitted from the server device 10, the player terminal 20 analyzes the screen data to display the point exchange screen on the terminal display unit 24 (step S401).

Next, when the point exchange screen (not shown) is displayed on the terminal display unit 24, the player terminal 20 selects the amount of friend points of the exchange source and the item to be the privilege of the exchange destination by the operation of the player. , A command (point exchange request) requesting the exchange of the exchange source friend point and the exchange destination privilege item is transmitted to the server device 10 (step S402).

Next, when the server device 10 receives the point exchange request transmitted from the player terminal 20, the server device 10 executes a process of exchanging the exchange source friend points selected by the player for the exchange destination privilege item (step S403). ..

Specifically, the point exchange unit 114C updates the owned points set in the player information shown in FIG. 5 and reduces the number of friend points selected by the player on the point exchange screen. Then, the possessed item information of the player is specified from the player information shown in FIG. 5, the identified owned item information is updated, and an item to be a privilege selected by the player on the point exchange screen is additionally set.

This allows each player to actively communicate with other fellow players in order to collect more friend points. As a result, it becomes possible to activate communication between players.

=== Other embodiments ===
The above embodiment is for facilitating the understanding of the present invention, and is not for limiting the interpretation of the present invention. The present invention can be modified and improved without departing from the spirit thereof, and the present invention also includes an equivalent thereof. In particular, even the embodiments described below are included in the present invention.

<Game operation for communication>
In the above embodiment, as an example of the game operation for communicating with a friend, the operation of selecting the "Like" operation button 54 associated with the friend displayed on the friend exchange screen 50 is performed. Although described by way of example, the present invention is not limited thereto.

For example, displaying the "share" operation button in association with the friend displayed on the friend exchange screen 50 and selecting the "share" operation button may be a game operation for communicating with the friend. In this case, when the "share" operation button is selected, the predetermined conditions (actions) satisfied by the friends are shared so that they can be viewed among the players.
It is also possible to use other social buttons.

Further, for example, displaying the operation button of "comment" in association with the friend displayed on the friend exchange screen 50 and selecting the operation button of "comment" may be a game operation for communicating with the friend. .. In this case, when the "comment" operation button is selected, the screen transitions to the comment input screen, and the comment input on that screen is sent to the companion.

<Give points>
In the above embodiment, the point giving unit 114B gives more points when the friend selected by the player's operation on the friend exchange screen 50 is the "return player" than when the friend is not the "return player". It is also possible to give it. By doing so, the "returning player" can further increase the motivation to continue playing the game even after returning.

Further, when the friend selected by the player's operation on the friend exchange screen 50 is the "returning player", the point giving unit 114B interrupts the game based on the login information set in the player information shown in FIG. It is also possible to calculate the period until resumption and give more points as the period is longer. By doing so, the "returning player" can further increase the motivation to continue playing the game even after returning, even if there is a long-term blank.

Further, the point giving unit 114B increases as the period of being a friend with another player selected by the player's operation on the friend exchange screen 50 based on the friend period set in the friend information shown in FIG. It is also possible to give points. By doing so, each player will endeavor to maintain a friendship, and it will be possible to further activate communication between players.

<Friend exchange screen>
In the above-mentioned fellow exchange screen 50 in the present embodiment, the case where other players who satisfy the predetermined conditions are displayed side by side in chronological order among the other players set in the fellow information as the fellow players has been described. , The present invention is not limited to this.

For example, if there is a "returning player" among the friends arranged in chronological order on the friend exchange screen 50, the "returning player" can be displayed side by side at the top instead of in chronological order. By preferentially displaying the "returning player" on the screen in this way, the friends who have returned to the game after a blank are exceptionally displayed on the screen side by side instead of in chronological order, so that the player is a friend of the fellow. You can more easily grasp the return on the screen.

Further, when there is no friend who should be arranged in chronological order on the friend exchange screen 50 (for example, when the friend is not yet set in the friend action information shown in FIG. 9), FIG. 5 It is also possible to select other players who are candidates for friends from the other players set in the player information shown in, and display the other players who are candidates for friends side by side on the friend exchange screen 50. is there. By doing so, it is possible to avoid a situation in which no other person is displayed on the friend exchange screen 50. Further, in this case, when the player presses the "Like" operation button for other players who are candidates for friends displayed side by side on the friend exchange screen 50, the friend setting unit 114D immediately sets both players. It is also possible to set it as a companion. By doing so, it is possible to save the trouble of operations such as companion application and companion approval, and it is possible to easily become a companion.

<Game content>
In the above embodiment, the item has been described as an example of the game content, but the present invention is not limited thereto. For example, the game content may be electronic game data, and may be a character card, a character itself, a figure, or the like.

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

<Information processing device>
In the game system 1 of the present embodiment described above, a case where the server device 10 and the player terminal 20 cooperate with each other to execute various information processing based on the game program has been described as an example, but the present invention is not limited to this. Instead, the player terminal 20 alone or the server device 10 alone as the information processing device may execute the above-mentioned various information processing based on the game program.
Further, the player terminal 20 may be configured to play a part of the function as the information processing device. In this case, the server device 10 and the player terminal 20 form an information processing device.
The information processing device is an example of a computer equipped with a processor and a memory.

1 Game system 2 Network 10 Server device 11 Control unit 12 Storage unit 13 Input unit 14 Display unit 15 Communication unit 20 Player terminal 21 Terminal control unit 22 Terminal storage unit 23 Terminal input unit 24 Terminal display unit 25 Terminal communication unit 50 Companion exchange screen 51 Companion display area 52 Mark 53 Mark 54 Operation button 55 Operation button 56 Companion reaction display area 111 Entry processing unit 112 Matching processing unit 113 Deck organization processing unit 114 Game progress unit 114A Battle processing unit 114B Point giving unit 114C Point exchange unit 114D Companion Setting unit 115 Screen data generation unit

Claims (8)

For each player, a storage unit that stores a predetermined condition satisfied by each player in the game, a time when the predetermined condition is satisfied, and player information set by another player who is a friend of each player, and a storage unit.
A screen data generation unit that generates screen data for displaying screens of other players who meet the above-mentioned predetermined conditions in chronological order among other players who are friends of the players.
A point-giving unit that grants points to the other player in response to the player performing a game operation for communicating with any of the other players displayed on the screen.
With the point exchange department that exchanges points earned by the other players for benefits,
An information processing device characterized by being equipped with. The information processing device according to claim 1.
The screen data generation unit
When generating screen data for displaying screen data of other players satisfying the predetermined conditions in chronological order, when any of the other players is a returning player who has restarted the interrupted game. , Display a mark on the screen indicating that the other player is a returning player,
An information processing device characterized by this. The information processing device according to claim 1 or 2.
The point giving part
When awarding points to the other player, when the other player is a returning player who has resumed the interrupted game, more points are given than when the other player is not a returning player.
An information processing device characterized by this. The information processing device according to claim 3.
The point giving part
When the other player is a returning player, the longer the period from the interruption to the restart of the game, the more points will be awarded.
An information processing device characterized by this. The information processing device according to claim 1.
The point giving part
When giving points to the other player, the longer the period of being a member of the player, the more points will be given.
An information processing device characterized by this. The information processing device according to claim 1.
The screen data generation unit
When generating screen data for displaying screen data of other players satisfying the predetermined conditions in chronological order, when any of the other players is a returning player who has restarted the interrupted game. Displays the returning players on the screen side by side at the top instead of in chronological order.
An information processing device characterized by this. On the computer
For each player, a process of storing in a storage unit a predetermined condition satisfied by each player in the game, a time when the predetermined condition is satisfied, and player information set by another player who is a friend of each player. When,
Screen data generation processing that generates screen data for displaying screens of other players who meet the above-mentioned predetermined conditions in chronological order among other players who are friends of the players.
A point awarding process for awarding points to the other player in response to the player performing a game operation for communicating with any of the other players displayed on the screen.
The point exchange process for exchanging points earned by other players for benefits, and
A game program characterized by executing. The computer
For each player, the predetermined conditions satisfied by each player in the game, the time when the predetermined conditions are satisfied, and the player information set by other players who are friends of each player are stored in the storage unit. When,
To generate screen data for displaying screens of other players who meet the above-mentioned predetermined conditions in chronological order among other players who are friends of the players.
In response to the player performing a game operation for communicating with any of the other players displayed on the screen, points are awarded to the other player.
To exchange the points earned by the other players for benefits,
An information processing method characterized by having.

Images