JP5801278B2 - GAME MANAGEMENT DEVICE AND PROGRAM - Google Patents

Description

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

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

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

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

  When two users construct a fellowship relationship, one user makes a fellowship application to the other user, and the user who receives the fellowship application approves it. The approval operation is mentioned. If a user performs operation for making a friend, a game server will select a plurality of other users at random as a friend candidate, and will display a friend candidate list on the screen of a user's terminal device. A user selects another user who wants to become a mate from the mate candidate list, and makes a friend application.

JP 2003-47778 A

  However, in the friend candidate list in which the friend candidates are randomly extracted, there may be cases where the partner who is interested in the user is not included, and the user takes time and effort while updating the friend candidate list many times. And I often looked for people I wanted to be friends with.

  The present invention has been made in view of the above problems, and a purpose of the present invention is to provide a game management device and a game that enable a user to smoothly apply for a friend who is interested in the user without taking time and effort. A system, a game management method, and a program are provided.

  1) A game management device (1, 2, 101, 102, 301, 302) according to one aspect of the present invention manages a game in which users can build a fellowship, and information on other users appearing on the user's game screen Based on the history stored by the history storage control means (51) and the history storage control means (51), the history storage control means (51) stores the history of the user in the storage device, and is not associated with the user who appeared on the game screen of the user. And recommending means (52) for recommending the other user as a fellow candidate when it is determined that the information about the same other user has reached a predetermined number of times or more.

  The game management device having this configuration can be configured by an information processing device (computer) such as a server capable of communicating with each user's game terminal (terminal device), for example. Or this game management apparatus can also be comprised by the information processing apparatus as a game terminal. Or this game management apparatus can also be comprised by the some information processing apparatus (a server, a game terminal) which mutually communicates.

  Moreover, this game management apparatus manages games, such as a social game and an online game which a user can build a friendship relationship, for example, a social game and an online game in which players can become friends and can enjoy exchange. Here, friendship is a collective term for virtual relationships between players built in the game. Acquaintance, friend, friend, classmate, partner, relative, family, brother, sister, company or organization colleague Including various in-game relationships.

  The game management device recommends another user B as a friend candidate to the user A when information about the same other user B appears on the screen of the user A more than a predetermined number of times (for example, three times or more). Give a chance to become a friend.

  A game management device that realizes this includes a history storage control unit that stores, in a storage unit, a history of information about other users who have appeared on the user's game screen. Here, as examples of “information on other users”, other users 'alternate characters (so-called player characters), characters owned by other users (for example, in a baseball game, players belonging to other users' teams) Character), avatars and photographs of other users, names of other users (may be nicknames), and the like. In video chat or the like, an image of another user may appear on the user's screen.

  In the following description, for the sake of convenience, there may be a notation that “another user appears on the game screen”, but this is another user's alternate character, owned character, avatar, photograph, chat image. It is assumed that information regarding other users including the above appears on the game screen.

  As an example in which information related to other users appears on the game screen of the user, in a battle game, a character (or a character owned by another user) of another user appears on the battle game screen as the user's opponent. Is mentioned. In this case, the history storage control means performs storage control for storing the user ID of the opponent and time information appearing on the screen as a history in the storage device. Note that other users' characters may appear on the screen multiple times during a match game, for example, a baseball game if it is a baseball game, The number of appearances can be counted as one time.

  Further, when a user plays a battle, first, information on a plurality of opponent candidates is displayed on the opponent candidate list screen, and when the user can select an arbitrary opponent from among them, the following can be performed. . That is, not only the other user that the user actually selected as the opponent, but also other users who are displayed on the screen as the opponent candidates are also stored as the history storage control means as other users who have appeared on the user's game screen. May store the history in a storage device.

  As another example, when a user plays a battle, regardless of his / her friends, if anyone can request battle cooperation as an assistant, the history storage control means relates to another user who appears on the user's game screen as an assistant. The history of information is stored in the storage means. In this case as well, other users who are actually requested as assistants by the user, as well as other users displayed on the screen as assistant candidates, the history storage control means as other users who have appeared on the user's game screen The history may be stored in a storage device.

  As another example, the history storage control unit stores, in the storage unit, a history of information regarding other users who fight in cooperation with the user and appear on the game screen of the raid boss battle. As described later, the raid boss battle refers to a cooperative play in which a plurality of users form a party (group) and face each other while cooperating with each other. In addition, when the user enters a virtual community room in the game, the history storage control unit stores, in the storage unit, a history of information regarding other users who are together in the room. Note that these are just examples, and there are various opportunities for other users to appear on the user's game screen.

  Then, the recommending means, based on the history stored by the history storage control means, information regarding the same other user B who has appeared in the game screen of the user A and does not have a friendship with the user A is more than a predetermined number of times ( For example, when it is determined that the number of times has reached three or more, the other user B is recommended to the user A as a fellow candidate. As an example of recommending as a fellow candidate, an imaginary character performs an effect such that the user A talks about how to become a friend with another user B. For example, the user A responds to the effect. Then, it is possible to easily apply for a friend to another user B.

  Even if another user B appears by chance on the user A's game screen several times, or as in 2) described later, the game screen of the other user B whose game management device satisfies the predetermined standard In any case where another user B appears a plurality of times as a result of increasing the appearance frequency, the user A is recommended to the user A as a fellow candidate.

  For user A, it is considered that other user B who has appeared many times on his game screen is attracting interest. Therefore, as in the conventional case, not only when the user A performs an operation for voluntarily creating a friend, but not only randomly displaying the friend candidate list, but in this configuration, the game management device side notifies the user A of the user A. On the other hand, matching for building a friendship is actively set, and another user B is recommended as a friend candidate to the user A.

  Also, conventionally, when searching for a partner who wants to become a friend from a randomly extracted friend candidate list, the friend candidate list is not included in the friend candidate list, while updating the friend candidate list many times , Users often spent time searching for people they wanted to be friends with. On the other hand, in this configuration, when the number of times of the other user B appearing on the screen of the user A becomes a predetermined number or more and the user A is interested in the other user B, the game management device is timely. Since the other user B is recommended to the user A as a friend candidate, the user A can smoothly make a friend without spending time and effort while playing the game.

  2) In the above configuration, the selection means (53) for selecting a second user who can be a fellow candidate based on a predetermined selection criterion from other users who are not in a fellow relation with the first user; The frequency with which the information about the second user selected by the selection means (53) is displayed on the screen during the game of the first user as the partner or partner candidate of the first user's game play, It is desirable to further include partner management means (54) for making the information higher than the information regarding other users.

  According to this configuration, the frequency at which the second user B (C, D...) That is not a friend of the first user A and satisfies a predetermined selection criterion is selected and appears on the game screen of the first user A. Is enhanced by the game management device. Details thereof will be described below.

  First, the selection means selects a second user B (C, D...) That can be a fellow candidate from other users who are not in a fellow relation with the first user A based on a predetermined selection criterion. Here, as an example of the predetermined selection criterion, the access frequency to the game, the number of friends, the game start date and time, the age, and the like can be the same as or different from those of the first user A. Further, as another example of the predetermined selection criterion, in the battle game, the battle frequency, the win rate, and the like can be the same as or different from those of the first user A. Moreover, you may provide the selection reference | standard called the opponent of the predetermined game (for example, 20 games) nearest to the 1st user A. Furthermore, it is also conceivable to use the level of the user in the game as a selection criterion (for example, the same level as or the difference between the level of the first user A is within a predetermined range). In addition, as the selection criterion, the above-described respective criteria can be employed alone or in various combinations. These are merely examples, and various selection criteria can be applied depending on the type and content of the game. As a selection criterion, it is preferable that a second user who is likely to be interested in the first user A can be extracted.

  Then, the opponent management means uses the information regarding the second user B (C, D...) Selected by the selection means as the opponent or opponent candidate for the first user A game play. The frequency of appearing on the inside screen is set to be higher than that of other users who are not affiliated with the first user A. Here, the “game play partner or opponent candidate” includes, for example, an opponent, an opponent candidate, a joint play partner (an assistant who cooperates in a battle, a cooperating member of a raid boss battle, etc.) or a joint play opponent candidate. Can do.

  As described above, in this configuration, the game management device increases the appearance frequency of the second user B (C, D...) That satisfies the predetermined selection criterion on the game screen of the first user A. In the course of playing the game, the first user A can be interested in the second user B (C, D...) And can be used as a lead for making friends. In particular, any selection criterion that allows the first user A to select a second user who is likely to be interested (for example, the game start date, age, place of birth, etc. is the same as or different from the first user A) If the second user is recommended to the first user A as a fellow candidate by chance, it will happen by a predetermined number of times. The possibility that the first user A is interested (thus trying to become a friend) can be increased as compared with other users who have appeared.

  Further, if it is left by chance (randomly) that another user B appears on the game screen of user A a predetermined number of times (for example, 3 times), the number of users registered in the game is more than tens of thousands. In many cases, it may take a long time to appear a predetermined number of times (or the probability of appearing a predetermined number of times becomes extremely low). On the other hand, in this configuration, since the appearance frequency of the second user B (C, D...) That satisfies the predetermined selection criteria on the first user A's game screen is intentionally increased, It becomes easy for the second user B (C, D...) To appear within a short period of time, and it is possible to create a situation in which the first user A is likely to be interested in the second user B (C, D...).

  3) In the configuration of 2) above, the history storage control means (51) includes information on other users who have contact points in the game among the information on other users appearing on the user's game screen. The history is stored in a storage device, and the selection means (53) is a user who is not in a friendship relationship with the first user, and who has had contact with the first user in the game in the past. Is preferably selected as the second user over other users who have never had a contact.

  For example, it is selected by the user from the candidate list and actually directly with the first user A, rather than other users who simply appear on the game screen of the first user A as opponent candidates or assistant candidates. Other users who have contact points in the game (for example, faced a match, asked for a helper, chatted) have become a deeply interested subject for the first user A. Therefore, in this configuration, the first user A and another user having a contact point in the game are preferentially selected as a second user who can be a fellow candidate.

  In the game management device that realizes this, the history storage control means stores the history of information related to other users who have contact (alternating current) in the game with the user among the information related to other users appearing on the user's game screen. Store in the storage means. Here, examples of “other users who have contact points with the user in the game” include an opponent, a joint play partner (a supporter of the battle play, a cooperating member of the raid boss battle, etc.), a conversation (chat in the in-game community room) ). These are merely examples, and the manner in which the user and other users have direct contact in the game varies depending on the type and content of the game.

  And the selection means is another user who is not in a friendship relationship with the first user A based on the history of information about the first user A and other users who have contacts in the game. The other user who has contact with one user A in the game is selected as the second user with priority over other users who have never had contact. Therefore, the second user who has had contact with the first user A in the game in the past is more likely to appear on the game screen of the first user A, and the first user A is selected as a friend candidate. It becomes easy to be recommended.

  With this configuration, priority is given to other users who are likely to be interested in the user (for example, other users who are selected by the user from the candidate list and actually have direct contact with the user in the game). It can be recommended as a fellow candidate, and the possibility that a user applies for a fellow candidate recommended by the user can be increased. Thereby, promotion of friend construction can be aimed at.

  4) In the configuration of 3) above, the recommendation means (52) recommends other users who appear on the game screen of the user with a predetermined number of contacts in the game as a candidate for the user. Is desirable.

  According to this configuration, for example, another user B who appears on the screen of the user A with a predetermined number of contacts (for example, three times or more) in the game, for example, to become an opponent of the user A, To user A. In other words, it is not enough to simply appear on the candidate list screen, and it is a condition of fellow candidates that it appears more than a predetermined number of times on the screen of user A with direct contact as an opponent or the like. Candidates are recommended to user A.

  Therefore, only other users who are considered to be strongly interested in the user (for example, other users who are selected by the user from the candidate list and actually have direct contact with the user in the game) are recommended as fellow candidates. It is possible to increase the possibility that the user applies for a friend candidate recommended by the user. Thereby, promotion of friend construction can be aimed at.

  5) In the configuration of any one of 1) to 4), it is desirable that the recommendation unit (52) recommends the user as a fellow candidate to another user recommended as a fellow candidate.

  According to this configuration, when the game management device recommends another user B as a friend candidate to the user A, the game management device recommends the user A as a friend candidate in parallel to the other user B. That is, in the present configuration, matching for building friendships is actively set for both the user A and the user B from the game management device side. Thereby, for example, a friend application may be sent to the user A first from the user B. In this case, the user A is interested in the other user B who has appeared many times on his game screen. The possibility of approving the fellow application is higher than usual. With this configuration, the friendship can be further easily established.

  6) A game system according to another aspect of the present invention is a game system including a server (1,2,101,102) and a terminal device (3,301,302) that communicates with the server (1,2,101,102). A history storage control means (51) for storing a history of information relating to other users appearing on the user's game screen in a storage device, and based on the history stored by the history storage control means (51), the user's game A recommendation means (52) for recommending the other user as a fellow candidate to the user when it is determined that the information related to the same other user who does not associate with the user appears on the screen more than a predetermined number of times. Either the server (1, 2, 101, 102) or the terminal device (3, 301, 302) is provided.

  7) A game management method according to another aspect of the present invention is a game management method in a computer that manages a game in which users can build a fellow relationship, and the computer has appeared on the game screen of the user. A history storage control step for storing a history of information relating to other users in a storage device, and a computer that has appeared on the user's game screen based on the history stored in the storage device by the history storage control step; A recommendation step of recommending the other user as a fellow candidate to the user when it is determined that information about the same other user who is not in a peer relationship has reached a predetermined number of times.

  8) A program according to yet another aspect of the present invention is a program for causing a computer to operate as a game management device that manages a game in which users can establish a fellowship relationship. The history storage control means (51) for storing the history of information related to other users who have appeared on the game screen in the storage device, and the user's game screen based on the history stored by the history storage control means (51) When it is determined that the information related to the same other user who does not associate with the user has appeared more than a predetermined number of times, it functions as a recommendation means (52) that recommends the other user to the user as a candidate for the friend It is a program for.

  According to the present invention, it is possible to actively apply a friendship relationship matching from the game management device side to the user, and smoothly apply for a friend to a partner who is interested in the user without trouble. To.

