JP2014071567A - Game controller, game control method, program, game system, and information processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To accelerate a construction of a relation between new users.SOLUTION: A game controller of the present invention performs the following processing when searching a target user in a network based on a link showing relations among users. Prescribed first numerical information is associated with the target user. Numerical information having the closest to the first numerical information is specified among pieces of numerical information associated with users within the range of the prescribed number of links from a first user satisfying a prescribed condition. Numerical information is associated with the first user on the basis of the specified numerical information, and the number of links between a second user associated with the numerical information and the first user. Reference users are sequentially changed on the basis of a link of the network in accordance with input information of a search user for searching the target user. A changed reference user is notified the search user in a case that the numerical information is associated with the changed reference each time the reference user is changed.

Description

  The present invention relates to a technique for controlling the progress of a game by each user in accordance with each operation of a plurality of users.

  In recent years, a so-called social game (Social) executed by a game application created on the basis of an operating environment such as an API (Application Programming Interface) that operates on a web browser in a social networking service (SNS) by a specific service provider. Game) is popular. It can be said that the social game is a kind of online game that is played while communicating among an unspecified number of users. If a user can connect to the Internet and has a communication terminal equipped with a web browser, the user can enjoy a social game regardless of time and place.

  One of the features of the above-described social game is that it has a richer communication function for interacting with users than conventional online games. In social games, for example, in addition to the execution of a game in cooperation between related users (companies), information exchange by communicating with the companion such as greetings and communication with the companion, items on the game with the companion Gifts or items have been exchanged. As an example of such a social game, a digital card game (Dragon Collection (registered trademark)) described in Non-Patent Document 1 below is known.

App STYLE Vol.5 (East Press, issued on November 15, 2011), pages 7-8

  As a conventional social game, for example, a cooperation game between a plurality of users in which a plurality of users cooperate to attack a common enemy character is known. In a cooperative game, a privilege is given to a user according to the number of times one of a plurality of users who are playing the game cooperatively attacks an enemy character within a predetermined period of time. Known about the game. However, in the conventional cooperative game, a plurality of users participating in the cooperative game tend to be limited to fixed users who are known to each other, and are not configured to expand communication between new users. In other words, the conventional cooperative game has not been provided with a mechanism that facilitates building a relationship between new users.

  The present invention has been made in view of the above-described viewpoints, and an object thereof is to provide a game control device, a game control method, a program, a game system, and an information processing device that can promote the establishment of a relationship between new users. And

A first aspect of the present invention is a game control device,
An association means (51) for relating users;
Setting means (52) for setting a target user as a search target user in a network based on a link indicating a relationship between users;
First association means (53) for associating predetermined first numerical information with the target user;
A determination means (54) for determining whether or not each user satisfies a predetermined condition;
Of the numerical information associated with the user within the range of the predetermined number of links from the first user satisfying the predetermined condition on the network, the numerical information closest to the first numerical information is associated. Identifying means (55) for identifying the second user
Based on the numerical information specified by the specifying means (55) and the number of links between the second user and the first user associated with the numerical information, the first information is associated with the first user. 2 association means (56);
A changing means (57) for sequentially changing a reference user as a search reference user based on the link of the network, in accordance with input information of a search user for searching for a target user;
Each time the reference user is changed by the changing means (57), if numerical information is associated with the changed reference user, a presentation means (58) for presenting information based on the numerical information to the searching user. When,
Is provided.

In this game control device, the “reference user” at the start of the search is not limited to a specific user. The “reference user” at the start of the search may be a search user or a specific user other than the search user.
In this game control apparatus, the “predetermined conditions” may be set arbitrarily, but from the viewpoint of distributing the processing load, conditions that satisfy different timings for each user are preferable. For example, the predetermined condition may be that the user has accessed the game.
In this game control device, “user input” means an input of pressing operation of a predetermined operation button on the user's communication terminal, an input of touch operation on the display screen for the communication terminal having a touch panel function, and an acceleration sensor. It may be an operation input by shaking a communication terminal provided, or an operation input by gesture (gesture input). In gesture input, by performing a predetermined gesture on a communication terminal having an imaging function, the communication terminal recognizes an image of the gesture and recognizes an operation input previously associated with the gesture. In the case of a communication terminal capable of executing a voice recognition program, the user input may be performed by voice.
In this game control device, “numerical information” indicates a user to be processed when a network between users formed based on a link indicating a relationship between users is viewed as a social graph with each user as a node. It may be the number of links on the shortest path between the node and the node indicating the target user (that is, the distance on the network). For the number of links, weights may be set for links between users depending on, for example, the degree of relationship between users. The “information based on numerical information” is not limited to the numerical information itself, and may be text information corresponding to the numerical information (for example, text such as “still far” or “a little more”) or according to the numerical information. It may be sound information of strength or frequency.

  In this game control device, a search user is configured to execute a search game for searching for a target user by sequentially changing a reference user and following a network based on a link indicating a relationship between users. Since information based on numerical information such as the distance between the reference user and the target user is presented to the search user, the search user can advance the search while recognizing the distance to the target user. In this search game, if the target user is not related to the search user, the search user can find another target that is not related to himself / herself in the process of searching for the target user or to efficiently find the target user. It is motivated to communicate with a user (eg a reference user). Therefore, according to this game control apparatus, it can accelerate | stimulate building the relationship between new users.

  In this game control device, when each user satisfying a predetermined condition is the first user, the numerical information associated with the first user is the known numerical information of the second user, the second user and the first user. Determined based on the number of links in between. Then, numerical information is sequentially associated with a user having a small number of links with a target user associated with the predetermined first numerical information in advance, when a predetermined condition is satisfied. Such determination of numerical information for each user is performed every time each user satisfies a predetermined condition. Therefore, in addition to the processing load timing being distributed, the processing itself is also performed from the first user to the target user. Since this is not a process for obtaining the shortest path, it is a process with a relatively low load.

  In this game control apparatus, the process of associating numerical information with the first user (that is, the process related to the determination means, the specifying means, and the second association means) is related to the search process (that is, related to the change means and the presentation means). Processing) itself may be performed in parallel. Even when both are performed in parallel, the process of associating the numerical information with the first user is performed at a timing when the user in the network satisfies a predetermined condition, and the numerical information associated with the reference user in the search The process of presenting the information based on the search user is performed at the timing when the reference user is changed. That is, the process of associating numerical information with the first user and the search process are performed in a distributed manner on the time axis.

  In this game control device, when the reference user is changed according to the input information of the search user, the distance to the target user is known by referring to the numerical information associated with the changed reference user. It is not necessary to calculate the distance (number of links) from the reference user to the target user every time the user is changed, and there is an advantage that the processing load for searching is extremely low.

In the game control device, the predetermined condition may be that a user accesses a game.
In the said game control apparatus, when each user in a network satisfies predetermined conditions, matching with the numerical information of each user is performed. That is, the numerical information associated with each user is newly associated, or the numerical information already associated is updated. Such processing timings are preferably distributed in order to reduce the processing load. Since the timing at which each user in the network accesses the game is considered to be relatively random, it is advantageous to reduce the processing load when the user accesses the game under a predetermined condition.
The “access” may be access to a specific event in a game, a specific game element (mini game, etc.), or a specific stage, in addition to access accompanying authentication processing such as access to a game.

  In the game control device, the predetermined condition may be that a time assigned at random for each user or a time assigned according to a predetermined rule for each user has been reached. This also is advantageous in reducing the processing load because the timing of the association processing for the numerical information of each user is dispersed.

  In the game control device, the setting means (52) may set a plurality of target users, and the second association means (56) may associate numerical information with the first user for each target user. . In this configuration, since the user can perform searches for a plurality of target users in parallel, it is possible to enhance the interest as a search game.

The game control apparatus further comprises a closeness setting means (59) for setting a closeness according to the degree of the relationship between users between the users related by the related means (51), The association means (56) may associate numerical information with the first user such that the number of links between adjacent users on the network is adjusted according to the closeness between the users.
In this configuration, numerical information is associated with each user in accordance with the degree of relationship between adjacent users on the network. That is, the weight of the link on the network is not constant among users, and numerical information is associated with each user based on the weight of the link according to the degree of relationship between users. Thus, for example, when there are a plurality of routes between the reference user and the target user, the numerical information provided to the user depending on the change of the reference user by the user input, that is, depending on the route adopted by the user. Since the information based on the case may be different, the interest as a search game can be further enhanced.

The game control apparatus may further include a grant unit (60) that grants a privilege to the search user when the reference user matches the target user.
"Bonus" can be set arbitrarily, giving points that can be used on the game, setting and adjustment on the game that favors progress in the game, or granting items that favor progress on the game It may be that an item not directly related to the progress of the game is given. By providing the grant means (60), the motivation for the search user to find the target user can be enhanced.

In the game control device, the second association means (56) adds the numerical information specified by the specifying means (55) and the number of links between the second user and the first user. Numerical information associated with the first user may be calculated.
In this configuration, since the numerical information associated with each user on the network is calculated by the addition operation, the processing load when calculating the numerical information is reduced. For example, when the second user is a fellow user associated with the first user, since the number of links is 1, the numerical information associated with the first user is simply used as the numerical information of the second user. On the other hand, it can be calculated by an operation of adding 1.

The second aspect of the present invention is:
Steps to relate users,
Setting a target user that is a search target user in a network based on a link indicating a relationship between users;
Associating predetermined first numerical information with the target user;
Determining whether each user satisfies a predetermined condition;
Of the numerical information associated with the user within the range of the predetermined number of links from the first user satisfying the predetermined condition on the network, the numerical information closest to the first numerical information is associated. Identifying a second user,
Associating numerical information with the first user based on the numerical information specified by the specifying step and the number of links between the second user and the first user associated with the numerical information;
Sequentially changing a reference user, which is a search reference user, based on the link of the network according to input information of a search user who searches for a target user;
When numerical information is associated with the changed reference user each time the reference user is changed, a step of presenting information based on the numerical information to the searching user;
A game control method comprising:

A third aspect of the present invention relates to a computer.
A function to relate users,
A function for setting a target user who is a search target user in a network based on a link indicating a relationship between users;
A function of associating predetermined first numerical information with a target user;
A function for determining whether or not each user satisfies a predetermined condition;
Of the numerical information associated with the user within the range of the predetermined number of links from the first user satisfying the predetermined condition on the network, the numerical information closest to the first numerical information is associated. A function to identify the second user,
A function of associating numerical information with the first user based on the numerical information specified by the specifying function and the number of links between the second user and the first user associated with the numerical information;
A function of sequentially changing a reference user, which is a user serving as a search reference, based on the link of the network, according to input information of a search user who searches for a target user, and
When numerical information is associated with the changed reference user each time the reference user is changed, a function of presenting information based on the numerical information to the searching user,
It is a program for realizing.

  The computer may be a network server, a large computer, or the like, for example. Further, this program may be stored in a computer-readable information storage medium such as a DVD-ROM or a CD-ROM.

A fourth aspect of the present invention includes a communication terminal (10) and a server (20) configured to be accessible from the communication terminal (10) and controlling execution of a game by the communication terminal (10). A game system,
Association means (51) for relating users;
Setting means (52) for setting a target user as a search target user in a network based on a link indicating a relationship between users;
First association means (53) for associating predetermined first numerical information with the target user;
Determining means (54) for determining whether or not each user satisfies a predetermined condition;
Of the numerical information associated with the user within the range of the predetermined number of links from the first user satisfying the predetermined condition on the network, the numerical information closest to the first numerical information is associated. Identification means (55) for identifying the second user
Based on the numerical information specified by the specifying means (55) and the number of links between the second user and the first user associated with the numerical information, the first information is associated with the first user. 2 association means (56),
A changing means (57) for sequentially changing a reference user as a search reference user based on the link of the network in accordance with input information of a search user for searching for a target user; and
Each time the reference user is changed by the changing means (57), if numerical information is associated with the changed reference user, a presentation means (58) for presenting information based on the numerical information to the searching user. ,
Either one of the communication terminal (10) and the server (20) includes these means.

A fifth aspect of the present invention is an information processing apparatus,
An association means (51) for relating users;
Setting means (52) for setting a target user as a search target user in a network based on a link indicating a relationship between users;
First association means (53) for associating predetermined first numerical information with the target user;
A determination means (54) for determining whether or not each user satisfies a predetermined condition;
Identification means for identifying numerical information closest to the first numerical information among numerical information associated with a user within a predetermined number of links from a first user satisfying the predetermined condition on the network (55)
Based on the numerical information specified by the specifying means (55) and the number of links between the second user and the first user associated with the numerical information, the first information is associated with the first user. 2 association means (56);
A changing means (57) for sequentially changing a reference user as a search reference user based on the link of the network, in accordance with input information of a search user for searching for a target user;
Each time the reference user is changed by the changing means (57), if numerical information is associated with the changed reference user, a presentation means (58) for presenting information based on the numerical information to the searching user. When,
Is provided.

  In the above, in order to facilitate the understanding of the present invention, the reference numerals shown in the drawings are appropriately described in parentheses, but this restricts the game control device and the like according to the present invention to the illustrated embodiment. It is not a thing.

  According to the game control device, the game control method, the program, the game system, and the information processing device of the present invention, it is possible to promote the establishment of a new relationship between users.

The figure which shows the basic composition of the game system of embodiment. The figure which shows the example of the external appearance of the communication terminal of embodiment. The block diagram which shows the structure of the communication terminal of embodiment. The block diagram which shows the structure of the game server of embodiment. The block diagram which shows the structure of the database server of embodiment. The figure which shows the structural example of a user database. The figure which shows the structural example of a search database. The figure which shows the data structural example of the adjacent list | wrist of the social graph which shows a fellow relation. The figure which shows the structural example of distance data. The figure which shows an example of the social graph which shows friendship. The figure which shows an example of the aspect in which the number of links is set in a social graph. The figure which shows an example of the aspect in which the number of links is set in a social graph. The figure which shows an example of the aspect in which the number of links is set in a social graph. The figure which shows an example of the aspect in which the number of links is set in a social graph. The figure which shows an example of the aspect in which the number of links is set in a social graph. The figure which illustrates a series of web pages displayed in a user's communication terminal. (A) illustrates the web page displayed in a user's communication terminal, (b) is a figure which shows the social graph corresponding to the said web page. (A) illustrates the web page displayed in a user's communication terminal, (b) is a figure which shows the social graph corresponding to the said web page. (A) illustrates the web page displayed in a user's communication terminal, (b) is a figure which shows the social graph corresponding to the said web page. (A) illustrates the web page displayed in a user's communication terminal, (b) is a figure which shows the social graph corresponding to the said web page. (A) illustrates the web page displayed in a user's communication terminal, (b) is a figure which shows the social graph corresponding to the said web page. (A) illustrates the web page displayed in a user's communication terminal, (b) is a figure which shows the social graph corresponding to the said web page. The functional block diagram for demonstrating the function to play main roles with the game control apparatus of embodiment. 6 is an exemplary flowchart illustrating a neighbor list update process according to the embodiment. The flowchart which shows the update process of the distance data of embodiment. The flowchart which shows the search process of embodiment. The figure which illustrates the web page displayed in a user's communication terminal in the modification of embodiment. The functional block diagram for demonstrating the function which plays a main role with the game control apparatus which concerns on the modification of embodiment. The figure which shows the structural example of closeness data. The functional block diagram for demonstrating the function which plays a main role with the game control apparatus which concerns on the modification of embodiment. The figure which shows the sharing example between a communication terminal, a game server, and a database server about each function of a game control apparatus.

  Hereinafter, embodiments of the present invention will be described.

(1) Configuration of Game System FIG. 1 shows a system configuration example of a game system according to the embodiment. As shown in FIG. 1, the game system includes communication terminals 10a, 10b, 10c,... That can be connected to a communication network NW (network) such as the Internet, a game server 20 connected to the communication network NW, The database server 30 is configured. Each of the communication terminals 10a, 10b, 10c,... Is a terminal operated by an individual user, for example, a mobile terminal, a smartphone, a PDA (Personal Digital Assistant), a personal computer, a television having a bidirectional communication function. A communication terminal such as a John receiver (including a so-called multi-function smart TV). In the following description, when referring to the communication terminals 10a, 10b, 10c,.
In this game system, the game server 20 is configured to be able to communicate with the communication terminal 10 that is a client, and provides a gaming service to the communication terminal 10. The game server 20 is mounted with an application operable on a web browser as a game application. The database server 30 stores various information to be described later in executing the game, and is connected to the game server 20 by, for example, a wire for reading and writing the information.
The communication terminal 10 includes a web browser capable of displaying a web page provided by the game server 20, and the user executes a game by operating the web page on the communication terminal 10.

  Although not shown in FIG. 1, an authentication server for authenticating the user of each communication terminal 10 may be provided separately from the game server 20. Further, when a plurality of game servers 20 are provided in order to accept access from many communication terminals 10, a load balancer for adjusting a load between the plurality of game servers 20 may be provided. The game server 20 may be configured as a single server device, but may be configured as a plurality of server devices having distributed functions.

(2) Configuration of Communication Terminal The communication terminal 10 will be described with reference to FIGS. 2 and 3.
FIG. 2 is a diagram illustrating an example of the appearance of the communication terminal 10, and FIG. 2A illustrates a button input type communication terminal such as a foldable mobile terminal (mobile phone), for example. ) Exemplifies a communication terminal of a touch panel input method such as a smartphone. FIG. 3 is a block diagram showing an internal configuration of the communication terminal 10.
As shown in FIG. 3, the communication terminal 10 includes a CPU (Central Processing Unit) 11, a ROM (Read Only Memory) 12, a RAM (Random Access Memory) 13, an image processing unit 14, an instruction input unit 15, a display unit 16, A communication interface unit 17 as a signal transmission / reception unit is provided, and a bus 18 for transmitting a control signal or a data signal between the units is provided.

The CPU 11 loads the web browser in the ROM 12 into the RAM 13 and executes it. And CPU11 is based on the appropriate designation | designated of URL (Uniform Resource Locator) input to a user by the instruction | indication input part 15 grade | etc., Data for displaying a web page from the game server 20 via the communication interface part 17, That is, data of an object such as an HTML (HyperText Markup Language) document and an image associated with the document (hereinafter collectively referred to as “HTML data” as appropriate) is acquired via the communication interface unit 17. Interpret HTML data. The communication terminal 10 may be mounted with various plug-ins for extending the browser function of the web browser.
In acquiring the HTML data, the CPU 11 sends an access request message including a user ID (user identification information) registered in advance or a user ID input via the instruction input unit 15 via the communication interface unit 17. The game server 20 is notified.

  The web browser displays the web page provided from the game server 20 on the display unit 16 based on the acquired HTML data via the image processing unit 14. When the user selects a hyperlink or menu on the web page by operating the instruction input unit 15, the web browser transmits new HTML data for displaying the web page according to the selection. (That is, update of the web page) is requested to the game server 20.

  The image processing unit 14 displays a web page on the display unit 16 based on display image data provided from the CPU 11 as an analysis result of HTML data. The display unit 16 is, for example, an LCD (Liquid Cristal Display) monitor including thin film transistors arranged in a pixel unit in a matrix, and drives the thin film transistors based on the display image data to display the image of the web page on the display screen 16a. To display.

  When the communication terminal 10 is a button input type communication terminal (FIG. 2A), the instruction input unit 15 includes a plurality of instruction input buttons such as a direction instruction button and a decision button for accepting a user operation input. The button group 15 b includes a button group 15 a and a plurality of instruction input buttons such as a numeric keypad, and includes an interface circuit for recognizing a pressing (operation) input of each button and outputting it to the CPU 11. For example, the direction instruction button is provided to instruct the CPU 11 to scroll and display the web page displayed on the display unit 16. The determination button instructs the CPU 11 that the user selects one hyperlink or menu that is actively displayed (for example, highlighted) when, for example, a plurality of hyperlinks or menus are displayed on a web page. To be provided. When the communication terminal 10 is configured by a small portable terminal, these buttons are provided on the front surface of the communication terminal 10 so that the user can easily operate (click) with the thumb while holding the communication terminal 10 with one hand. It is preferable to arrange | position. In the example shown in FIG. 2A, the button group 15b is arranged below the button group 15a, and a plurality of instruction inputs in which “0” to “9”, “*”, and “#” (numeric keys) are written. Includes buttons.

  When the communication terminal 10 is a touch panel input type communication terminal (FIG. 2B), the instruction input unit 15 mainly accepts touch panel type input by touching the display screen 16a with a fingertip or a pen. The touch panel input method may be a known method such as a capacitance method. As shown in FIG. 2B, the button group 15a may be provided even when the communication terminal 10 is a touch panel input method.

  For example, when the communication terminal 10 is a portable terminal, the menu selection operation on the web page displayed on the communication terminal 10 is selected by pressing the direction instruction button and selecting by pressing the enter button. This is done by confirming the selected menu. Further, for example, when the communication terminal 10 is a touch panel input method, the selection operation is performed by instructing (touch operation) a menu position on the display screen 16a on which the web page is displayed with a finger or a pen.