It is explanatory drawing which shows the structural example of the game system which concerns on one embodiment of this invention. It is a block diagram which shows an example of the hardware constitutions of a game management apparatus. It is a block diagram which shows an example of the hardware constitutions of a terminal device. It is explanatory drawing which shows an example of the main screen of a game. It is explanatory drawing which shows an example of a friend candidate list screen. It is explanatory drawing which shows an example of an opponent selection screen. It is explanatory drawing which shows an example of a battle play screen. It is explanatory drawing which shows an example of the screen which a game server recommends a friend candidate to a user. It is a functional block diagram which shows an example of the basic functional structure of a game management apparatus. It is explanatory drawing which shows an example of the information regarding a user's game. It is a functional block diagram which shows an example of main functional structures of a game management apparatus. It is explanatory drawing which shows an example of the log | history of the information regarding the other user who appeared on the user's game screen. It is explanatory drawing which shows the other example of the screen on which a game server recommends a friend candidate to a user. It is a flowchart which shows the example of a basic operation | movement which actively sets matching of friend relationship construction with respect to a user from the game server side. It is a functional block diagram which shows the other example of main functional structures of a game management apparatus. It is a flowchart which shows an example of selection operation | movement of the rival candidate (friend candidate) by a game server. It is a flowchart which shows the other example of the operation | movement which actively sets matching of friend relationship construction with respect to a user from the game server side. It is explanatory drawing which shows the other example of the screen on which a game server recommends a friend candidate to a user. It is a functional block diagram which shows the other example of a functional structure of a game management apparatus. It is a functional block diagram which shows the other example of a functional structure of a game management apparatus. It is explanatory drawing which shows an example of a battle | competition start screen. It is explanatory drawing which shows an example of the assistant selection screen other than a friend. It is explanatory drawing which shows an example of the battle start screen in which the assistant was set. It is explanatory drawing which shows the other example of the screen on which a game server recommends a friend candidate to a user. It is explanatory drawing which shows an example of the screen in a community room.

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

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

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

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

  As a form of providing a game service by the game server 1, a game program (application software) is installed in the game server 1, and a game operation is not performed on the terminal device 3 but on the terminal device 3. There is a form in which a game is executed on the game server 1 in response to an input, and the execution result is transmitted to the terminal device 3 of each user. For example, the game server 1 provides a so-called browser game in which a game can be played by a web browser installed in the terminal device 3 of each user. Alternatively, the game server 1 provides a so-called cloud gaming service in which a game video as a result of executing a game on the game server 1 is transmitted to the terminal device 3 in, for example, a streaming format.

  Alternatively, as will be described later, a game system in which part or all of the game execution program is installed on the user's terminal device 3 side and the game execution processing is also performed on the terminal device 3 can be provided.

  In the present embodiment, an example in which a browser game is provided will be described as one form of game service provided by the game server 1. In the service form for providing the browser game, it is not necessary to download or install software dedicated to the game on the user's terminal device 3, and the user can easily connect to the game server anywhere as long as the terminal device 3 can be connected to the network 4. The game service provided from 1 can be enjoyed.

  In this game system, the game server 1 executes arithmetic processing and data processing for progressing the game in response to an input operation on the terminal device 3 of each user. Then, the game server 1 updates the game information of each user in the database server 2 based on the execution result of the arithmetic processing and the like, and web page information for displaying the execution result on the screen of the user terminal device 3 (Game screen data) is transmitted to the terminal device 3 of each user.

  Each user's terminal device 3 is equipped with a web browser having a website browsing function as a user agent so that the web page information transmitted from the game server 1 can be displayed on the screen of the terminal device 3. It has become. Examples of the terminal device 3 include a mobile phone terminal, a PHS (Personal Handy-phone System) terminal, a personal digital assistant (PDA), and a smartphone that is a mobile terminal in which a mobile phone and a mobile information terminal are integrated. Various terminals such as personal computers (hereinafter referred to as “PCs”), tablet computers, game devices having communication functions, etc. that can be connected to the game server 1 via the network 4 and receive game services can be applied. it can.

  In addition, the game provided in the present embodiment can have a so-called social game element that allows the user to play while interacting with other users who are receiving game services. For example, by incorporating the game server 1 and the database server 2 of the present embodiment into a social networking service (SNS) system, a game system that provides a social game service as one of the SNS services can be obtained. In this way, a game service can be provided to the user by a game system operating on the SNS platform, but the game server 1 and the database server 2 can be constructed as independent game systems without being incorporated into the SNS system. Good.

  Examples of games provided by the game management device include baseball, soccer, tennis, American football, basketball, volleyball, golf, boxing, horse racing, car racing and other sports / racing games, simulation games, and training games. Various games such as role-playing games and quiz games can be used regardless of the game format and genre. As an example, in the present embodiment, an example in which the game server 1 manages a baseball game will be mainly described below.

  The game management device according to the present embodiment not only displays a random candidate list only when the user A performs an operation for voluntarily creating a friend as in the prior art, but also on the game management device side. The user A is actively engaged in matching for building a friendship relationship, and the other user B is recommended as a friend candidate to the user A. That is, when the number of times of other users B appearing on the screen of the user A becomes a predetermined number of times or more (for example, 3 times or more), and the user A is interested in the other users B, the game management device is moved in a timely manner. The user B is recommended as a friend candidate to the user A. As a result, while playing a game, the user A smoothly makes a friend application to the other user B who has appeared on the screen of the user A many times in the past and is interested in it without taking time and effort. Will be able to. As a lead for making friends, the game management device selects user B (C, D...) Satisfying a predetermined selection criterion from other users who are not friends with user A, and this user B ( C, D...) Appears more frequently than usual on the game screen of user A. Below, the detail of a structure of the game management apparatus (game server 1 grade | etc.,) Which concerns on this Embodiment which implement | achieves this is demonstrated.

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

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

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

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

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

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

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

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

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

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

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

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

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

  The sound processing unit 36 converts an analog audio signal into a digital audio signal when audio is input from the audio input unit 37, generates an analog audio signal based on a sound generation instruction from the CPU 31, and outputs it to the audio output unit 38. Output. The voice input unit 37 includes a microphone or the like built in the terminal device 3 and is used, for example, when voice chat or the like is performed. The audio output unit 38 includes a speaker that outputs sound effects when the game is executed.

  The auxiliary storage device 39 is a storage device that stores various programs and data. As the auxiliary storage device 39, for example, a flash memory drive, a hard disk drive, a memory card reader / writer, or the like can be used.

  The operation input unit 40 receives a user operation input and outputs an input signal corresponding to the operation input to the CPU 31 via the bus line 42. Examples of the operation input unit 40 include a pointing device such as a keyboard and a mouse. Further, in the case of the terminal device 3 in which the display unit 35 is configured as a so-called touch screen by mounting a touch panel (contact input type interface) on the screen of the display unit 35, the touch panel also becomes the operation input unit 40.

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

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

[Game description]
In this embodiment, a baseball game in which a user owns a player character corresponding to a real player of MLB in the game and creates his / her team using the player character is taken as an example.

  The player character owned by the user can be in a card format in which the form of the player character is visible on the screen of the terminal device 3. That is, the player character is managed as a digital player character by the game server 1 and displayed on the screen of the user terminal device 3. Further, the player character may be drawn by three-dimensional computer graphics in a game or the like in the game. Further, a player character, a ball object, or the like may be displayed as a moving image in a streaming format or the like. The user can collect player characters while advancing the game, form his own original team, and play against other users. Since the user's player character corresponds to a real player of MLB, a user's own dream team made up of players who are active in MLB is virtually enjoyed. In addition, the user can improve the ability of the player character (that is, nurture the character) by synthesizing the collected player characters, and enjoy the game with the aim of creating a stronger team.

  Parameters such as “individual ability”, “cost”, “tone”, “score”, etc. are set for the player character. The individual ability when the player character is a fielder can be “blow”, “running power”, “defense”, or the like. Further, when the player character is a pitcher, it can be set as “sphere power”, “ball control”, “change” or the like. Each player character is set with a parameter (attribute) called “cost” according to the ability level. When the user creates his / her team, the player character must be rostered within the maximum total cost. Here, “Roster” is a registered player (one army registered player) character that can participate in a battle in the game. Other expressions such as “deck” may be used instead of “roster”.

  Each player character is set with a parameter called “tone” for determining how much ability can be exhibited. With this tone, the ability of the player character is adjusted within a range of 20% to 100%, for example. When the player character is a fielder, performance parameters such as “batting rate”, “batting point”, and “home run” are also set. When the player character is a pitcher, performance parameters such as “defense rate”, “number of wins”, “number of losses” are set. These various parameters set for each player character are updated according to the actual performance and results of the real players in the real world.

  FIG. 4 shows an example of the main screen (my page) of the game. On this main screen, user game information 81 (user photo or avatar, user game level, action power points, total cost, number of player characters, various in-game points, number of friends, etc.) is displayed. In addition, a button group 82 for selecting various modes such as a battle button 83 and a community entry button 84 is displayed on the main screen.

  Moreover, in this game, users can build friendships. Here, friendship is a collective term for virtual relationships between players built in the game. Acquaintance, friend, friend, classmate, partner, relative, family, brother, sister, company or organization colleague Including various in-game relationships. In this game, the closeness of two people increases as the number or frequency of interaction between two people in a friendship relationship increases, and accordingly, the relationship changes gradually with acquaintances, friends, best friends, friends, and allies. .

  The main screen is provided with a display area 85 for the user's associates, and a predetermined number of associate photographs or avatars are displayed. In addition, the photograph etc. of the friend who is not displayed can be displayed by pushing the direction key 86 provided in the right and left of this friend's display area 85. FIG. In addition, a text display area 87 is also provided on the main screen, so that the latest information on friends can be confirmed.

  As one form for a user to establish a friendship relationship with another user, either one of the two users makes a friend application to the other user via the game server 1, and the friend application is made. The friend application made between both users and the operation of the approval that the received user approves becoming a friend via the game server 1 are mentioned. As another form, when a user who has already been registered in the game service invites an unregistered user to the game, and the user who has been invited registers in the game service, the user who has been invited is set to 2 There is also a form in which human users are friends.

  In the game of the present embodiment, there are mainly two forms as a form in which a user applies to another user for a friend. One of them is a mode in which a user performs an operation for voluntarily creating a buddy to display a buddy candidate list on the screen, and a user selects a partner who wants to be a buddy and makes a buddy application. An example of this form will be described below.

  A user who is looking for a new friend performs input for displaying a friend candidate list on his / her terminal device 3 (for example, an operation of pressing a “find new friend” button not shown). The game server 1 executes processing for extracting fellow candidate users in accordance with information related to the input by the user, and displays the fellow candidate list illustrated in FIG. 5 on the screen of the user terminal device 3. A predetermined number (four in FIG. 5) of fellow candidate display areas 151 are provided on the fellow candidate list screen. Each friend candidate display area 151 displays the avatar (or photo), name, game level, etc. of the friend candidate user. A user looks for the information of the friend candidate currently displayed in the friend candidate list, and searches for the other party who applies for a friend. In addition, you may make it change to the screen which displays the more detailed information regarding the said fellow candidate by clicking the avatar or name of a fellow candidate. If the partner that the user wants to become a friend is not included in the friend candidate list, the update button 152 may be pressed. Thereby, the game server 1 extracts a fellow candidate again, and updates a fellow candidate list.

  Each friend candidate display area 151 is provided with an application button 153. When there is a partner who the user wants to become a friend in the friend candidate list, the user can apply for the friend by clicking the application button 153 of the partner. In addition, when the application button 153 is clicked, a transition to a message input screen (not shown) may be made so that a friend application can be made after inputting an arbitrary message to be attached at the time of friend application.

  Another form in which the user applies to other users for fellow applications is that the user A recommends the user A as another candidate for the user A from the game server 1 side, and the user A responds to the user A requesting the fellow application. It can be done. An example of this form will be described below.

  User A can play a match with another user (baseball game in the present embodiment) by selecting a match button 83 in the main screen. If the user A selects the battle button 83, the screen changes to the opponent selection screen of FIG. On this screen, a predetermined number (four in FIG. 6) of opponent candidates selected by the game server 1 are displayed in a list. In the opponent candidate information display area 151, the opponent candidate's photo or avatar, name, level, total cost, competition result, and the like are displayed. Here, the opponent candidates displayed on the game screen of the user A are selected by the game server 1 as follows.

  While the user A is playing a battle, on the game server 1 side, a “rival candidate” (second user who can be a fellow candidate) is selected from past opponents based on a predetermined standard. For example, a predetermined number of “rival candidates” are selected from the opponents of the last 20 games (for example, within 5 players). As the selection criteria, for example, the following criteria or a combination thereof can be adopted.

(A) The access frequency to the game (once a day or about once every 3 days), the battle frequency, the winning rate, the number of friends, the game start date, age, level, etc. are the same as that of user A or Difference is within the specified range