(3) Configuration of Game Server The configuration of the game server 20 will be described with reference to FIG.
The game server 20 manages a game website including a plurality of hierarchical web pages, for example, and provides a game web service to the communication terminal 10. As shown in FIG. 3, the game server 20 includes a CPU 21, a ROM 22, a RAM 23, a database (DB) access unit 24, and a communication interface unit 25, for transmitting control signals or data signals between the units. A bus 26 is provided. In addition, the game server 20 can take the same structure as a general-purpose web server regarding hardware.

The ROM 22 stores an application program that provides a service for displaying an object such as an HTML document or an image (displaying a web page) to the web browser of the communication terminal 10 that is a client. The ROM 22 stores various data referred to by the CPU 21 in addition to the application program.
The CPU 21 loads the game program in the ROM 22 to the RAM 23 and executes it, and performs various processes via the communication interface unit 25.

For example, the CPU 21 transmits HTML data to the communication terminal 10 via the communication interface unit 25. In addition, when the game server 20 performs the authentication process of the user of the communication terminal 10, the CPU 21 performs the authentication process.
CPU21 performs the process according to the hyperlink or menu selected by the user on the web page displayed on the communication terminal 10 via a communication interface part. The processing includes, for example, transmission of new HTML data, arithmetic processing in the game server 20 or data processing.
The database access unit 24 is an interface when the CPU 21 reads / writes data from / to the database server 30.

(4) Configuration of Database Server The database server 30 (storage device) can be realized by a general-purpose storage such as a large-capacity hard disk device or a device such as a RAID (Redundant Array of Inexpensive Disks). Each database in the database server 30 is configured to be able to read and write data from the CPU 21 via the database access unit 24 of the game server 20.
FIG. 5 shows an example of the configuration of the database server 30. As shown in FIG. 5, the database server 30 includes a user database 31 and a game database 32.

  The type of game realized by the game system of the present embodiment is not particularly limited. However, in the following, as an example of the game of the present embodiment, a target is selected from a plurality of users registered in the game. A search game for finding a user (hereinafter referred to as “game of the present embodiment” as appropriate) is taken up. In the game of this embodiment, a user who performs a search is referred to as a “search user”, and a “target user” that is a user who is a search target. In the game of this embodiment, as described later, it is possible to associate specific users as friends, and the search user finds a target user by tracing the friendship between users starting from himself / herself. ing. Until the target user is found, the search user sequentially changes the user as a search reference so as to follow the friendship. The user serving as a search reference is hereinafter referred to as a “reference user”.

  Here, when the user is regarded as a node and the relationship between users as a link (also referred to as an edge), it can be considered that all the users participating in the game form a social graph. In this social graph, when the node corresponding to the search user is “departure node”, the node corresponding to the reference user is “reference node”, and the node corresponding to the target user is “target node”, the search of this embodiment The game corresponds to searching for a route from a starting node to a target node in a social graph (user network) based on a link indicating a relationship between users while sequentially changing reference nodes.

FIG. 6 shows an example of the user database 31 applied in the game of the present embodiment. In this example, for each user ID (user identification information), the user database 31 includes a user name, a user image, a progress level, physical fitness points, search data (search ID, reference user), privilege points, and fellow user IDs. Contains information about the item. Information included in the user database 31 can be updated sequentially by the game server 20.
In the following description, the user ID included in the user database 31 or data for each user name (to be described later) specifying the user is generically referred to as user data. Information of each item constituting user data is as follows.

-User name It is a user name displayed in order to identify the user of the communication terminal 10 at the time of execution of a game. The user name is text having a predetermined length or less designated in advance by the user. The user name is a name that identifies the user on the network environment (or game community) provided by the game server 20.
User Image A user image is an avatar image selected in advance by the user, for example.
Progress level data indicating the progress level of the user on the game. For example, it is a level value in a range from Lv1 (level 1) to Lv100 (level 100). For example, the progress level may be increased every time the number of game executions reaches a predetermined number.
-Physical strength point In the game of this embodiment, it is a point equivalent to a user's physical strength required in order to advance a game. For example, in the game of the present embodiment, each time the reference user is changed, a predetermined amount of physical strength points may be consumed, and a predetermined amount may be recovered (increased) every time a predetermined time elapses.
-Search data Search data contains search ID and the user ID of the user who becomes a reference user. The search ID is identification information for specifying a search mission.
-Bonus point In the game of this embodiment, it is the accumulation value of the privilege point which the user acquired by searching successfully and searching for the target user.
・ Friend's user ID
This is data of another user ID associated with the target user ID.

  Returning to FIG. 5, the game database 32 stores information related to the progress of the game executed by the game server 20 and a search database based on the access from the game server 20. Information relating to the progress of the game may include various information depending on the nature of the game. Taking the case of the game of the present embodiment as an example, the information related to the progress of the game may include detailed results about the search of each user.

  The search database describes data for each of a plurality of search missions given to the user in the game of the present embodiment. A data configuration example of the search database is shown in FIG. As shown in FIG. 7, each mission is associated with a search ID. The data of each item in the search database shown in FIG. 7 is as follows.

Target user This is the user ID of a user who is a target user for searching for a specific mission.
-End time This is the time when the search for a specific mission ends. In the game of the present embodiment, the search user is awarded a privilege point when the target user is found by the end time.
-Bonus points Bonus points given to search users when a specific mission is successfully searched.

  In the game of the present embodiment, a network including links indicating user friendships is managed by a social graph. For example, based on the data of the fellow user ID written in the user database, an adjacency list indicating a social graph indicating the fellow relation is generated and stored in the RAM 23. FIG. 8 shows a data configuration example of the neighbor list. As illustrated in FIG. 8, the adjacency list is data indicating each user ID and one or more other users associated with the user ID as associates as adjacent nodes on the social graph.

In the game of this embodiment, distance data that associates distance information (numerical information) with the target user for each user in the network is stored in the RAM 23. FIG. 9 shows a data configuration example of the distance data. In the distance data of FIG. 9, distance information (for example, the shortest number of links to the target user) between each user and the target user is associated with each of the plurality of target users corresponding to the search ID. . If the distance information for the target user is not described, it indicates that the distance information to the target user is unknown at the present time. In the distance data, the distance information corresponding to the user ID corresponding to the target user (for example, 456789 and 765432 in FIG. 9) is written with “0” as an initial value.
The distance data may be updated every time each user satisfies a predetermined condition.

(5) Principle of processing for calculating the distance to the target user As described above, in the game of the present embodiment, the search user sequentially changes the reference user as a search reference until the target user is found. At this time, when the distance information to the target user is associated with the user serving as the reference user on the distance data, information based on the distance information is presented to the search user. For this reason, it is not necessary to calculate the distance between the reference user and the target user every time the reference user is changed, so that the processing load is reduced.
Hereinafter, the principle of the process of calculating the distance information to the target user for each user in the network will be described with reference to FIGS. 10 and 11A to 11E.

  FIG. 10 is a diagram conceptually illustrating an example of a social graph (undirected graph) indicating user friendship relationships. In the example of the social graph shown in FIG. 10, the departure node Ns is the user KNM, and the target node Ng is the user XYZ (that is, the target user is the user XYZ). In the social graph, the presence / absence of friendship between users is expressed by the presence / absence of a link (also referred to as “edge”) between nodes. In the social graph illustrated in FIG. 10, the value of the distance information corresponding to the target user XYZ is “0”.

11A to 11E show social graphs of examples similar to those in FIG. 11A to 11E show examples in which the users in the network sequentially satisfy the predetermined condition and the distance information values corresponding to the surrounding users are determined based on the target user in the continuous periods T1 to T5. ing. In the present embodiment, the predetermined condition for each user is “the user has accessed the game”.
In FIGS. 11A to 11E, a user who is already associated with distance information (that is, the number of links with the user is 1) and who has accessed the game during the corresponding period ( That is, a circle indicating a user who satisfies a predetermined condition is represented by a bold line. Although it is not a friend of a user who has already been associated with distance information, since the value of the corresponding distance information is not determined for a user who has simply accessed the game, the circle indicating the user is not represented by a bold line.

(I) Period T1
At the start time of the period T1, only the target user is associated with the distance information. The target user is associated with “0” as an initial value (see FIG. 10). Here, it is assumed that a user KFC who is one of the target user's friends logs in to the game within the period T1. In this case, since the distance information associated with the target user XYZ that is a fellow user for the user KFC is “0”, the distance information associated with the user KFC is “1” by adding 1 to that of the target user. It becomes. As a result, the distance information associated with each user in the network at the end time of the period T1 is as shown in FIG. 11A.

(Ii) Period T2
A case in which a user SAM, EST, or DCT who is one of the users (here, the target user XYZ and the user KFC) with which distance information has already been associated logs in to the game within the period T2 following the period T1. Suppose. In this case, since the distance information associated with the target user XYZ that is a fellow user for the users EST and DCT is “0”, both the distance information associated with the users EST and DCT are 1 Is added to “1”. The user SAM is a friend of the target user XYZ and the user KFC. The distance information associated with the user SAM is “1” (0 + 1 = 1) when the target user XYZ (distance information: 0) is used as a reference, and “2” (1 + 1 = 2) when the user KFC (distance information: 1) is used as a reference. ) Thus, when a plurality of distance information can be associated, a smaller value is associated. That is, the distance information associated with the user SAM is “1”. As a result, the distance information associated with each user in the network at the end time of the period T2 is as shown in FIG. 11B.

(Iii) Period T3
It is assumed that a user DSG who is a friend of the user SAM already associated with the distance information logs in to the game within the period T3 following the period T2. In this case, since the distance information associated with the user SAM who is a fellow user for the user DSG is “1”, the distance information associated with the user DSG is “2” by adding 1 to that of the user SAM. It becomes. As a result, the distance information associated with each user in the network at the end time of the period T3 is as shown in FIG. 11C.

(Iv) Period T4
Assume that a user GTR who is a friend of the users SAM and DSG already associated with distance information logs in to the game within a period T4 following the period T3. The distance information associated with the user GTR is “2” (1 + 1 = 2) based on the target user SAM (distance information: 1), and “3” (2 + 1 = 3) based on the user DSG (distance information: 2). ) In this case, as described above, the distance information associated with the user GTR is “2” because it takes a smaller value. As a result, the distance information associated with each user in the network at the end time of the period T4 is as shown in FIG. 11D.