(B) The match result was antagonized (for example, the score difference was within 2 points)
(C) Different game teams (however, the league is the same)

  The criterion (A) focuses on the commonality with the user A. Other users who have commonality with user A are likely to be interested from user A when they are recommended as fellow candidates in the future. The level indicates the degree of progress in the game, the degree of technology, and the like, and some games include what are called stages, levels, titles, and the like. The above criteria (B) and (C) are based on suitability as rivals. The opponent who played close battles in past battles is suitable as a rival. Each user selects one favorite team from the 30 MLB teams in the real world and sets it as his team. From the viewpoint of rivals, other users than the team set by the user (but the same league) are suitable.

  The reason for selecting a “rival candidate” from the opponents of the most recent predetermined game (for example, 20 games) is often not remembered by the user for opponents who have gone back several hundred games, for example. If it is about the last 20 games, it is highly likely that the user remembers having played in the past, and is likely to be interested as a rival (and as a fellow candidate). Instead of selecting “rival candidates” from the most recent predetermined game, select “rival candidates” from the opponents within a predetermined period (for example, within one month) going back from the present based on the above selection criteria. May be.

  After selecting the “rival candidate” as described above, the game server 1 puts part or all of the “rival candidates” in the opponent candidate list illustrated in FIG. 6 and is selected by the user A as the opponent. Make it easy. That is, the “rival candidate” selected by the game server 1 is more likely to be displayed as a list of opponent candidates for the user A than other users who are not selected as “rival candidates”. For example, the “rival candidate” is displayed in the opponent candidate list with a probability of 20%, and the probability that other users are displayed in the opponent candidate list is 1% or less. Accordingly, the user B (C, D...) Selected as the “rival candidate” appears more frequently on the opponent A selection screen than the other users who are not selected as the “rival candidate”. Here, as shown in FIG. 6, the corresponding user displayed as the “rival candidate” and displayed on the screen of the user A may be displayed with a display 157 “rival candidate”.

  Alternatively, other users who have become “rivals” (described later) of user A may be displayed preferentially (for example, at the top of the list) in the opponent candidate list.

  On the opponent selection screen, if the user A selects one opponent to fight against from the opponent candidate list and presses the enter button 156, the screen changes to the battle play screen illustrated in FIG. On the left side of the game screen, the roster 158 of the team of the user A is arranged, and on the right side of the screen, the roster 159 of the opponent team is arranged. Also, the player character 160 standing at the batting table and the player character 161 throwing are displayed with highlights. In addition, a scoreboard 162 is displayed on the screen so that the progress of the score can be confirmed, and a runner icon 163 can be displayed to check the output status. Also, a text display area 164 is provided in the game screen during the battle play, and the game result of the battle play simulation and the current game situation are displayed in a simple sentence. Streaming video may be displayed when there is a chance of a runner appearing in the scoring area.

  Here, when the same “rival candidate” (for example, user B) is selected by the user A as the opponent more than a predetermined number of times (for example, three times or more), the “rival candidate” is set to “rival”. The

  For the user, “rival” is a presence that is attracting considerable interest due to repeated battles, and therefore, the user B set as “rival” gives a chance to become a friend of the user A from the game server 1 side. For example, as illustrated in FIG. 8, the sub-window 165 is displayed on the screen of the user A during the game, and the fictional character 166 is companion with the user B who is “rival” with respect to the user A. Produce like talking to. In FIG. 8, in the text display area 167, "Mr. B is now the third match. Mr. B has been recognized as your rival. How about joining with rival B?" An example in which a message is displayed is shown.

  At this time, an information display area 168 and a friend application button 169 relating to another user (user B in the example of FIG. 8) recommended by the game server 1 as a friend candidate are also displayed. In the information display area 168, for example, a photograph or avatar of the user B, a name, a level, a total cost, a total win / loss, a win / loss of the battle with the user A, and the like are displayed. Here, if the user A presses the friend application button 169, a friend application can be made to the user B recommended by the game server 1.

  In parallel, the user B on the “rival” side may be encouraged to actively recommend from the game server 1 so as to become a friend with the user A.

  If the user A does not want to apply for a friend to the user B recommended, the sub window 165 is closed by pressing the close button 170.

  As described above, in the present embodiment, only when the user A performs an operation for voluntarily creating a friend, not only the friend candidate list is displayed at random, but also from the game server 1 side to the user A. On the other hand, matching of the friendship construction is actively performed, and another user B who appears more than a predetermined number of times on the user A's game screen is recommended to the user A as a friend candidate. That is, while the user A plays a game, the game management device creates a natural flow of “rival candidates” → “rivals” → “companies” (the game management device supports such a flow). ), Make a lead made by friends.

  In the above, a user B (C, D...) That satisfies a predetermined selection criterion is selected as a “rival candidate” from other users who are not friends with the user A, and this user B (C, D...) The game server 1 is executing a process of intentionally increasing the frequency of appearing on the game screen of the user A (the opponent candidate list). Regardless of such processing, there may be a case where the same opponent appears on the screen of the user A multiple times, and even in that case, the user A may be interested in the opponent. Therefore, when the same user B appears on the screen of the user A a plurality of times, the user B may be recommended to the user A from the game server 1 side as a friend candidate.

[Functional configuration and operation of game management device]
Next, an example of a functional configuration of the game management device that realizes the baseball game will be described. FIG. 9 is a functional block diagram showing a basic configuration of a game management device (game server 1 and database server 2) that communicates with the terminal device 3.

  The game management apparatus according to the present embodiment includes user information storage control means 60, reception means 61, game execution means 62, screen generation means 63, transmission means 64, access management means 65, and the like. Each of these means is realized by the CPU 11 of the game server 1 executing the program according to the present embodiment.

  The user information storage control means 60 stores and manages information related to each user's game in the database server 2. FIG. 10 shows an example of information related to the user's game stored in the database server 2 by the user information storage control means 60 (in this example, information for one user ID = 000001).

  The user information storage control means 60 associates basic information about each user such as a login ID, password, user name (nickname used in the game), team, etc. The data is stored in a predetermined storage area of the server 2. Here, the login ID and password are used for login authentication when each user operates the terminal device 3 to access the game server 1. The user name and the team are arbitrary information set by the user when the user registers to use the game service or when the game is executed for the first time. The user name and team are displayed on the game screen as necessary.

  Further, the user information storage control means 60 stores information on the user's game level in a predetermined storage area of the database server 2 in association with the user ID. In this baseball game, for example, experience values are accumulated as the user progresses the game, and the level of the user is increased when the experience value reaches a certain amount.

  Further, the user information storage control means 60 stores the information of the player character obtained and owned by the user in the game in a predetermined storage area of the database server 2 for each user ID in association with the user ID. . In addition, the database server 2 has a player database (player DB) in which image data, player names, positions, teams, ability values, costs, etc. of player characters are stored in association with player IDs. Based on the player ID stored by the user information storage control means 60, the server 1 can acquire the image data of the player character corresponding to the player ID.

  Further, the user information storage control means 60 stores various points (including values corresponding to points) and items owned by the user in the game in a predetermined storage area of the database server 2 in association with the user ID. To do.

  In addition, the user information storage control means 60 associates the user ID with a battle ID for uniquely identifying the result of the battle between the user's team and another user's team in a predetermined storage area of the database server 2. Remember. Further, the database server 2 is associated with the battle ID, the battle date and time, the user ID of the winning team, the user ID of the defeated team, the battle score, the winning pitcher character, the defeating pitcher character, the player character who hit the home run, A battle database is stored in which information on battle results such as battle critical information is stored. Therefore, the past battle results of each user can be acquired from the battle database.

  Further, the user information storage control means 60 stores the fellow user ID in a predetermined area of the database server 2 in association with the user ID. Further, the user information storage control means 60 stores the user IDs of other users selected as the above-mentioned rival candidates in a predetermined area of the database server 2 in association with the user ID. Further, the number of battles with the user (user ID = 000001) is also stored in association with each rival candidate. In addition, the user information storage control unit 60 stores the user IDs of other users who have been recognized as rivals in a predetermined area of the database server 2 in association with the user ID.

  Next, the receiving means 61, the game executing means 62, the screen generating means 63, and the transmitting means 64 shown in FIG. 9 will be described. The reception unit 61 and the transmission unit 64 are functions realized by the CPU 11 and the communication control unit 15 of the game server 1.

  When the game screen is displayed by the web browser of the user's terminal device 3, when the user performs an input operation to select a selectable button object or a character string with a hyperlink on the game screen, Information regarding the input (game screen request or the like) is transmitted to the game server 1 by the web browser of the terminal device 3. In the game server 1, when the receiving means 61 receives the information related to the input, the game executing means 62 executes the game by reading out information related to the user's game in accordance with the information and performing calculations and data processing.

  For example, in the case where the user performs an input operation to play against another user's team in the battle mode, the game execution means 62 is a player of both teams corresponding to the user IDs of both users who are playing the battle. Information on the characters (characters participating in the game) is read from the database server 2. Then, the game execution means 62 executes a baseball game simulation based on parameters such as the ability of the player characters of both teams by an AI (Artificial Intelligence) program or the like, and determines the outcome of the game.

  Next, the screen generation means 63 will be described. The screen generation unit 63 generates game screen data composed of, for example, HTML data in accordance with the execution result of the game execution unit 62. The HTML data may include image data such as characters read from the database server 2. Moreover, the script (program) which operate | moves by the plug-in of the web browser of the terminal device 3 may be embedded in HTML data. When the script provided from the game server 1 is executed by the terminal device 3, the game screen displayed on the terminal device 3 can be a moving image. Alternatively, the screen generation unit 63 may generate a video in a streaming format.

  In addition, the transmission unit 64 uses the screen data (HTML data, streaming format video data, etc.) generated by the screen generation unit 63 as a response to the request for the game screen or as an execution result by the game execution unit 62. It transmits to the terminal device 3. In the terminal device 3 of the user who has received the game screen data, the game screen is displayed on the display unit 35 by a web browser and its plug-in.

  Next, the access management means 65 will be described. When a user who wants to receive a game service operates the terminal device 3 to access (log in) the game server 1, the access management means 65 determines whether or not the user has a game participation qualification and performs login authentication. Do. An example of this authentication is authentication based on a login ID and password associated with a user ID. In addition, an individual identification number of a mobile phone or a smartphone that is the terminal device 3 (a terminal different from the telephone number is uniquely assigned so that the user does not have to input a login ID and a password each time the user accesses the game server 1. Identification information) or contractor's unique ID (information that uniquely identifies the contractor of the terminal and does not change as long as the contractor is the same even if the model is changed) Authentication may be performed.

  Next, the main functional configuration of the game management device (game server 1 and database server 2) will be described with reference to the functional block diagram of FIG. The game server 1 as a game management device mainly includes a history storage control unit 51 and a recommendation unit 52. Each of these means is realized by the CPU 11 of the game server 1 executing the program according to the present embodiment.

  The history storage control means 51 has a function of storing a history of information related to other users appearing on the user's game screen in a storage device (such as the database server 2). Here, as an example of “information on other users”, as shown in FIG. 6, other users' avatars, photos, names (may be nicknames) and the like can be cited. In addition, other users 'alternate characters (so-called player characters) appearing on the user's screen as opponents and cooperative players, characters owned by other users (in baseball games, belonging to other users' teams) Player character) or the like. Alternatively, as will be described later, other users may appear on the user's screen as the user's chat partner or the like. However, the manner in which information related to other users appears on the user's game screen varies depending on the type and content of the game. In the present embodiment, a case where another user appears on the user's game screen as the user's opponent or opponent candidate will be mainly described.

  FIG. 12 illustrates an example of a history of information related to other users who have appeared on the user's game screen, which is stored in the database server 2 by the history storage control unit 51. In the figure, information about the user A with user ID = 000001 is shown. As shown in the figure, the history storage control means 51 associates with the user ID of the user A the user ID, status flag, time information, etc. of other users who have appeared on the game screen of the user A in the database server 2. Remember.

  Here, the status flag is another user (flag = 0) that appears on the game screen only as the opponent candidate of user A, or is selected as the opponent by user A and actually contacts the user in the game. Is information for identifying whether the user is another user (flag = 1). Other users who appear on the game screen of the user A as opponent candidates are examined by the user A with a certain degree of attention as to whether or not they should be opponents. Therefore, even if it appears on the game screen of the user A as an opponent candidate, the user A can easily be interested. However, it is usually selected by the user A from the candidate list and actually has a direct contact with the user A in the game rather than other users who have just appeared on the game screen of the user A as opponent candidates. It is considered that other users are attracting and interested in the user A. Therefore, the information of the status flag is used when processing contents vary depending on whether another user who appears on the game screen of user A stays as an opponent candidate or is selected as an opponent by user A. (Details will be described later). Note that when both the opponent candidate and the opponent are handled in the same manner as other users appearing on the game screen of the user A, the information of the status flag can be omitted.

  Other users who appeared on the game screen (opportunity candidate list screen) of user A as the opponent candidates and selected as the opponent by user A from among them are the user A as the opponent candidate and the opponent. Appears on the game screen. In this case, since the opponent candidate becomes the opponent in the series of flows, the number of appearances of the user A on the game screen is counted as one in principle. Also, during the battle game (during the game of the baseball game), player characters owned by other users appear on the screen of the user A multiple times. The number of appearances is counted as one in principle. That is, when the user A battles with another user B, the information regarding the user B appearing on the game screen of the user A includes a user displayed as an opponent such as an avatar of the user B displayed as an opponent candidate. Although there is a player character of user B displayed during the battle play, such as B's avatar, the number of appearances of user B on the game screen of user A is one in principle. It is also possible to make this appear 3 times.

  Next, the recommendation unit 52 will be described. Based on the history stored in the database server 2 by the history storage control unit 51, the recommendation unit 52 has predetermined information about other users who have appeared on the user's game screen and are not in a friendship relationship with the user. When it is determined that the number of times has been reached, the user has a function of recommending the other user as a fellow candidate. Here, the predetermined number of times can be arbitrarily set, for example, three times or five times. For user A, it is considered that other user B who has appeared many times on his game screen is attracting interest. Therefore, when the number of times of the other user B appearing on the screen of the user A becomes a predetermined number or more and the user A is interested in the other user B, the game server 1 It is recommended to user A as a fellow candidate.

  Examples of screens displayed on the terminal device 3 of the user A by the recommendation process by the recommendation unit 52 are shown in FIGS. FIG. 8 is an example of a screen that is displayed when another user B appears as an opponent more than a predetermined number of times (for example, three times or more) on the user A battle play screen as described above. FIG. 13 is an example of a screen displayed when another user B appears a predetermined number of times or more (for example, 5 times or more) on the user A's opponent selection screen.

  Similarly to FIG. 8, the sub-window 165 is also displayed on the screen of FIG. 13, and an imaginary character 166 performs an effect of talking to the user A about whether to become a friend with the user B. FIG. 13 shows an example in which the message “Mr. B often appears on your game screen recently. How about joining Ms. B on this occasion?” Is displayed in the text display area 167. ing. As described above, when another user B appears as an opponent candidate on the screen of the user A, the other user B may be recommended to the user A as a fellow candidate.

  As described above, other users who have actually played against User A and have contact points in the game are more comfortable for the user than other users who have just appeared on User A's game screen as opponent candidates. Has become an impressive and intriguing presence. Thus, the predetermined number of times when the user A appears as an opponent on the game screen of the user A and the case where the opponent appears as an opponent candidate on the game screen of the user A (or when the opponent candidate and the opponent are mixed) The predetermined number of times may be different. That is, the former predetermined number of times is made smaller than the latter predetermined number of times. For example, if the same other user B appears as an opponent on the game screen of the user A, it is recommended as a fellow candidate with three or more appearances. On the other hand, if the same other user B appears as an opponent candidate on the game screen of the user A (or the opponent candidate and the opponent are mixed), for example, the friend appears with 5 or more appearances. Recommended as a candidate.

  By the way, it may take a long time for the number of times other user B appears on the game screen of user A to reach a predetermined number (for example, three times). For example, it may be the case where the number of appearances finally reaches three times over one year after the first appearance. Or it is a case where a period of one year or more is vacated from the second appearance to the third appearance. In such a case, it is considered that the memory of the other user B who has appeared on his screen in the past is weak for the user A. Therefore, the recommendation unit 52 determines that the information related to the same other user B appearing on the game screen of the user A has exceeded the predetermined number of times within a predetermined period (for example, within one month) retroactive from the present. In this case, it is preferable to recommend the other user B to the user A as a friend candidate.

  Here, a basic operation example in which matching for building a friendship is actively performed from the game server 1 side to the user A is shown in the flowchart of FIG.

  The game server 1 stores in the database server 2 a history of information related to other users who have appeared on the game screen of the user A when an avatar or the like of another user appears on the game screen of the user A (YES in S1). (S2). Thereby, as illustrated in FIG. 12, for example, the user IDs of other users who appear on the game screen are stored as a history in association with the user ID of the user A.

  Then, based on the history of FIG. 12 stored in the database server 2, the game server 1 has reached the predetermined number of times the number of appearances on the game screen of the same other user who is not affiliated with the user A. It is determined whether or not (S3). Here, if the game server 1 determines that the number of appearances of the same other user (for example, user B) has reached a predetermined number of times (YES in S3), the game server 1 recommends the user B as a friend candidate to the user A. (S4). For example, as illustrated in FIG. 8 or FIG. 13, the fictional character 166 performs an effect such that the user A talks to the user A about how to become a friend with the user B.

  Here, in the case where the user A performs input for friend application in response to the recommendation of an active friend candidate from the game server 1 side, for example, when the user A clicks the friend application button 169 in FIG. 13 (S5). The game server 1 executes the friend application process in response to the input (S6). That is, the game server 1 notifies the user B who has applied for a friend of the user A that the user A has applied for the friend.

  In addition, the user B who received the friend application confirms the information such as the game level of the user A received from the game server 1 on the screen of the terminal device 3, and performs an operation of selecting whether to approve or reject the friend. It can be carried out. Here, when the user B performs an operation of approving as a friend, the game server 1 establishes a friendship relationship between the user A and the user B according to this operation, and associates the user IDs of both the users A and B. The friend information registered in the database server 2 is registered. For example, as shown in FIG. 10, in a database storing user A information, the user ID of user B is stored as associate information in association with the user ID of user A. Similarly, in the database which memorize | stores the information of the user B which is not shown in figure, the user ID of the user B and the terminal device 3 of the user A and B with whom the friendship relationship was materialized are notified that the friend was established.

  On the other hand, in step S3, when the number of appearances of the same other user on the screen of user A is less than the predetermined number (NO in S3), the process ends without executing the recommendation process of the fellow candidates.

  For user A, it is considered that other user B who has appeared many times on his game screen is attracting interest. Therefore, the game server 1 of the present embodiment not only displays a random candidate list at random, but also from the game server 1 side when the user A performs an operation for voluntarily creating a friend. On the other hand, the matching of the companion relationship construction is actively set, and the other user B is recommended to the user A as a fellow candidate.

  Further, as shown in FIG. 5, when searching for a partner who wants to become a friend from a randomly extracted friend candidate list, the partner candidate interested in the user A is not included in the friend candidate list. While updating the candidate list, the user A often took time and searched for a partner who wanted to become a friend. On the other hand, in this configuration, when the number of times of the other user B appearing on the screen of the user A exceeds the predetermined number and the user A is interested in the other user B, the game server 1 side is timely Therefore, the user A is recommended as a friend candidate to the user A, so that the user A can smoothly make a friend without spending time and effort while playing the game.

  By the way, the recommendation means 52 is the case where another user B appears on the game screen of the user A multiple times by chance, or as described below, the game server 1 of the other user B that satisfies the predetermined criteria. As a result of increasing the appearance frequency on the game screen, the user A can be recommended to the user A as a friend candidate in any case where the other user B appears multiple times.

  Regarding the selection of opponent candidates when the user A battles, other users within a predetermined range based on a value (game level or total cost of the user A team, etc.) that is an index of the strength of the user A Can be selected at random. That is, an opponent candidate can be selected at random from other users who do not have an extreme difference with the strength of the user A. Even in this case, the same other user B may appear on the game screen of the user A as an opponent candidate (or selected by the user A as an opponent) more than a predetermined number of times. However, if it is left to chance (randomly), especially when the number of users registered in the game is as large as tens of thousands or more, it takes a long time to appear (or the probability of appearing a certain number of times is extremely high). May be low).

  Therefore, the user B (C, D...) (Second user) satisfying a predetermined selection criterion is selected from the other users who are not friends with the user A (first user), and the user B (C , D ...) is preferable to increase the frequency of appearance of the user A on the game screen. As shown in FIG. 15, the game server 1 for realizing this further includes a selection unit 53 and a partner management unit 54 in addition to the history storage control unit 51 and the recommendation unit 52.

  The selection means 53 has a function of selecting a second user B (C, D...) That can be a fellow candidate from other users who are not in a fellow relation with the first user A based on a predetermined selection criterion. Have. This function corresponds to the function of selecting the aforementioned “rival candidate” in the battle mode.

  Here, as the selection criterion, it is preferable that a second user who is likely to be interested in the first user A can be extracted. As an example of the selection criteria, as described above, the access frequency to the game, the number of friends, the game start date and time, age, level, and the like can be the same as or different from those of the first user A. In addition, as a selection criterion in the battle game as in the present embodiment, the battle frequency, the winning percentage, etc. can be the same as or different from those of the first user A. In addition, selection criteria for the opponent of the first predetermined game (for example, 20 matches) of the first user A and selection criteria for an opponent within one month retroactive from the present time can be applied. Furthermore, when positioning the 2nd user who can become a fellow candidate as a rival candidate of a battle | competition like the game of this Embodiment, the battle | competition result antagonized as mentioned above (for example, a score difference is less than two points) It is also possible to apply selection criteria such as a different set team in the game (but the league is the same).

  In addition, as the selection criterion, the above-described respective criteria can be employed alone or in various combinations. These are only examples, and various selection criteria can be applied depending on the type and content of the game.

  The timing at which the selection unit 53 executes the process of selecting a rival candidate (mate candidate) can be arbitrarily determined. For example, a rival candidate may be selected (updated) every time the first user A battles. Alternatively, the rival candidate may be selected once a day, and if the rival candidate is selected at the first battle of a certain day, the same rival candidate may be applied in the second and subsequent battles of that day. Alternatively, the selection of rival candidates may be once every three days, once a week, etc.

  As illustrated in FIG. 10, the user ID of the second user B (C, D...) Selected as the rival candidate (mate candidate) by the selection unit 53 is associated with the user ID of the first user A. Stored in the database server 2.

  Next, the partner management means 54 will be described. This partner management means 54 uses the information about the second user B (C, D...) Selected by the selection means 53 as the first user A's game play partner or partner candidate. Has a function of making the frequency of appearing on the screen during the game higher than the information regarding other users other than the second user B (C, D...). Here, “game play partner or opponent candidate” means, for example, an opponent, an opponent candidate, a cooperative play partner (a helper who cooperates in a battle, a cooperating member of a raid boss battle, etc.) or a cooperative play opponent candidate described later. And so on.

  An example in which the appearance frequency of the second user B (C, D...) Selected as a rival candidate (mate candidate) on the game screen of the first user A is higher than that of other users is shown below.

  As shown in FIG. 6, for example, four opponent candidates are displayed in the opponent candidate list displayed when the first user A battles. Note that the number of opponent candidates displayed in the opponent candidate list may be changed according to the size of the screen or the like. Further, the number of second users as rival candidates selected by the selection means 53 is five, for example (if there are less than five rival candidates that meet the selection criteria, the number of rival candidates may be four or less. is there). Then, when determining the user to be displayed in the opponent candidate list, the opponent management means 54 first draws a lottery with a predetermined winning probability (for example, 20%) for each second user who is a rival candidate. The second user who has been won is included in the opponent candidate list. Thereafter, the remaining frame of the opponent candidate list is randomly determined from other users other than the rival candidates (however, as described above, the opponent can be balanced with the strength of the first user A, May limit the strength of other users). In this case, the probability that other users other than the rival candidates will win the remaining frame of the opponent candidate list depends on the number of users registered in the game, but for example, several hundred or more users are registered. If it is a game, it will be 1% or less.

  It should be noted that all the second users selected as rival candidates can always be included in the opponent candidate list. However, in this case, only the same members are always displayed in the opponent candidate list, and for the first user A, the options for the opponent may be narrowed. The second user selected as the rival candidate appears on the opponent selection screen of the first user A with a moderate frequency, and directs other users other than the rival candidate to be included in the opponent candidate list. It is preferable.

  As described above, when selecting five second users as rival candidates, if the winning rate of each rival candidate is set to 20%, the average of the four opponent candidate lists will be averaged. One of the five rival candidates is displayed in one frame, and the other users are displayed in the remaining three frames. If rival candidates appear on the user's game screen at such a frequency, the user A will not feel uncomfortable when selecting an opponent.

  As a variation, of the n opponent candidate list frames (4 frames in the case of FIG. 6), m frames (m <n) are used as frames for displaying rival candidates (mate candidates) in advance. , (Nm) frames may be used as frames for displaying other users than the rival candidates. For example, m = 1 and one of the four frames is secured in advance as a display frame for rival candidates. And the user displayed on the display frame of the rival candidate is selected at random from, for example, five second users selected by the selection means 53. In addition, the users displayed in the (nm) frames are randomly selected from all the users other than the rival candidates.

  As in the above example, the second user B (C, D...) Selected as the rival candidate is the opponent selection screen of the first user A than the other users who are not selected as the rival candidates. The frequency of appearing in is increased. Then, as shown in FIG. 6, when the second user B who is a rival candidate is displayed on the screen of the first user A, a display 157 of “rival candidate” is attached, and the first user It is preferable to easily draw attention of A.

  As described above, in this configuration, the game server 1 increases the appearance frequency of the second user B (C, D...) That satisfies a predetermined selection criterion on the game screen of the first user A. In the course of playing the game, the first user A can be interested in the second user B (C, D...) And can be used as a lead for making friends. In particular, any selection criterion that allows the first user A to select a second user who is likely to be interested (for example, the game start date, age, place of birth, etc. is the same as or different from the first user A) If the second user is recommended to the first user A as a fellow candidate by chance, it will happen by a predetermined number of times. The possibility that the first user A is interested (thus trying to become a friend) can be increased as compared with other users who have appeared.

  By the way, as described above, the first user A is actually selected by the user from the opponent candidate list, rather than the other user who has just appeared on the game screen of the first user A as the opponent candidate. Other users who have contact points (compete against) directly in the game are impressively interested for the user A. Therefore, it is preferable to preferentially select the first user A and another user having a contact point in the game as a second user who can be a fellow candidate.

  In the game server 1 that realizes this, the history storage control means 51 is a database that stores at least a history of information related to other users who have contact points with the user in the game among the information related to other users appearing on the user's game screen. Store in server 2. For example, as shown in FIG. 12, it is another user (flag = 0) that appears on the game screen only as an opponent candidate of user A, or is selected as an opponent by user A and is actually A status flag that identifies whether the user is another user having a contact (flag = 1) is stored in association with the user ID of another user who has appeared on the screen of user A.

  Here, examples of “other users who have contact points with the user in the game” include, in addition to the opponent, cooperative play opponents (helpers of the battle play, cooperative members of the raid boss battle, etc.), in-game community rooms You can list the other parties who have a conversation (chat). These are merely examples, and the manner in which the user and other users have direct contact in the game varies depending on the type and content of the game.

  And the selection means 53 of this Embodiment is a user who is not affiliated with the 1st user A based on the history of the information regarding the 1st user A and the other user who has the contact in the game. The second user who is a rival candidate (mate candidate) is given priority over other users who have had contact with the first user A in the game in the past over other users who have never had contact. Select as user.

  Here, an example of the selection operation of rival candidates (mate candidates) by the game server 1 of the present embodiment will be described below with reference to the flowchart of FIG.

  When the selection means 53 of the game server 1 selects the rival candidate of the first user A, the history storage control means 51 has a contact with the first user A stored in the database server 2 in the game. Based on the history of information regarding other users, it is determined whether or not there is another user who has contact with the first user A in the game (such as a battle) (S11). Here, for example, the first user A may have forgotten about an opponent who has played a battle more than a year ago, so there is a time limit within a predetermined period (for example, one month) going back from the present. It is preferable to perform the determination in step S11.

  In the case of YES in step S11, the selection means 53 selects a rival candidate that satisfies a predetermined selection criterion from other users who have contact with the first user A in the game (S12). Here, as described above, as the selection criteria, the criteria for the opponents of the last 20 games, the criteria for the access frequency to the game, the number of friends, the game start date, age, level, etc. (or a combination thereof) are adopted. be able to.

  Thereafter, it is determined whether or not a predetermined number, for example, five rival candidates have been selected (S13). For example, if the first user A is a user who has just started the game and has hardly played the game or has been away from the game access for a while, the selection criterion as the rival candidate is The number of second users to be satisfied may be less than five (NO in S13). In that case, a person who satisfies the selection criteria related to the game start date, age, etc. is selected as a second user who is a rival candidate from other users who have no contact with the first user A in the game. (S14).

  In step S11, when there is no other user who has contact with the first user A in the game (NO in S11), the process proceeds to step S14, and the first user A contacts with the first user A in the game. Select 5 rival candidates from other users who have never had

  In this way, the other user who has contact with the first user A in the game is preferentially selected as the second user who is the rival candidate.

  With this configuration, other users who seem to have a strong interest in the user and have direct contact with the user in the game (for example, other users who have been selected by the user from the candidate list and actually played against the user) ) Can be preferentially recommended as fellow candidates. Therefore, it is possible to increase the possibility of the user applying for a friend for the friend candidate recommended by the game server 1, and to promote the building of the friend.

  In addition, the recommendation means 52 targets only the other user who appears on the game screen of the user A with a predetermined number of contacts (for example, three times or more) in the game with the user A as a fellow candidate. You may recommend it. In other words, it is not enough to simply appear on the candidate list screen, and it is a condition of fellow candidates that it appears more than a predetermined number of times on the screen of user A with direct contact as an opponent or the like. Candidates are recommended to user A. This is because, as described above, the opponent who has been selected as the opponent for the predetermined number of times (for example, three times or more) by the user A and actually battled is set as “rival”, and this “river” is set as the game server 1. Corresponds to recommending to the user A as a friend candidate.

  Here, the flowchart of FIG. 17 shows an example of an operation in which the game server 1 side actively sets matching for building a friendship for the user A.

  When the user A clicks the battle button 83 in the main screen illustrated in FIG. 4 and selects the battle mode (YES in S21), the selection means 53 of the game server 1 selects the rival based on a predetermined selection criterion. A candidate (mate candidate) is selected (S22). For example, a predetermined number (for example, five) of rival candidates is selected from the opponents of the last 20 matches of user A. As the selection criteria, the above-described various criteria can be adopted.

  Thereafter, the game server 1 generates an opponent candidate list (see FIG. 6) including a part or all of the rival candidates selected by the selection means 53, and displays it on the screen of the terminal device 3 of the user A (S23). Thereby, a rival candidate becomes easy to be selected as an opponent from user A.

  Here, if the user A selects one opponent to fight against from the opponent candidate list (YES in S24), the game server 1 displays the battle play screen illustrated in FIG. (S25). At this time, the history storage control means 51 of the game server 1 associates the history of information related to other users who have been selected by the user A and appeared on the battle play screen as the opponent with the user ID of the user A, and 2 (S26).

  Thereafter, the game server 1 determines based on the history stored in the database server 2 whether or not the same user (for example, user B) has been selected as an opponent by the user A three or more times (S27). ). In this case, a time limitation of three times or more may be added within a predetermined period (for example, one month) retroactive from the present. Here, when the same user B is selected as the opponent by the user A three times or more (YES in S27), the game server 1 sets the user B to “rival” (S28).

  Then, the recommendation means 52 of the game server 1 recommends the user B set as “rival” to the user A as a fellow candidate at the start of the battle play, during the battle play, or at the end of the battle play (S29). For example, as illustrated in FIG. 8, the fictional character 166 performs an effect to talk to the user A about how to become a friend with the user R who is a “rival”. If the user A presses the friend application button 169 in response to the effect, a friend application can be easily made to the user B.

  In the operation example of this flowchart, the user A who is considered to be strongly interested in the user A (that is, selected by the user A from the candidate list and actually directly with the user A more than a predetermined number of times in the game) Therefore, it is possible to increase the possibility that the user A applies for the friend candidate recommended by the user A. Thereby, promotion of friend construction can be aimed at.

  In addition, when the recommendation unit 52 of the game server 1 recommends the other user B who is “rival” to the user A as a fellow candidate, the recommendation means 52 of the game server 1 also recommends the user A to the other user B on the “rival” side in parallel. It is preferable to recommend (S30). For example, the recommendation means 52 generates the screen effect illustrated in FIG. 18 when the terminal device 3 of the user B accesses the game server 1. In other words, the sub-window 165 is displayed in the game screen of the user B, and an effect is made such that the imaginary character 166 talks to the user B about whether or not to become a friend with the user A. In FIG. 18, in the text display area 167, “Mr. A has played with you three times, so you and Ms. A have been recognized as good rivals. How about becoming a friend with Ms. A”? The message is displayed.

  At this time, an information display area 168 related to the user A recommended by the game server 1 as a friend candidate and a friend application button 169 are also displayed. In the information display area 168, for example, a photograph or avatar of the user A, a name, a level, a total cost, a total winning / losing, a winning / losing of the battle with the user B, and the like are displayed. Here, if the user B presses the friend application button 169, the friend application can be made to the user A recommended by the game server 1. Note that if the user B does not want to apply for a friend to the recommended user A, the sub window 165 is closed by pressing the close button 170.

  As described above, it is preferable that matching between the user A and the user B from the game server 1 side is actively made for matching of friendship construction. Thereby, for example, a friend application may be sent to the user A first from the user B. In this case, the user A is interested in the other user B who has appeared many times on his game screen. The possibility of approving the fellow application is higher than usual. Therefore, it is possible to make it easier to build friendships.