(V) Period T5
Assume a case where users FSR and BJC, who are friends of users KFC and GTR already associated with distance information, log in to the game within a period T5 following the period T4. In this case, since the distance information associated with the user KFC, which is a fellow user for the user FSR, is “1”, the distance information associated with the user FSR is “2” by adding 1 to that of the user KFC. It becomes. Since the distance information associated with the user GTR who is a fellow user for the user BJC is “2”, the distance information associated with the user BJC is “3” by adding 1 to that of the user GJC. As a result, the distance information associated with each user in the network at the end time of the period T5 is as illustrated in FIG. 11E.

  As described above based on the specific example, in the game control device of this embodiment, the process of calculating the distance information to the target user is performed when each user in the network accesses the game (satisfies a predetermined condition). In this case, the distance information to the target user is sequentially associated with each user, following the link starting from the target user. Since the distance information associated with each user needs only to add 1 (that is, the number of links with the fellow users) when the distance information is associated with the fellow, the distance to the target user for each user. Need not be calculated each time, and the processing load is low.

(6) Game of this embodiment Next, the content of the game of this embodiment is demonstrated, referring FIGS. 12-18 is a figure which shows a series of web pages displayed on the search user's communication terminal 10 in the game of this embodiment. As an example, each web page is assumed to be searched after distance information is associated with each user in the network as shown in FIG. 11E.
In the following description, the menus, marks, etc. displayed on the web page displayed on the communication terminal 10 are arranged at desired positions on the web page, and the menus, marks visible on the communication terminal 10 are visible. The position on the display screen such as can be changed by scrolling the web page by the user's direction instruction button or touch panel operation.

The top page P0 of the game of this embodiment illustrated in FIG. 12 is configured by a web page corresponding to each user ID. In the example of FIG. 12, a user data display area and a menu display area are included together with the user image. In FIG. 12, the example of the web page displayed on the communication terminal 10 of the user KNM (user name; KNM) is shown as an example.
The user data display area is an area in which data of each item of progress level and physical fitness point (see FIG. 6) included in the user data of the target user ID is displayed. The menu display area includes a plurality of menus (menus) including a menu m1 (“user search”) for starting execution of a search process that is a process of finding a target user by tracing a user's friends in the game of the present embodiment. An area other than m1 is not shown).

  When the menu m1 (“user search”) is selected and operated on the top page P0 of the game in FIG. 12, the web page is updated as shown in P1. This web page P1 displays a list of one or more search missions that are currently selectable (ie, have not reached the end time). Each mission is displayed in association with the target user (XYZ, etc.), the time until the end time (1 hour 35 minutes, etc.), and privilege points (1000 pt, etc.). Menus m11, 12,... (“Find this person”) are displayed in association with each mission. For example, when the menu m11 is selected and operated on the web page P1, the web page is updated as indicated by P2 in FIG. The web page P2 is configured by display areas 101, 102, and 104, for example. A web page displayed in the process of searching for a target user after any of a plurality of search missions is selected may be referred to as a “search page” below.

  FIG. 13B conceptually shows a social graph indicating the position of the reference node Nr when the web page P2 is displayed on the communication terminal 10 of the user KNM. The social graph itself is the same as that illustrated in FIG. 11E. At this time, the user KNM corresponds to the reference node Nr on the social graph.

In the web page P2 in FIG. 13A, when the distance information is associated with the reference user, the display area 101 uses the distance information as a reference based on the target position (corresponding to the target node on the social graph). As a bar-shaped display area. Before the user KNM accesses the game, distance information is not associated with the user KNM as shown in FIG. 11E. However, when the user KNM subsequently accesses the game, the user KNM associates with the fellow user BJC. The distance information: 4 is associated with the user KNM on the basis of the distance information: 3. Thereby, distance information: 4 is displayed in a bar shape in the display area 101 of the web page P2. In the display area 101 of the web page P <b> 2, “current position” corresponds to a reference node on the social graph that is the basis of the search. In the display area 102, for the mission selected by the user KNM at P1, the current position of the user ("KNM" that is the search user and the reference user is displayed at P2) and the search end time. The remaining time until is displayed.
In the display area 104, a list of fellow users of the reference user (buddy list) is displayed for the search user to update the reference user. In the example of P2, a buddy list of the user KNM who is a search user and also a reference user is displayed.

In the web page P2 in FIG. 13A, when, for example, the user BJC is selected and operated as a new reference user, the web page is updated as shown in P3 in FIG. The web page P3 includes, for example, a display area 103 in addition to the display areas 101, 102, and 104 described above. The display area 103 is included in a web page that is displayed when the search user and the reference user are different.
The display area 103 of the web page P2 associates the user image of the user who becomes the reference user, the menu m21 (“greeting”) for transmitting a greeting message to the user, and the user as a new friend. And a menu m22 (“Invite to a friend”) for applying. By providing such a menu, the search user can directly communicate with other users recognized during the search process, and is given an opportunity to establish a relationship between the other users and their friends. For example, when the menu m21 is selected, it is updated to a web page (not shown) including a text box for inputting a text message and a send button. By selecting and operating the send button while a message is input in the text box, the message is accepted and delivered to the reference user. In the game of this embodiment, every time the reference user is changed, the search user recognizes other users who are not his / her friends. For example, the search user asks information about the target user or is irrelevant to the search game. Opportunities for various communication such as sending messages about the contents will be obtained.

  As shown in FIG. 14B, when the web page P3 is displayed, the reference node Nr on the social graph corresponds to a node indicating the user BJC. At this point in time, as shown in FIG. 14B, the distance information (“3”) is associated with the user BJC, which is the reference user, so as shown in the web page P3 in FIG. In the display area 101, the distance information is displayed in a bar shape (that is, displayed on three scales).

In the web page P3 in FIG. 14A, when, for example, the user GTR is selected and operated as a new reference user, the web page is updated as shown in P4 in FIG. 15A. The web page P4 is a web page having the same display format as P3.
As shown in FIG. 15B, when the web page P4 is displayed, the reference node Nr on the social graph corresponds to a node indicating the user GTR. At this time point, as shown in FIG. 15B, the distance information (“2”) is associated with the user GTR as the reference user, so that the distance information is displayed in a bar shape in the display area 101. (In other words, two scales are displayed).

In the web page P4 in FIG. 15A, for example, when a user SAM is selected and operated as a new reference user, the web page is updated as shown in P5 in FIG. The web page P5 is a web page having the same display format as P3.
As shown in FIG. 16B, when the web page P5 is displayed, the reference node Nr on the social graph corresponds to a node indicating the user SAM. At this time point, as shown in FIG. 16B, the distance information (“1”) is associated with the user SAM as the reference user, and therefore the distance information is displayed in a bar shape in the display area 101. (That is, one scale is displayed).

In the web page P5 in FIG. 16A, when, for example, the user XYZ is selected and operated as a new reference user, the web page is updated as shown in P6 in FIG. Since the user XYZ to be selected is a target user, the target user can be found by this selection operation. In this case, a display area 105 is provided as shown on the web page P6, and a text for notifying that the search for the target user is successful is displayed.
As shown in FIG. 17B, when the web page P6 is displayed, the reference node Nr on the social graph corresponds to a node indicating the user XYZ. At this time point, as shown in FIG. 17B, since the distance information (“0”) is associated with the user XYZ that is the reference user, the current position and the target position of the user KNM are displayed in the display area 101. Match.

The case where the user KNM who is the search user finds the user XYZ which is the target user by tracing the friendship relationship between the users has been described above. In the example shown on the web pages P2 to P6, the user KNM finds the user XYZ along the shortest path on the social graph. For example, it is assumed that the reference user is changed from the user BJC to another user instead of the user GTR when the web page P3 (FIG. 14) is displayed. A display example in this case is shown in FIG. The web page P4a shown in FIG. 18A is a display example when the reference user is changed from the user BJC to the user ZAP. The change of the reference user corresponds to the change of the reference node Nr on the social graph to a node indicating the user ZAP as shown in FIG. When the reference user is changed from the user BJC to the user ZAP, the user ZAP does not access the game, and therefore the distance information is not associated, and the distance information is displayed in a bar shape in the display area 101 of the web page P4a. Not. In such a case, it can be seen that the searching user who sees the display area 101 has a high possibility that the distance from the target user has been increased by selecting the user ZAP as the reference user. That is, the distance information is associated with the user since the target user is the starting point in the order satisfying the predetermined condition (for example, the order in which the game is accessed). It is estimated that the user who is not present is far away from the target user on the network.
When the distance information is not associated with the selected reference user, the search user satisfies the predetermined condition (for example, user ZAP in the example of P6) (for example, to the game) It may be configured to be able to send mini-mails (to access).

(7) Outline of Each Process in Game Control Device Next, each process in the game control device will be described in order to realize the above-described game of the present embodiment.
In the present embodiment, the game server 20 and the database server 30 constitute a game control device. Below, the function implement | achieved with the game control apparatus of this embodiment is demonstrated with reference to FIG. 19, taking the case where the game mentioned above is applied as an example. FIG. 19 is a functional block diagram for explaining functions that play a major role in the game control apparatus of the present embodiment.

The association means 51 has a function of relating users. For example, the associating unit 51 has a function of associating the user ID with other user IDs when triggered by an application based on the user ID.
The function of the correlation means 51 is implement | achieved as follows, for example. The CPU 21 of the game server 20 sends an application message (application) specifying a user ID (or a corresponding user name) to be a friend from the communication terminal 10 of the user corresponding to a certain user ID via the communication interface unit 25. Accept. Transmission of this application message is preset as a function of a web page provided to the user's communication terminal 10. When receiving the application message, the CPU 21 approves an application based on another user ID to the communication terminal 10 corresponding to the user ID at the timing when the access is based on the user ID included in the application message. HTML data for displaying a web page for requesting the reply is transmitted. If it is replied that the application is approved, the CPU 21 registers both as friends. Specifically, the CPU 21 writes the data in the location (see FIG. 6) of “friend user ID” of the user data of the corresponding two user IDs in the user database 31.
The conditions for relating users are not limited to the forms that require application and approval as described above, but users of the same progress level are positioned as users who are related in the game and registered as friends. May be. Alternatively, users who transmit a predetermined number of greeting messages may be automatically registered as friends, and when there is a mode on the game in which a battle or cooperative play is performed between users, a battle or a predetermined number of times or Users who have performed cooperative play may be automatically registered as friends. In cooperative play, a user who has requested for support and a user who has accepted a request for support of a predetermined number of times or more from the user may be registered as friends.