[Other configuration examples of the game system]
In each of the above-described embodiments, a game execution program is installed on the game server 1 side, and the game server 1 performs arithmetic processing and data processing for game progress in response to an input operation on the terminal device 3 of each user. The application example to the game system in which the game progresses by transmitting the screen data reflecting the execution result to the terminal device 3 has been described. This is a so-called client-server game system, and is an example in which a game management device is configured by servers (game server 1 and database server 2). As described above, this configuration is suitable for providing users with services such as browser games, social games, and cloud gaming, but the configuration of the game management device is not limited to this.

  For example, the game server 1 manages game information of each user and provides game services such as exchange between users in the game to the user. The present invention can also be applied to a game system performed on the terminal device side.

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

  The server and the terminal device can communicate with each other to send and receive various data, and are information processing devices (computers) each including a CPU, ROM, RAM, auxiliary storage device, communication control unit, and the like. The hardware configuration is as follows. Therefore, in a game system including a server and a terminal device, each means included in the game management device described in each of the above embodiments may be provided in either the server or the terminal device. In other words, the game management device can be configured to be provided in a server and a terminal device that communicate with each other to send and receive various data, and achieve the same effects as the above-described embodiment.

  For example, in FIG. 11, the game server 1 includes the history storage control unit 51 and the recommendation unit 52. However, as illustrated in FIG. 19, the function of each unit may be provided in either the server or the terminal device. Is possible. Here, the hardware configuration of the server shown in FIG. 19 is the same as that of the game server 1 shown in FIG. 2, and the hardware configuration of the terminal device is the same as that of the terminal device 3 shown in FIG. FIG. 19 shows a configuration example in which the recommendation unit 52 is provided in the server 101 and the history storage control unit 51 is provided in the terminal device 301. FIG. 19 shows an example of the configuration of the game system, and other configurations are possible.

  Further, as shown in FIG. 20, the terminal device 302 may include a history storage control unit 51 and a recommendation unit 52. That is, the game management device can be mounted on the terminal device 302 itself, which is a game terminal. In this case, the same effects as those of the above-described embodiment can be obtained. In this case, the server 102 manages the game information of each user and provides the user with services such as greetings and messages sent and received between the terminal devices 302, but all other processing is performed on the terminal device 302 side. Can be executed in Alternatively, management of game information of each user can also be performed on the terminal device 302 side of each user.

  Further, the selection means 53 and the partner management means 54 described above can be provided not only on the server side but also on the terminal device (game terminal) side.