The setting means 52 has a function of setting a target user, which is a user who is a search target, in a network based on a link indicating a relationship between users.
In order to realize the function of the setting means 52, when generating a new search mission, the CPU 21 of the game server 20 issues a new search ID, the target user corresponding to the search ID, the end time, and the privilege point And write to the search database.
The target user may be set as appropriate. For example, a user that satisfies a predetermined condition may be set as the target user. For example, when a group consisting of a plurality of users is set on the game, the user is set as the target user on the condition that one of the users in the group has performed processing that is disadvantageous to the group. Then, other users in the group may be set as search users. In this case, for example, a game setting for finding the target user as a “traitor” in the group may be used.

The 1st matching means 53 is provided with the function which matches predetermined distance information (1st numerical information) with a target user. In the present embodiment, the distance information to the target user (the shortest number of links to the target user) is an example of numerical information of the present invention. In the example of the present embodiment, the first numerical information is “0”.
In order to realize the function of the first association unit 53, the CPU 21 of the game server 20 accesses the distance data and sets “0” as the distance information for the user ID corresponding to the target user. Is written. In the example of FIG. 9, the user with the user ID: 456789 and the user with the user ID: 765432 are set as the target users with the search ID: 01 and the search ID: 02, and “0” is set as the associated distance information. Is written.

The determination unit 54 has a function of determining whether each user satisfies a predetermined condition. As described above, in the present embodiment, the predetermined condition for each user is “the user has accessed the game”.
In order to realize the function of the determination unit 54, the CPU 21 of the game server 20 acquires the HTTP request specifying the URL of the game of the present embodiment from the user communication terminal 10 via the communication interface unit 25. Determines that has accessed the game.

The specifying unit 55 is associated with a fellow user (a user within the range of 1 link) of a user who accesses the game (a user who satisfies a predetermined condition; referred to as “first user”) on the network. A function to specify the smallest distance information (numerical information closest to the first numerical information (“0”)) among the existing distance information. The user associated with the distance information specified by the specifying unit 55 is referred to as “second user”.
In order to realize the function of the specifying means 55, when the CPU 21 of the game server 20 determines that the user (the user to be processed; the first user) has accessed the game, the distance associated with the friend of the user Among the information, the smallest distance information (distance information associated with the second user) is specified. In this case, CPU21 accesses user data, reads the user ID of the 1st user's associate, reads the distance information corresponding to the user ID from distance data, and specifies the smallest distance information in it. The process of specifying the distance information is sequentially performed every time it is determined that any user in the network has accessed the game.

Based on the distance information (numerical information) specified by the specifying means 55 and the number of links between the second user and the first user, the second associating means 56 sends the distance information (numerical information) to the first user. It has a function to associate In the present embodiment, since the first user and the second user are in a friendship relationship, the “number of links between the second user and the first user” is 1.
In order to realize the function of the second association means 56, the CPU 21 of the game server 20 specifies the smallest distance information among the distance information associated with the associate, and then adds 1 (companion) to the identified distance information. Is added to the distance data as distance information associated with the user to be processed (first user).

The changing means 57 has a function of sequentially changing a reference user, which is a user as a search reference, based on a network link in accordance with input information of a search user who searches for a target user. In addition, in this embodiment, it is an example in case the reference user at the time of a search start is made into a search user.
The function of the change means 57 is realizable as follows. The CPU 21 of the game server 20 reads, for example, regularly or sequentially, the user ID of the user data of each user, generates an adjacent list, and stores it in the RAM 23. The adjacency list is an example of a data structure for expressing a social graph when a user is represented by a node and the presence / absence of association between users is represented by the presence / absence of a link between nodes. Note that the data structure representing the social graph is not limited to the adjacency list illustrated in FIG. 8 but may be an adjacency matrix. The adjacency matrix is a square matrix in which the row number and the column number correspond to the user ID, respectively, and is a matrix in which components are described by values of 1 or 0 indicating the presence or absence of association.

  When a user who is a search user accesses a search page for a specific search ID and the search for the search ID is in progress, the user ID of the reference user is written in the user data together with the search ID. Therefore, when the CPU 21 accesses the search user's user data and determines that the target search ID is written, the CPU 21 reads the reference user's user ID associated with the search ID and reads the current reference ID. The user is stored in the RAM 23 as a user. On the other hand, when the search for the search ID is the first time, the target search ID is not written in the user data. Therefore, when the CPU 21 accesses the user data of the search user and determines that the target search ID is not written, the CPU 21 stores its own user ID (that is, the search user) in the RAM 23 as the current reference user. Let

  When the CPU 21 presents a candidate for a reference user change destination to a search user, the CPU 21 reads out the user IDs of one or a plurality of users corresponding to the user IDs of the current reference user by referring to the adjacent list. HTML data for displaying the user information corresponding to the user ID in a list format is generated and transmitted to the communication terminal 10 of the search user. Moreover, CPU21 updates the reference | standard user matched with a search user, when the HTTP request containing the selection result (input information) about the user of the reference | standard user's change destination is acquired. When the reference user is updated, the user ID of the reference user in the RAM 23 is written into the user data sequentially or periodically. That is, the reference user data in the user data is updated.

Each time the reference user is changed by the changing unit 57, the presentation unit 58 presents information based on the distance information to the search user when distance information (numerical information) is associated with the changed reference user. It has a function to do.
In order to realize the function of the presenting means 58, the CPU 21 of the game server 20 accesses the distance data when the CPU 21 of the game server 20 obtains an HTTP request including the selection result for the user to which the reference user is changed. Then, the distance information associated with the selected user is read out, HTML data including the distance information is generated and transmitted to the communication terminal 10 of the searching user. The web pages displayed on the communication terminal 10 by interpreting the HTML data are P2 to P6 illustrated in FIGS. 13 to 15, and the selected user (after change) is displayed in the display area 101 of these web pages. If the distance information is associated with the reference user), the number of links is displayed in a bar shape as the distance information between the current position and the target position.

(8) Flow of main processing of game control device of this embodiment Next, an example of the flow of main processing performed by the game control device of this embodiment will be described with reference to the flowcharts of FIGS. . FIG. 20 is a flowchart of a process for updating the adjacency list of the social graph indicating the user's friendship in the game of the present embodiment. FIG. 21 is a flowchart of the process for updating the distance data illustrated in FIG. FIG. 22 is a flowchart showing the search process. In the flowchart shown in FIG. 22, transmission / reception of the HTTP request and display processing of the web page are not described so as not to be complicated, but instead, the timing at which the illustrated web pages P1 to P6 are displayed. It is shown by reference numerals P1 to P6.

(8-1) Neighbor list update processing (FIG. 20)
The adjacent list update process shown in FIG. 20 is executed at a predetermined time every day, for example. When it is determined that the predetermined time has come (step S10: YES), the CPU 21 of the game server 20 reads the user IDs of the user data of each user (step S20). Next, the CPU 21 generates an adjacent list by associating each user's user ID with the user ID of each user's associate, and updates the adjacent list data stored in the RAM 23 (step S30). Thereby, the friendship relationship between users that can be constructed or discarded at an arbitrary timing is reflected in the adjacent list used for the search process at a predetermined time every day. Such an update process is advantageous in that the adjacency list that is the basis of the search process is not changed during the execution of the search process described later.
The update of the neighbor list is not limited to being performed periodically, and may be performed sequentially. For example, the CPU 21 updates the adjacent list every time a friendship relationship between users is newly formed (for example, at the time when an approval from the other user is accepted for an application for a friend from one user). May be.

(8-2) Distance data update processing (FIG. 21)
The distance data update process shown in FIG. 21 is sequentially performed for each user. The CPU 21 of the game server 20 performs the processing after step S60 when the user to be processed satisfies a predetermined condition (step S50: YES), that is, when it is determined that the game has been accessed. The determination in step S50 is made based on the result of obtaining an HTTP request specifying the URL of the game of the present embodiment from the user communication terminal 10 via the communication interface unit 25. If it is not determined that the user to be processed has accessed the game (step S50: NO), the process ends.

When the determination in step S50 is YES, the CPU 21 determines whether there is a friend associated with the distance information among the friends of the processing target user (step S60). If there is no friend with which distance information is matched, it will be complete | finished (step S60: NO). CPU21 specifies the smallest distance information in the distance information matched with the friend, when there exists the associate with which distance information is matched (step S60: YES) (step S70). When there is one friend associated with the distance information, the distance information of the friend is specified in step S70.
Next, the CPU 21 determines a value obtained by adding 1 (the number of links between friends) to the distance information identified in step S70 as distance information associated with the processing target user (first user) (step S80). The determined distance information is written in the distance data in association with the user to be processed (step S90).

(8-3) Search process (FIG. 22)
When the CPU 21 of the game server 20 obtains an HTTP request including the selection operation result of the menu m1 (“user search”) on the top page P0, the user can select the access by accessing the search database (that is, the end time is reached). The data of one or a plurality of search missions is read out, and HTML data including the data is generated and transmitted to the communication terminal 10 of the user. Accordingly, the web page P1 (see FIG. 12) is displayed on the user communication terminal 10. The search process of FIG. 22 is started when the user who becomes the search user selects one of the search missions on the web page P1. When the CPU 21 of the game server 20 obtains an HTTP request including the mission selection result (that is, the selection operation result of any of the menus m11, 12,...) (Step S100: YES), the search corresponding to the selected mission is performed. Search processing for ID (processing after step S110) is executed. CPU21 complete | finishes, when not acquiring the HTTP request containing the selection result of a mission (step S100: NO).

  Step S100: In the case of YES, the CPU 21 stores the user IDs of the reference user and the target user in the RAM 23 (step S110). Specifically, when the CPU 21 accesses the search user's user data and determines that the target search ID is written, the CPU 21 reads the reference user's user ID associated with the search ID, The current reference user is stored in the RAM 23. On the other hand, when the search for the search ID is the first time, the user ID of the search user is stored in the RAM 23 as the current reference user. The CPU 21 stores the user ID of the target user of the target search ID read from the search database in the RAM 23.

  Next, the CPU 21 reads distance information associated with the reference user stored in the RAM 23 with reference to the distance data (step S120). If the read distance information is not “0” (step S130: NO), that is, if the distance information is 1 or more, or if the distance information is not yet associated, the process proceeds to step S140. When the read distance information is “0” (step S130: YES), the process proceeds to step S180.

When the process proceeds to step S140, the CPU 21 refers to the adjacent list and reads the user IDs of one or a plurality of users corresponding to the user IDs of the current reference user (step S140). Next, the CPU 21 generates HTML data including the buddy list read in step S140 and the distance information read in step S120, and transmits the HTML data to the search user communication terminal 10 (step S150). The web page displayed by interpreting the HTML data is, for example, as shown in the web page P2 of FIG. 13, a display area 101 for displaying information related to distance information, and a buddy list consisting of buddy read in step S140. And display area 104 for displaying.
CPU21 updates the reference | standard user in RAM23 matched with a search user, when the HTTP request containing the selection result (input information) about the change-destination user of a reference | standard user is acquired (step S160: YES) (step S160). S170), the process returns to step S120. CPU21 waits, when not acquiring the HTTP request containing the selection result (input information) about the user of the change destination of a reference | standard user (step S160: NO).

  The processes in steps S120 to S170 are repeated until the reference user matches the target user. When the reference user matches the target user, that is, when it is determined that the distance information read in step S120 is 0 (step S130: YES), the CPU 21 receives the search user's via the communication interface unit 25. For example, as shown in a web page P6 in FIG. 17, HTML data including text indicating that the search has been successful is transmitted to the communication terminal 10. That is, it is notified that the search is successful (step S180).

  As described above in detail, in the search game realized in the present embodiment, the search user who performs the search sequentially changes the reference user, and determines the target user by following the network based on the link indicating the relationship between the users. It searches and it is comprised so that the search game by which a privilege is provided to a search user may be performed when a search is successful. Since information regarding the distance of the shortest path between the reference user and the target user is presented to the search user, the search user can proceed with the search while recognizing the distance to the target user. In this search game, when the target user is not related to the search user, the search user is not related to himself / herself in the process of searching for the target user or to efficiently find the target user. Opportunities to communicate with other users (reference users) such as asking questions about information about the target user can be obtained. Therefore, according to the game control apparatus of this embodiment, it can accelerate | stimulate building the relationship between new users.

  In this game control device, when each user who accesses the game (that is, satisfies a predetermined condition) is the first user, the distance information (numerical information) associated with the first user is the first user's companion (the first user) It is determined by adding 1 (the number of links between the second user and the first user) to the value of the known distance information (numerical information) of (2 users). Then, distance information is sequentially associated with a user accessing the game from a user with a small number of links with the target user to which “0” (first numerical information) is previously associated as distance information. It will be. Since the determination of the distance information associated with each user is performed each time the user accesses the game, the processing load timing is distributed, and the processing itself is also performed from the first user to the target user. This is not a process for obtaining the shortest path, but merely an addition operation, which results in a low load process.

  In the above-described embodiment, the process of associating distance information with each user may be performed in parallel with the search process itself. Even if both are performed in parallel, the process of associating the distance information with each user is performed at the timing when the user in the network accesses the game, and the process of reading the distance information associated with the reference user in the search is performed. This is performed at the timing when the reference user is changed. That is, the two processes are performed in a distributed manner on the time axis.

  In this game control device, when the reference user is changed according to the input information of the search user, the distance from the reference user to the target user can be immediately known by referring to the distance data. There is no need to calculate the distance (number of links) from the reference user to the target user, and there is an advantage that the processing load for searching is extremely low.

  As shown in FIGS. 7 and 9, in the game of the above-described embodiment, a case where a plurality of searches for each search ID is performed and a target user is set for each search has been described. In this case, the setting unit 52 sets a plurality of target users, and the second association unit 56 sets distance information (numerical information) for the processing target user (first user) who accesses the game for each target user. It has a function to associate By setting a plurality of target users, the user can execute a plurality of searches in parallel, so that it is possible to enhance the interest as a search game. However, the present invention is not limited to a case where a plurality of searches are performed, and may be a case where only a single search is performed.

In the game control apparatus according to the embodiment, the second association unit 56 adds the distance information (numerical information) associated with the second user and the number of links between the second user and the first user. The case has been described in which a function for calculating distance information associated with the first user (the user to be processed who accesses the game) is provided. That is, in order to realize the function, after the CPU 21 of the game server 20 specifies the smallest distance information among the distance information associated with the first user's associate, 1 ( The case where the value obtained by adding the number of links between friends) is calculated as distance information associated with the processing target user (first user) has been described. In this case, in this configuration, distance information (numerical information) associated with each user on the network is calculated by the addition process, so that the processing load when calculating the distance information is reduced.
However, the process of calculating the distance information associated with the first user is not limited to the method using the addition operation as described above. The distance information may be lowered every time the distance information associated with the first user moves away from the target user. For example, the CPU 21 specifies a value obtained by subtracting 1 (the number of links between friends) from the specified distance information after specifying the largest distance information among the distance information associated with the first user associate. The distance information associated with the processing target user (first user) is calculated. In this case, if the distance information associated with the target user in advance is “0”, the absolute value of the distance information associated with the user other than the target user represents the distance from the target user to the user. . That is, the distance information may be calculated by a subtraction process.

In the above-described embodiment, the case where the number of links between the second user and the first user is 1, that is, the case where the second user and the first user are in a fellow relationship has been described as an example. The number of links between the two users and the first user may be two or more. Even if the number of links between the second user and the first user is two or more, if the number is not a large number, the processing load for associating the distance information with the user does not increase. For example, when the distance information associated with the user is read for a user who has 2 links with the first user, the number of friends of each user is 30, and even when viewed as a brute force 900 (= 30 ² ) Distance information associated with a user may be read out. When associating distance information with a first user based on a second user within a predetermined number of links from the first user, the number of links between the second user and the first user is set to 2 or more. Thus, since distance information to be associated with the first user can be determined based on the second user closer to the target user, distance information can be more quickly associated with each user in the network. Since the processing load increases as the number of links between the second user and the first user increases, the appropriate number of links between the second user and the first user based on the processing capacity of the CPU 21. Is preferably set.

  Here, even when the number of links between the second user and the first user is two or more, it is not necessary to specify the second user itself. Among distance information associated with users within a predetermined number of ranges of 2 or more from the first user, distance information associated with the target user (first numerical information; “0” in the above embodiment) It is only necessary that the smallest distance information can be specified. In specifying such distance information, the CPU 21 may perform processing as follows. First, the CPU 21 specifies the smallest numerical information among the numerical information associated with the first user's fellow user (the user whose number of links from the first user is 1), and adds 1 to the numerical information. Thus, the numerical information associated with the first user is determined. When the CPU 21 determines that there is no user associated with the numerical information among the first user's fellow users, the CPU 21 then associates the first user's fellow users (from the first user). The numerical information associated with the first user is determined by specifying the smallest numerical information among the numerical information associated with the user having 2 links) and adding 2 to the numerical information. Similarly, numerical information associated with the first user is determined based on numerical information associated with a user whose number of links is three or more away from the first user.

(9) Modified Example In the above-described embodiment, the changing unit 57 has been described with reference to a case where the searching user is used as a starting point to sequentially change the reference user as a searching reference user based on the network link. It is not limited to the case of starting. The user corresponding to the departure node may be any user on the network formed by the peer relationship, and may be different from the search user.
Further, some modifications of the above-described embodiment will be described below.

(9-1) Modification 1
In the game control device of the above-described embodiment, when each user in the network satisfies a predetermined condition in the specifying unit 55 and the second association unit 56, the association with the distance information (numerical information) of each user is performed. Done. That is, the distance information associated with each user is newly associated, or the already associated distance information is updated. Such processing timings are preferably distributed in order to reduce the processing load. From this point of view, in the above-described embodiment, the user accesses the game under a predetermined condition. Since the timing at which each user in the network accesses the game is considered to be relatively random, it is advantageous to reduce the processing load when the user accesses the game under a predetermined condition. The “access” may be access to a specific event in a game, a specific game element (mini game, etc.), or a specific stage, in addition to access accompanying authentication processing such as access to a game.
In addition, when a user's access is performed excessively, the process of matching distance information with respect to each user is frequently performed, which may increase the processing load. In that case, for example, it may be determined that a predetermined condition is satisfied every time the game is accessed a predetermined number of times. Alternatively, the predetermined condition may be that the game is accessed and the game is not accessed within a predetermined time in the past (for example, one hour) with reference to the access.

  However, the predetermined condition is not limited to the user accessing the game. The predetermined condition may be that a time allocated at random for each user or a time allocated according to a predetermined rule for each user has been reached. This also is advantageous in reducing the processing load because the timing of the association processing for each user's distance information (numerical information) is dispersed. As an example of the predetermined rule, at a time interval of 10 minutes, a user group whose last digit is 1 is a user group, a user group whose last digit is 2 is a user group, and so on. It may be assigned.

  The predetermined condition may be that the reference user is selected based on the input of the search user. Further, the predetermined condition may be that the user has updated the friendship relationship (adding another user as a friend or canceling the friendship relationship with the fellow user). If the friendship relationship is updated, the distance between the reference user and the target user may change, but by making the update of the friendship relationship the predetermined condition, the reference user and the target user Since the distance information associated with each user is updated so that the distance between them is optimized, the update of the friendship is reflected in the search result in a timely manner.

(9-2) Modification 2
In the game of the above-described embodiment, the search user is configured to find the target user by tracing the friendship relationship between the users starting from itself, but the relationship between the users is not limited to the friendship relationship, You may decide. For example, when a function for transmitting a greeting message between users (for example, the menu m21 in FIG. 14) is provided, the user who has transmitted and received the greeting message is defined as a relationship having a greeting history, and the relationship is It is good also as a mechanism which finds a target user by tracing. In this case, for each user, users having a greeting history are associated with each other and stored in, for example, user data, and the adjacent list is associated with a user ID of a user having a greeting history. In the case of this modification, for example, the web page indicated by P3 in FIG. 14A is displayed as indicated by P3a in FIG. 23, for example. As shown in FIG. 23, in this modification, the change of the reference user is configured to be performed by selecting from the current reference user and other users having a greeting history.
This modification is obtained by replacing the relationship of friends with a relationship having a greeting history in the above-described embodiment, and can be realized in the same manner as in the above-described embodiment. That is, in this modification, the association means 51 has a function of relating users who have a greeting history.