[Other Embodiments]
In the above-described embodiment, the player A's opponent candidates are listed, and the game in which the user A can select any opponent from the list has been described. However, the present invention can also be applied to the following games. . That is, when the user A performs a battle, the game management device automatically determines the user A's opponent without presenting the opponent candidate. Also in this case, when the same other user B appears more than a predetermined number of times as the opponent of the user A, the game management device recommends the other user B to the user A as a friend candidate. Moreover, the selection means 53 selects the 2nd user B (C, D ...) which can become a fellow candidate based on the predetermined | prescribed selection reference | standard from the other users who do not have a fellow relation with the 1st user A. The opponent management means 54 determines the frequency at which the second user B (C, D...) Appears as the opponent of the first user A from other users other than the second user B (C, D...). And make it a lead for fellow applications.

  Moreover, in the above-described embodiment, the case where another user appears on the game screen of the user A as the opponent or the opponent candidate of the user A has been mainly described, but the present invention is not limited to this. The manner in which information about other users appears on the game screen of user A varies depending on the type and content of the game, and variations thereof will be described below.

  When the user A battles with the opponent, in a game in which another user can cooperate with the battle as the “assistant” of the user A, the other user can select the “helper” or “helper” candidate as the screen of the user A. There is an opportunity to appear. Here, if the game is such that not only the friend of user A but also other users who are not affiliated with each other can also become “helpers”, the “helper” and / or “helper” of the same other user who is not affiliated with user A When the number of appearances of the screen as a candidate becomes a predetermined number or more, the recommendation unit 52 recommends the other user to the user A as a fellow candidate. A specific example is shown below.

  FIG. 21 shows an example of a battle start screen that is displayed after the user A selects an opponent in a game in which a “helper” can be called during the battle. The battle start screen is provided with an opponent team information display area 171 and an own team information display area 172. The opponent team information display area 171 displays, for example, the opponent user's avatar, name, game level, total cost, competition results, and the like. In addition, the own team information display area 172 displays the user's own avatar, name, game level, total cost, competition results, and the like.

  In addition, on the battle start screen, a “call friend's assistant” button 173 is displayed so that an arbitrary friend (or friend character) can be requested as an assistant. When the user A clicks the button 173, the screen changes to an assistant selection screen (not shown), and the friends who are in a friendship relationship with the user A are listed. User A can select any friend and set it as an assistant. Thus, the exchange with a friend can be promoted by making a friend call a helper.

  Furthermore, a “call a helper other than a friend” button 174 is also displayed on the battle start screen, so that another user (or the character) who is not in a fellowship can request it as a helper. In this way, by making it possible for a user other than a friend to call a helper, it is possible to give an opportunity to make a friend and promote the making of the friend. When the user A clicks the button 174, the screen changes to an assistant selection screen (other than friends) illustrated in FIG. In this assistant selection screen, a plurality of assistant candidate display areas 176 are provided, and “assistant” candidates selected by the game server 1 from other users who are not in a friendship relationship with the user A are listed. Is displayed. In the assistant candidate display area 176, for example, avatars, names, game levels, total costs, competition results, and the like of “assistant” candidates are displayed.

  In addition, the game management apparatus displays the same user B (C, D...) Selected by the selection unit 53 based on a predetermined selection criterion and having no friendship with the user A as a “helper” candidate on the screen of the user A. By increasing the frequency of being performed, the user A who is helped can be favored and interested in the “assistant” candidate, and can be used as a lead to the fellow application. Here, selection criteria (conditions) of other users who are candidates for “helpers” (people who are not in a friendship relationship with user A) are the above-described selection criteria for friend candidates (for example, access frequency to the game, battle frequency, win rate). The number of friends, game start date and time, age, level, etc. are the same as or different from user A).

  User A selects a partner who wants to request “helper” from the listed “helper” candidates, and presses enter button 177. Accordingly, the screen is switched to the battle start screen illustrated in FIG. 23, and the partner selected by the user (user B in the example of FIG. 23) is set as the “helper” other than the fellow in the helper setting area 179 other than the fellow. Is done. FIG. 23 shows an example in which a fellow “helper” is also set in the fellow helper setting area 178.

  When the user A presses the battle start button 175 on the battle start screen of FIG. 21 or FIG. 23, a battle command is transmitted from the user terminal device 3 to the game server 1, and a battle process is executed in the game server 1. . Here, as shown in the screen of FIG. 23, when a friend of user A and / or a user other than the friend is set as a “helper”, the user depends on the ability of the player character possessed by the “helper”, etc. The team A's strength is improved compared to the case where “helper” is not set. Here, the user B who cooperated with the battle of the user A as a “helper” other than the friend corresponds to the user A and another user who has a contact point in the game.

  For example, when the same user B is selected a predetermined number of times (for example, 3 times) by the user A as a “helper” other than a friend, recommended at the start of a match play, during a match play, or at the end of a match play The means 52 recommends the user B to the user A as a friend candidate. For example, as illustrated in FIG. 24, the fictional character 166 talks to the user A about how to become a friend with the user B who has cooperated in the battle as a “helper” many times. Produce. In FIG. 24, the message “Mr. B has helped your team three times. How about joining Ms. B on this occasion?” Is displayed in the text display area 167. An example is shown. If the user A presses the friend application button 169 in response to the effect, a friend application can be easily made to the user B.

  Note that another user B who is not in the same relationship with the user A sometimes becomes an opponent or may become an “assistant”. Therefore, the total of the number of times the same other user B who is not in a friendship relationship with the user A is selected by the user A as the opponent and the number of times the user A is selected as the “helper” has become a predetermined number. In this case, the game management device may recommend the user B as a friend candidate to the user A.

  Next, as another variation, a community room in the game (a virtual shared space in which a plurality of users can enter) will be described. If the user A clicks the community entry button 84 on the main screen shown in FIG. 4, the screen changes to a room selection screen (not shown). A plurality of community rooms are displayed on the room selection screen, and the user A can select and enter any room that is not full. If it is a baseball game, this community room can be made into the virtual sports bar where the fans of a specific team gather, for example.

  When the user A enters the community room, the screen transitions to the screen in the community room illustrated in FIG. This screen is provided with a member board 180 for displaying a list of members who have entered the same room. In the present embodiment, twelve member display areas 181 are provided in the member board 180, and one of them is a user display area 181a in which an object (photograph, avatar, etc.) representing the user is displayed. Yes. Each member display area 181 displays a photo, an avatar, or the like of another user who has entered the same room. In addition, if each member display area 181 is clicked (or the cursor is moved to each member display area 181), more detailed information (name, game level, total cost, competition result, etc.) of other users may be viewed. it can.

  Further, the screen is provided with a real-time information display area 182 for displaying the real-time baseball game situation of the user's favorite team in real time. The real-time information display area 182 displays a scoreboard, current batter information, current pitcher information, output status, ball count, and the like. The real-time information display area 182 may display a live broadcast video of the MLB game (for example, a streaming live broadcast video). The screen is provided with a real-time bulletin 183 that can be written and viewed only by members who have entered the room. Therefore, real-time communication can be enjoyed while watching MLB matches between fans of the same team. User A can also specify a specific other user in the room and enjoy a chat.

  Here, the history storage control means 51 uses the database server 2 as the other users B, C, D... That the user A happens to be together in the community room in the game as other users who appear on the game screen of the user A. To remember. In addition, when the user A chats with a specific other user (or specified by another user), as the other user who has a direct contact with the user A in the game, The history storage control means 51 stores in the database server 2. For example, when the user A has been together with the same other user B more than a predetermined number of times in the community room, the recommendation means 52 of the game management device recommends the user B to the user A as a friend candidate. At the same time, user A is recommended to user B as a fellow candidate.

  In addition, the user A, the selection means 53 of the game management device, may be connected to other users B, C, D,.. , D... Are preferentially selected as opponents (or opponent candidates) in the game. And the other party management means 54 makes the frequency of user B, C, D ... (2nd user) who appears on the screen in the game of the user A higher than usual. For example, it is easy to appear on the screen during the game of the user A as the “helper” candidate or as the opponent candidate, and is used as a lead to the friend application.

  In this way, with respect to another user B (C, D...) That has appeared on the screen of user A in one mode in the game (or has interaction with user A), the other party of user A in another mode in the game The frequency of appearing as (or a partner candidate) can be made higher than that of other users, and can be used as a lead for fellow application.

  Next, as another variation, a so-called raid boss battle will be described. The raid boss battle is a cooperative play in which a plurality of users form a party (group) and face each other while cooperating with each other. For example, in a baseball game, a plurality of users gather to form a mixed team, and cooperate with the boss team together. Also, for example, in a monster game, a plurality of users gather to form a party, and the boss monsters are subjugated together. In such a raid boss battle, the game management device increases the frequency of the other same users being included in the party cooperating with the user A, and makes them interested in each other to serve as a lead to the friend application. Here, selection criteria (conditions) for other users (persons who are not in a friendship relationship with the user A) who increase the frequency of cooperation with the user A can adopt the same criteria as the selection criteria for the friend candidates described above. For example, the access frequency to the game, the number of friends, the game start date / time, age, level, etc. from among other users who played cooperatively with user A in the raid boss battle within one month from the present A selection criterion can be applied such that the same as or different from A is within a predetermined range.

  By the way, regarding a configuration having a storage control function for storing various types of information in the storage device (history storage control means 51 and the like), the storage device itself is not included in the configuration, so the inside and outside of the game management device (or game system) Regardless of where it is installed. For example, the storage device is a RAM 13 or auxiliary storage device 14 that the game server 1 has, a database server 2, a RAM 33 or auxiliary storage device 39 that the terminal device 3 has, or a file server (online that is different from the game management device or terminal device). Storage) or the like.

  The configurations described in the above embodiments can be applied in appropriate combination.

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