(9-3) Modification 3
In the embodiment described above, the changing unit 57 changes some reference users from among the reference user associates (that is, a plurality of users related to the reference user) when changing the reference users in the associate network. A function of presenting to the search user as a candidate for the reference user after the change may be provided. That is, in the buddy list shown in the web pages P2 to P5 of FIGS. 13 to 16, the case where all the buddy users of the current reference user are presented to be selectable is illustrated, but the present invention is not limited to such a case. . In the buddy list, some buddy users of the current reference user may be displayed.
Presenting only some of the fellow users as the fellow list may be performed, for example, for the purpose of adjusting the difficulty level of the search game. That is, when there are many friends of each user in the network, it may be difficult for the searching user to search for the target user while sequentially changing the reference user. Therefore, for the purpose of reducing the difficulty level of the search game, the reference user candidates after the change may be limited from among the users of the reference user when changing the reference user.
This modification can be realized as follows. When the CPU 21 of the game server 20 presents a candidate for the reference user change destination to the search user, the CPU 21 refers to the adjacent list and selects a part of the user ID of the user corresponding to the user ID of the current reference user ( For example, a predetermined number of user IDs) are read, and HTML data for displaying the user information corresponding to the read user IDs in a list format is generated. At this time, it is preferable that a part of user IDs to be read include a fellow user ID associated with the distance information, and among the friends associated with the distance information. It is more preferable that the user ID of the fellow who has the smallest value of the distance information is included. This is because when the user ID is not included, the search user cannot reach the target user or must make a detour, and the difficulty of the search game may increase.

(9-4) Modification 4
In the above-described embodiment, the setting unit 52 may have a function of setting the target user so that the number of links between the reference user and the target user at the start of the search is within a predetermined range.
When the number of links between the reference user and the target user is large at the initial stage of the search (that is, the distance between the users is far away on the network), the search user can select the target user while sequentially changing the reference user. It can be difficult to search. This is especially true when there are many friends (users associated with each user) in the network. Therefore, the user as the target user may be set so that the number of links between the reference user and the target user at the start of the search is within a predetermined range.
In order to realize this modification, when the CPU 21 of the game server 20 obtains an HTTP request including the selection operation result of the menu m1 (“user search”) on the top page P0, the user accesses the search database and the user Among one or more search missions that can be selected (that is, have not reached the end time), the distance (number of links) is within a predetermined range as viewed from the user to be processed (that is, the reference user at the start of the search) Data of a mission set by a certain target user is read, HTML data including the data is generated, and transmitted to the user communication terminal 10. Thereby, the mission selected by the user who becomes a search user is limited to the mission in which the number of links to the target user is within a predetermined range.
Note that the data for each mission (each search ID) described in the search database may not have the target user fixed in advance. For example, when the reference user at the start of the search is a search user, the target user of each mission has a predetermined number of links from the user when a search mission is selected by the user who becomes the search user. Any one of the users inside may be determined as the target user.

(9-5) Modification 5
In the embodiment described above, the changing unit 57 may have a function of restricting the change of the reference user based on at least one link in the fellow network.
In this configuration, for example, since it is prohibited to block a link in the network and follow a link related to a specific user, it is possible to flexibly set a search game such as a search difficulty setting according to a search user. Can be changed. In addition, the “restriction” of the change of the reference user is not limited to the case where the tracing of the link between the users is completely blocked, and may be a case where the reference user is blocked only for a predetermined time. This modification may be realized as follows. When the CPU 21 of the game server 20 presents the search target user candidates for the reference user to the search user, the adjacency list is referred to and a part of the user ID of the user corresponding to the user ID of the current reference user is selected. HTML data for displaying the user information corresponding to the read user ID in a list format is generated. At this time, the CPU 21 refers to the distance data and excludes the user ID of the user associated with the smallest distance information among the users corresponding to the user ID of the current reference user from the user ID to be read. May be. As a result, the search user cannot reach the target user or has to make a detour, so that the difficulty level of the search game can be increased.

The link restriction may be performed according to an input operation of either one of two users related to the link (that is, fellow users), or an agreement between the two users related to the link. May be performed on the basis of In the latter case, in response to a request message for restricting the link from one of the two users related to the link, the other user sends an acceptance message to restrict the link. May be.
Moreover, the restriction | limiting of a link may be performed by restrict | limiting the change of the reference | standard user from the current reference | standard user to the friend user according to the attribute etc. of the said friend user. For example, a game setting is assumed in which a plurality of users in the network are divided into two groups, and the reference user can be changed only between users in the same group. In this case, as a change of the reference user, from the current reference user (eg, belonging to the same group A as the search user) to a user belonging to group A among the users of the reference user. Only changes are allowed.

For example, restricting the change of the reference user restricts the change of the reference user based on at least one link between the target user and the target user's associates (a plurality of users associated with the target user). May be performed. Thereby, since the change of the reference user that follows the link indicating the association between the target user and another user is restricted, the game settings can be changed effectively. For example, from the viewpoint of the searching user, if the link to the target user is blocked, it is necessary to trace the link other than the link to find the target user, so that it is necessary to largely detour. Moreover, it can also be set as the game setting which enables a fellow user of a target user to block | disconnect a link with a target user and to hide a target user (that is, to prevent a target user being found).
In order to restrict the change of the reference user based on at least any link with the fellow of the target user, when the CPU 21 of the game server 20 presents the candidate of the user to which the reference user is changed to the search user, When the reference user is a friend of the target user (that is, when 1 is associated as the value of the distance information), the adjacent list is referred to correspond to the user ID of the current reference user. When a part of the user ID of the user is read, the user ID of the target user is not included in the user ID to be read. Note that if all the links reaching the target user are blocked, the search user cannot find the target user, so it is preferable to block all the links reaching the target user.

  In the present modification, the changing unit 57 may set the time for restricting the change of the reference user (that is, restricting following the link) to a predetermined time. For example, blocking a link in a network and prohibiting a search user from following a link of a friendship relationship between specific users is effective in flexibly changing the setting of a search game. Continuing for a long time may be severe for the searching user (that is, the difficulty of the game may become too high). Therefore, the time during which the link between users is blocked may be limited to a predetermined time. In that case, the CPU 21 of the game server 20 first determines a link between specific users (for example, a link between the target user and his friends) or a link randomly or according to a predetermined rule as a link to be blocked. To do. When the search user changes the reference user, if the link between the changed reference user and the friend is a link to be blocked, the CPU 21 starts the time when the reference user is changed for a certain period of time. Prohibit the reference user from being changed by linking.

  In addition, the predetermined time which restrict | limits following a link is a fixed reference | standard with the closeness (high degree of the relationship between fellow users) mentioned later about two users (namely, fellow users) related to the said link. It may be changed according to the numerical value). For example, when the closeness between users is higher than a predetermined value, the predetermined time may be lengthened. For example, depending on the game scenario, when the closeness between the target user and the target user's friends is high, the friend hides the target user by increasing the predetermined time (that is, the target user). Can be set to increase the time)

(9-6) Modification 6
In the embodiment described above, the case where the number of links between fellow users is set to “1” has been described, but the number of links between fellow users may be set according to the degree of relationship between the users. Good. For example, the number of links between fellow users may be greater than 1 or less than 1.
The game control device according to the present modification includes a closeness setting unit 59 that sets a closeness according to the degree of the relationship between users between the users related by the related means 51. The second association means 56 is arranged such that the number of links between adjacent users on the network is adjusted according to the closeness between the users, and the distance to the first user (for example, each user who has accessed the game). A function for associating information (numerical information) is provided.
A functional block diagram of this modification is shown in FIG. The functional block diagram shown in FIG. 24 is different from that shown in FIG. 19 in that a closeness setting means 59 is added.
In this configuration, distance information (numerical information) is associated with each user according to the degree of relationship between adjacent users on the network. That is, the link weight on the network is not constant among users, and distance information is associated with each user based on the link weight according to the degree of relationship between users. Thus, for example, when there are a plurality of routes between the reference user and the target user, the distance provided to the user depending on the change of the reference user by the user input, that is, depending on the route adopted by the user. Since information based on information may be different, it is possible to further enhance interest as a search game.

This modification can be realized as follows.
Intimacy is a numerical value of the degree of relationship between fellow users based on a certain standard. An example of intimacy data (intimacy data) is shown in FIG. In the example of closeness data shown in FIG. 25, the frequency of sending or receiving a support message between users (support frequency) in association with each user's fellow user (user ID), items available on the game, etc. The number of times the present is sent or received (the number of presents) is recorded, and the familiarity value is set based on a certain standard based on the frequency and the number of times. The greater the support frequency and the number of presents, the higher the familiarity is set. In addition, with a certain standard, weighting may be taken into consideration for each item (in FIG. 25, the support frequency, the number of presents, etc.) that is the basis for setting familiarity. For example, the intimacy may be set high when the number of presents is large even if the support frequency is low. Such familiarity data is recorded in the user database 31, for example.

When the CPU 21 of the game server 20 determines that the user (the user to be processed; the first user) has accessed the game, the CPU 21 of the game server 20 has whether or not there is a friend associated with the distance information. Determine whether. CPU21 specifies the friend with the smallest distance information matched among the friends, when there is the friend with whom distance information is matched. Next, the CPU 21 adds a value obtained by adding a value corresponding to the closeness between the user to be processed and the specified friend to the distance information associated with the specified friend. Is determined as distance information associated with one user) and written to the distance data.
The “value according to the familiarity” may be set to a smaller value as the familiarity is higher. For example, when the intimacy is low (for example, intimacy: 1 to 3), it is set to 1 when the intimacy is moderate (for example, intimacy: 4 to 6), and when the intimacy is high ( For example, the familiarity: 7 to 10) may be 0.3.

(9-7) Modification 7
In the search game of the embodiment described above, when the search user finds the target user, a privilege may be given to the search user.
The game control device according to the present modification includes provision means 60 that grants a privilege to the search user when the reference user matches the target user. By providing the granting means 60, the motivation for the search user to find the target user can be enhanced. A functional block diagram of this modification is shown in FIG. The functional block diagram shown in FIG. 26 is different from that shown in FIG. 19 in that an adding unit 60 is added.
The function of the provision means 60 is realizable as follows. When the CPU 21 of the game server 20 obtains an HTTP request including the selection result for the user to which the reference user is changed, and the distance information associated with the selected reference user is “0”, With reference to the search database, it is determined that the privilege point associated with the target search ID is given to the search user. The fact that the search user has succeeded in the search and the amount of privilege points given to the search user are included in the HTML data that responds to the HTTP request. CPU21 performs the process which accesses the user data of a search user, adds and writes the privilege point which should be provided to a search user.
In addition, the provision means 60 may be provided with the function to provide a privilege to a search user, after satisfy | filling additional conditions based on a game setting or a game scenario. For example, after the reference user and the target user match, the granting unit 60 performs a battle between the search user and the target user, and grants a privilege to the search user when the search user wins the target user. Good. Alternatively, the granting unit 60 may grant a privilege to the search user when the search user grants a predetermined item to the target user after the reference user and the target user match.

The granting unit 60 may have a function of increasing the privilege given to the search user when the search is successful as the number of links between the reference user and the target user at the start of the search is large.
The larger the number of links between the reference user at the start of the search and the target user (that is, the greater the distance between the users on the network), the more times the reference user is changed before the search user finds the target user. It is considered to be. Therefore, by setting the privilege to be given to the search user according to the distance between the reference user at the start of the search and the target user, the privilege according to the difficulty level of the search can be given to the search user.
In this modification, privilege points do not need to be set in advance for each search ID in the search database. The CPU 21 of the game server 20 determines the reference user (for example, the search user in the above embodiment) and the target at the time when the user to be processed selects a mission with any search ID and starts the search (that is, the initial time). The distance (number of links) to the user is stored. As a method for calculating the distance between the reference user and the target user at the initial time, for example, any known algorithm such as the Dijkstra's Algorithm or the Warshall-Floyd Algorithm (the shortest path on the graph is selected). (A desired algorithm) may be applied. CPU21 determines giving a privilege point to a search user, when it is judged that the distance between target users is zero. At this time, the CPU 21 increases the amount of privilege points to be given as the distance between the reference user at the start of the search and the target user increases. The amount of privilege points may be determined with reference to a table describing the relationship between the initial distance (that is, the distance between the reference user and the target user at the initial time) and the amount of privilege points. The privilege points may be calculated by applying a predetermined arithmetic expression to the initial distance.

  As mentioned above, although embodiment of this invention was described in detail, this invention is not limited to the said embodiment. In addition, it goes without saying that the above embodiment may be variously improved and changed without departing from the gist of the present invention. For example, the features described in the embodiment and each modification may be applied in appropriate combination.

  In the above-described embodiment, as an example of “user input” of the present invention, input of a pressing operation of a predetermined operation button on a user's communication terminal or input of a touch operation on a display screen for a communication terminal having a touch panel function However, the user input is not limited to these input methods. The user input may be an operation input by shaking a communication terminal including an acceleration sensor, or an operation input by gesture (gesture input). In gesture input, by performing a predetermined gesture on a communication terminal having an imaging function, the communication terminal recognizes an image of the gesture and recognizes an operation input previously associated with the gesture. In the case of a communication terminal capable of executing a voice recognition program, the user input may be performed by voice.

  In this game control apparatus, the case where the “numerical information” associated with the first user is distance information has been described, but the present invention is not limited to this. The assumption that the numerical information associated with the first user is equal to the distance to the target user is that the numerical information associated with the target user is “0”. When the numerical information associated with the target user is a numerical value other than “0”, for example, “N” (N ≠ 0), N + 1, N + 2,... The numerical values are associated with each other. In that case, the distance between the user associated with the numerical value and the target user can be easily calculated by taking the difference between the numerical values of the two. Moreover, you may make it correspond to each user the value decremented every time it leaves | separates from a target user, such as N-1, N-2, ... with respect to the surrounding users on a network from a target user. In this case, the distance between the user associated with the numerical value and the target user can be easily calculated, for example, by taking the absolute value of the difference between the two numerical values.

In the above-described embodiment, the case where the bar-shaped information indicating the distance to the target user is presented to the search user as “information based on numerical information” of the present invention is illustrated, but the present invention is not limited thereto. The “information based on the number of links” may be text information corresponding to the number of links (for example, text such as “still far”, “a little more”, etc.), or voice information of strength or frequency according to the number of links. It may be.
In the above-described modification, a privilege point is taken as an example of the “privilege” of the present invention, but the privilege of the present invention can be set in an arbitrary format. For example, as another example of the privilege of the present invention, setting on the game that favors the progress on the game, adjustment, or provision of an item that favors the progress on the game may be given. Items that are not directly related may be given.

  In the above-described embodiment, the case where the present invention is applied to a social game has been described as an example, but the present invention is not limited to this. For example, even in a so-called online game system in which a server device placed on a network and a home online game machine are connected, distance information can be associated with each user as in the above-described embodiment, and search processing can be performed. It can be performed.

  In the above-described embodiment, the game server 20 and the database server 30 on the network are configured to realize the functions of the respective units illustrated in FIG. 19, but are not limited to this configuration. All these means may be realized by the communication terminal 10, or at least a part of the means may be realized by the communication terminal 10. Since the communication terminal 10 and the game server 20 have substantially the same hardware configuration, each function can be realized by the communication terminal 10 as described in the above embodiment. 27A and 27B show examples of sharing between the communication terminal 10, the game server 20, and the database server 30 for each function (each function shown in FIG. 19) of the game control device of the present embodiment. Indicates.

  In the embodiment described above, the search game has been described. However, the process of searching for a user is not limited to being used in a game. For example, when a user searches for another specific user on a social network, a certain relationship (for example, a relationship with a message transmission / reception history, a relationship registered in the same community, a relationship registered as a friend, etc.) ) Can follow a link between certain users to help find a specific user's My Page or the like. An information processing apparatus such as a network server that implements such a mechanism may have the same functions as the functions illustrated in FIG. That is, such an information processing apparatus can be realized in the same manner as the above-described embodiment using the same hardware configuration as that shown in FIGS.

10: Communication terminal 11 ... CPU
12 ... ROM
13 ... RAM
DESCRIPTION OF SYMBOLS 14 ... Image processing part 15 ... Instruction input part 16 ... Display part 17 ... Communication interface part 18 ... Bus 20 ... Game server 21 ... CPU
22 ... ROM
23 ... RAM
24 ... Database access unit 25 ... Communication interface unit 26 ... Bus 30 ... Database server 31 ... User database 32 ... Game database 51 ... Association means 52 ... Setting means 53 ... First association means 54 ... Determination means 55 ... Identification means 56 ... second association means 57 ... change means 58 ... presentation means 59 ... intimacy setting means 60 ... giving means

Claims (11)

An association means for relating users,
In a network based on a link indicating a relationship between users, setting means for setting a target user that is a user to be a search target;
First association means for associating predetermined first numerical information with the target user;
Determining means for determining whether each user satisfies a predetermined condition;
A specifying unit that specifies numerical information closest to the first numerical information among numerical information associated with a user within a predetermined number of links from a first user that satisfies the predetermined condition on the network. When,
Second association for associating numerical information with the first user based on the numerical information specified by the specifying means and the number of links between the second user and the first user associated with the numerical information Means,
A changing means for sequentially changing a reference user, which is a search reference user, based on the link of the network according to input information of a search user who searches for a target user,
Each time the reference user is changed by the changing means, when numerical information is associated with the changed reference user, a presentation means for presenting information based on the numerical information to the searching user;
A game control device comprising: The predetermined condition is that the user has accessed the game,
The game control apparatus according to claim 1. The predetermined condition is that a time allocated randomly for each user or a time allocated according to a predetermined rule for each user has been reached,
The game control apparatus according to claim 1. The setting means sets a plurality of target users,
The second association means associates numerical information with the first user for each target user,
The game control device according to claim 1. A closeness setting means for setting a closeness according to the degree of the relationship between users between the users related by the correlating means,
The second association means associates numerical information with the first user such that the number of links between adjacent users on the network is adjusted according to the closeness between the users. ,
The game control apparatus as described in any one of Claims 1-4. When a reference user and the target user match, an providing means for granting a privilege to a search user is provided.
The game control device according to claim 1. The second association unit adds the numerical information specified by the specifying unit and the number of links between the second user and the first user to calculate numerical information associated with the first user. It is characterized by
The game control device according to claim 1. Steps to relate users,
Setting a target user that is a search target user in a network based on a link indicating a relationship between users;
Associating predetermined first numerical information with the target user;
Determining whether each user satisfies a predetermined condition;
Of the numerical information associated with the user within the range of the predetermined number of links from the first user satisfying the predetermined condition on the network, the numerical information closest to the first numerical information is associated. Identifying a second user,
Associating numerical information with the first user based on the numerical information specified by the specifying step and the number of links between the second user and the first user associated with the numerical information;
Sequentially changing a reference user, which is a search reference user, based on the link of the network according to input information of a search user who searches for a target user;
When numerical information is associated with the changed reference user each time the reference user is changed, a step of presenting information based on the numerical information to the searching user;
A game control method comprising: On the computer,
A function to relate users,
A function for setting a target user who is a search target user in a network based on a link indicating a relationship between users;
A function of associating predetermined first numerical information with a target user;
A function for determining whether or not each user satisfies a predetermined condition;
Of the numerical information associated with the user within the range of the predetermined number of links from the first user satisfying the predetermined condition on the network, the numerical information closest to the first numerical information is associated. A function to identify the second user,
A function of associating numerical information with the first user based on the numerical information specified by the specifying function and the number of links between the second user and the first user associated with the numerical information;
A function of sequentially changing a reference user, which is a user serving as a search reference, based on the link of the network, according to input information of a search user who searches for a target user, and
When numerical information is associated with the changed reference user each time the reference user is changed, a function of presenting information based on the numerical information to the searching user,
A program to realize A game system including a communication terminal and a server accessed from the communication terminal,
An association means for relating users,
Setting means for setting a target user, which is a user to be a search target, in a network based on a link indicating a relationship between users;
First association means for associating predetermined first numerical information with the target user;
Determining means for determining whether or not each user satisfies a predetermined condition;
Of the numerical information associated with the user within the range of the predetermined number of links from the first user satisfying the predetermined condition on the network, the numerical information closest to the first numerical information is associated. Identifying means for identifying a second user,
Second association for associating numerical information with the first user based on the numerical information specified by the specifying means and the number of links between the second user and the first user associated with the numerical information means,
A changing unit that sequentially changes a reference user, which is a search reference user, based on the link of the network, in accordance with input information of a search user who searches for a target user, and
Each time the reference user is changed by the changing means, when numerical information is associated with the changed reference user, a presentation means for presenting information based on the numerical information to the searching user,
Each of the means is provided in either the communication terminal or the server,
Game system. An association means for relating users,
In a network based on a link indicating a relationship between users, setting means for setting a target user that is a user to be a search target;
First association means for associating predetermined first numerical information with the target user;
Determining means for determining whether each user satisfies a predetermined condition;
A specifying unit that specifies numerical information closest to the first numerical information among numerical information associated with a user within a predetermined number of links from a first user that satisfies the predetermined condition on the network. When,
Second association for associating numerical information with the first user based on the numerical information specified by the specifying means and the number of links between the second user and the first user associated with the numerical information Means,
A changing means for sequentially changing a reference user, which is a search reference user, based on the link of the network according to input information of a search user who searches for a target user,
Each time the reference user is changed by the changing means, when numerical information is associated with the changed reference user, a presentation means for presenting information based on the numerical information to the searching user;
An information processing apparatus comprising:

Images