1 Game server (game management device)
2 Database server (game management device)
3 Terminal device 4 Network 11 CPU
12 ROM
13 RAM
14 Auxiliary storage device 51 History storage control means 52 Recommendation means 53 Selection means 54 Partner management means 101, 102 Server (game management device, game system)
301, 302 Terminal device (game management device, game system)

Claims (9)

A game management device for managing a game in which users can build friendships,
History storage control means for storing in the storage device a history of information related to other users who have appeared on the user's game screen;
On the basis of the history stored by the history storage control means, it appeared directly on the game screen of the user, if the information relating to the same other users not in the user and buddy relationship is determined to have become equal to or larger than a predetermined plurality of times And a recommendation means for recommending the other user to the user as a friend candidate. A selection means for selecting a second user who can be a fellow candidate based on a predetermined selection criterion from other users who are not in a fellow relation with the first user;
The frequency with which information relating to the second user selected by the selection means is made to appear on the screen during the game of the first user as the partner or partner candidate of the first user's game play is set to be different from that of the second user. The game management device according to claim 1, further comprising opponent management means for making the information higher than information about other users. The history storage control means stores, in a storage device, a history of information related to other users who have contact points in the game with the user among information related to other users appearing on the game screen of the user,
The selection means is a user who is not in a friendship relationship with the first user, and who has had contact with the first user in the game in the past. The game management device according to claim 2, wherein the game management device selects the second user with priority over the user. The recommendation means, game management device of claim 3 Recommend other users that appeared in the user game screen with a predetermined plurality number of times or more contacts in the user game, as fellow candidates to the user.   The game management device according to claim 1, wherein the recommendation unit recommends the user as a friend candidate to another user recommended as a friend candidate. The game management device according to claim 1, configured as a server capable of communicating with a game terminal device operated by a user. The game management device according to claim 1, which is configured as a game terminal device operated by a user. The game management device according to any one of claims 1 to 5, wherein the game management device is configured as a game system including a server and a terminal device that communicate with each other, and each of the means is provided in either the server or the terminal device. . A program for causing a computer to operate as the game management device according to any one of claims 1 to 5 , wherein the program causes the computer to function as each unit included in the game management device .

Images