JP5291819B1 - GAME SYSTEM, GAME CONTROL METHOD, AND PROGRAM - Google Patents

Abstract

A server device or the like that promotes friendship between users and encourages participation in a game is provided.
A request receiving unit 202 of a server apparatus 102 receives a request for friendship with a second user from a first user. The inquiry sending unit 203 sends an inquiry as to whether to approve or reject the request to the second user. The answer reception unit 204 receives an answer from the second user. The update unit 205 updates the storage unit 201 so that a pair of the first user and the second user is added if approval is specified in the answer. The response sending unit 206 sends a response indicating approval or rejection specified in the answer to the first user. The inquiry involves a challenge from the first user to the second user. The challenge with the query is presented to the second user to determine whether the second user approves or rejects the request.
[Selection] Figure 2

Description

  The present invention relates to a server device, a terminal, a game system, a game control method, and a program for realizing these on one or more computers, which are suitable for promoting friendship between users.

  2. Description of the Related Art Conventionally, when a user progresses a game, a game that advantageously advances the game by setting another user as a friend or deepening exchanges between friends has been provided.

  Such friendships include those that correspond to “friends” in everyday terms, relationships between people belonging to guilds that are formed taking into account in-game skills, RPG (Roll Playing Game) It is a broad concept including “the persons who play the game while forming a special relationship in a certain game”, such as the relationship between persons who form a party in

  In games that allow you to build friendships, the advantages and disadvantages of the progress of the game change depending on the number of other users who have friendships, you can rent items you have temporarily, play games, There are widespread modes such as playing a game by temporarily increasing one's own physical strength parameter in accordance with the physical strength parameter, and acquiring point parameters by exchanging messages with friends.

  When the user advances the game, the game parameters of the user are updated. However, in the above-described aspect, various game parameters of the user's friend are referred to, and the user's game parameter is more advantageous than the case where the user has no friend. It is updated.

  Here, Patent Document 1 proposes a technique for increasing the intention to participate in a game by maintaining a friendship between users.

  In the technique disclosed in Patent Document 1, when it is detected that one user has not logged in to the game for a long time after a friendship is once established, the other user logs in to one user. In order to maintain friendships, it is set so that an e-mail prompting the user is automatically sent.

JP 2009-1000078 A

  However, even in the real world, it is difficult for those who do not know the other party to make friends. Therefore, there is a strong demand for a technique that allows game users to smoothly start friendships. At this time, there is a strong demand for promoting dialogue between users.

  The present invention solves the above problems, and is suitable for promoting a friendship between users, a server device, a terminal, a game system, a game control method, and these in one or more computers. The purpose is to provide a program to be realized.

  In order to achieve the above object, the following invention is disclosed in accordance with the principle of the present invention.

The server device according to the first aspect of the present invention provides a game capable of building friendships between users,
A request receiving unit that receives a request for establishing a friendship with the second user from the first terminal used by the first user;
When the request is accepted, if the friendship between the first user and the second user is not stored in the storage unit in which the friendship between the users is stored, the second terminal used by the second user An inquiry sending section for sending an inquiry asking whether to approve or reject the request;
An answer receiving unit for receiving an answer to the inquiry from the second terminal;
When the answer is accepted, if approval is specified for the answer, an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
A response sending unit for sending a response indicating approval or rejection specified in the answer to the first terminal when the answer is accepted;
The inquiry involves a call from the first user to the second user,
The challenge associated with the inquiry is configured to be presented to the second user at the second terminal to determine whether the second user approves or rejects the request.

The terminal according to the second aspect of the present invention provides a game capable of building friendships between users,
A request receiving unit that receives a request for establishing a friendship with the second user from the first user;
When the request is accepted, if the friendship between the first user and the second user is not stored in the storage unit that stores the friendship between the users, the request is approved to the second user. Inquiry sending department that sends inquiries asking whether to refuse or not,
An answer receiving unit for receiving an answer to the inquiry from the second user;
When the answer is accepted, if approval is specified for the answer, an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
A response sending unit that sends a response indicating approval or rejection specified in the answer to the first user when the answer is accepted;
The inquiry involves a call from the first user to the second user,
The challenge associated with the inquiry is configured to be presented to the second user to determine whether the second user approves or rejects the request.

A game system according to a third aspect of the present invention provides a game capable of building friendships between users,
A request receiving unit that receives a request for establishing a friendship with the second user from the first user;
When the request is accepted, if the friendship between the first user and the second user is not stored in the storage unit that stores the friendship between the users, the request is approved to the second user. Inquiry sending department that sends inquiries asking whether to refuse or not,
An answer receiving unit for receiving an answer to the inquiry from the second user;
When the answer is accepted, if approval is specified for the answer, an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
A response sending unit that sends a response indicating approval or rejection specified in the answer to the first user when the answer is accepted;
The inquiry involves a call from the first user to the second user,
The challenge associated with the inquiry is configured to be presented to the second user to determine whether the second user approves or rejects the request.

In the game system of the present invention,
The challenge may be configured such that the first user is a name, name or honorary name for calling the second user.

In the game system of the present invention,
The challenge may be configured to be determined based on a degree of superiority or inferiority of the second user with respect to the first user in the game.

In the game system of the present invention,
An inquiry reception unit for receiving an inquiry for information on the second user from the first user;
When the inquiry is accepted, a selection unit that selects a candidate for calling from the first user to the second user based on the game parameters of the first user and the second user in the game,
A response sending unit for sending a response indicating the information of the second user to the first user;
The reply is accompanied by the selected candidate,
The first user can be configured to determine a challenge associated with the request based on a candidate associated with the response.

In the game system of the present invention,
The update unit deletes the friend relationship that satisfies a predetermined cancellation condition from the storage unit,
The selecting unit is configured to select a candidate for the call based on the previously determined call if the call from the first user to the second user has been previously determined. can do.

In the game system of the present invention,
The game system may be configured to add the challenge to a message to be sent from the first user to the second user.

A game control method according to a fourth aspect of the present invention is a game control method executed by a game system that provides a game capable of building friendships between users,
The game system includes a request receiving unit, an inquiry sending unit, an answer receiving unit, an updating unit, a response sending unit,
The game control method includes:
A request receiving step for receiving a request for establishing a friendship with the second user from the first user;
When the request is accepted, the inquiry sending unit, if the friendship between the first user and the second user is not stored in the storage unit in which the friendship between the users is stored, the second user Sending an inquiry to inquire whether to approve or reject the request,
An answer receiving step in which the answer accepting unit accepts an answer to the inquiry from the second user;
When the answer is accepted, if the approval is specified for the answer, the update unit updates the storage unit so that the friendship between the first user and the second user is stored. Process,
When the answer is accepted, the response sending unit includes a response sending step of sending a response indicating approval or rejection specified in the answer to the first user.
The inquiry involves a call from the first user to the second user,
The challenge associated with the inquiry is configured to be presented to the second user to determine whether the second user approves or rejects the request.

A program according to a fifth aspect of the present invention realizes a game system for providing a game capable of building a friendship between users, and the program includes a computer,
A request receiving unit that receives a request for establishing a friendship with the second user from the first user;
When the request is accepted, if the friendship between the first user and the second user is not stored in the storage unit that stores the friendship between the users, the request is approved to the second user. Inquiry sending department that sends inquiries asking whether to refuse or not,
An answer receiving unit for receiving an answer to the inquiry from the second user;
When the answer is accepted, if approval is specified for the answer, an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
When the answer is accepted, it functions as a response sending unit that sends a response indicating approval or rejection specified in the answer to the first user,
The inquiry involves a call from the first user to the second user,
The challenge associated with the query causes the second user to function as presented to the second user to determine whether to approve or reject the request.

  The program of the present invention is recorded on a computer-readable non-transitory information storage medium such as a compact disk, flexible disk, hard disk, magneto-optical disk, digital video disk, magnetic tape, and semiconductor memory. The data is temporarily read out to a RAM (Random Access Memory) or the like and executed by a CPU (Central Processing Unit) or the like.

  Further, the program of the present invention can be distributed and sold via a transitory communication medium such as a computer communication network, independently of the computer on which the program is executed. The information storage medium can be distributed and sold independently from the computer.

  ADVANTAGE OF THE INVENTION According to this invention, the server apparatus suitable for promoting the friendship between users, a terminal, a game system, a game control method, and the program which implement | achieves these with one or more computers can be provided. .

It is explanatory drawing which shows the hardware constitutions for implement | achieving the game system which concerns on embodiment of this invention. It is explanatory drawing which shows schematic structure of the game system which concerns on embodiment of this invention. It is a session figure which shows the mode of communication in the game system which concerns on embodiment of this invention. It is explanatory drawing which shows the example of a display on which the information obtained by a user's inquiry is displayed on a screen. It is explanatory drawing which shows the example of a display as which information is displayed on a screen in the inquiry with respect to a user. It is a flowchart which shows the flow of control of the game control process performed in a server apparatus. It is explanatory drawing which shows the example of a display of the screen which prompts selection of a call candidate. It is explanatory drawing which shows the example of a display of the screen which prompts the edit of a greeting message. It is explanatory drawing which shows the example of a display displayed on a screen that a friend relationship cannot be concluded by a user's inquiry. It is explanatory drawing which shows the example of a display for calculating | requiring a user the selection of the period which wants to maintain friendship.

  Embodiments of the present invention will be described below. In the following, for ease of understanding, an embodiment in which a game system according to the present invention is realized using a game server device will be described. However, the embodiment described below is for explanation. The scope of the present invention is not limited. Therefore, those skilled in the art can employ embodiments in which each or all of these elements are replaced with equivalent ones, and these embodiments are also included in the scope of the present invention.

  FIG. 1 is an explanatory diagram showing a hardware configuration for realizing the game system according to the present embodiment. Hereinafter, a description will be given with reference to FIG.

  As shown in the figure, the game system 101 includes one or a plurality of server devices 102. The server device 102 is communicably connected to a terminal 104 via a computer communication network 103 such as the Internet or a mobile phone communication network. Is done.

  When a plurality of server apparatuses 102 are prepared, each server apparatus 102 performs load distribution as appropriate autonomously or under the control of a load distribution apparatus (not shown).

  The server apparatus 102 is realized by a computer executing a predetermined server program.

  Generally, in a computer, a CPU (Central Processing Unit) reads a program recorded in a nonvolatile storage device such as a hard disk or a flash memory, and performs various calculations and interpretations to execute various processes. . These programs are installed on a hard disk or the like from a non-temporary information recording medium such as a DVD-ROM (Digital Versatile Disk Read Only Memory).

  In addition, information temporarily required for calculation in processing executed by the computer is stored in a high-speed information storage device such as a RAM (Random Access Memory).

  In addition, the computer is connected to the computer communication network 103 via a NIC (Network Interface Card) or the like, and communicates with the terminal 104 used by the user.

  In the present embodiment, by executing the program, the CPU receives an operation instruction or the like from a user participating in the game via the terminal 104, and based on the operation instruction, the progress parameter of the game itself, The process of updating various parameters of the user in the game and sending information notifying the current progress of the game to the terminal 104 based on the various parameters after the update to notify the user participating in the game repeat.

  The terminal 104 plays a role of receiving an operation instruction from the user and displaying an image and outputting a sound for notifying the progress of the game.

  The terminal 104 includes a mobile phone or a smartphone used by the user, a PDA (Personal Data Assistance), a game terminal, various computers, and the like. When the terminal 104 provides a function corresponding to a web browser, the game system 101 can be realized by using the server device 102 that functions as a web server.

  Further, the game system 101 may be realized by executing a client program dedicated to the game at the terminal 104 and executing the server program dedicated to the game at the server device 102.

  If the administrator directly instructs the server computer, use the keyboard or mouse connected to the server computer. If you want to check the processing results directly, connect to the server computer. However, the administrator may adopt a mode in which an instruction is given from the terminal 104 connected via the NIC and the processing result is displayed on the terminal 104. .

  FIG. 2 is an explanatory diagram showing a schematic configuration of the server apparatus 102 according to the present embodiment. Hereinafter, a description will be given with reference to FIG.

  As described above, the server apparatus 102 according to the present embodiment is realized by one or a plurality of computers executing a server program.

  The game system 101 includes a server device 102 and a terminal 104. In this case, a computer that is communicably connected to the server apparatus 102 functions as the terminal 104 by executing a terminal program such as a web browser.

  Further, in a mode in which each user can directly access the server device 102, the game system 101 can be configured by the server device 102 alone without providing the independent terminal 104.

  Here, as shown in this figure, the server apparatus 102 provides a game that can build friendships between users, and includes a storage unit 201, a request receiving unit 202, an inquiry sending unit 203, an answer receiving unit 204, and an updating unit. 205, a response sending unit 206 is provided.

  As shown in the figure, the server apparatus 102 typically further includes an inquiry reception unit 207, a selection unit 208, and a response transmission unit 209, but these elements can be omitted.

  The storage unit 201 is most commonly realized by a nonvolatile storage device such as a hard disk or a flash disk included in the server computer.

  The request reception unit 202, the inquiry transmission unit 203, the response reception unit 204, the response transmission unit 206, the inquiry reception unit 207, and the response transmission unit 209 are realized by the NIC included in the server computer operating under the control of the CPU. . Note that a terminal computer used by the user is communicably connected to these elements, and accepts user operation instructions and presents various information to the user.

  The update unit 205 and the selection unit 208 are realized by a CPU that reads and writes information from and to a hard disk or the NIC.

  Hereinafter, functions of each unit will be described.

First, in the storage unit 201, users who are friends are stored in association with each other. For example, when the user of the user name p and the user of the user name q are in a friendship, as a method of storing the user name p and the user name q in association with each other on a hard disk or the like, for example, the following Conceivable.
(1) A column in which user names p and q are sorted and arranged in character code order or dictionary order is stored as it is in a variable length array or the like, or the column is employed as an associative array key.
(2) As a part of each user's game parameter, the user name of the user who has a friendship is stored. In this aspect, when the user name q is included in the friendship parameter in the user's game parameter of the user name p, the user name p is always included in the friendship parameter in the user's game parameter of the user name q. As described above, the CPU manages the storage unit 201.

  In the following, in order to facilitate understanding, the user with the user name p and the user with the user name q are stored in association with each other, and the fact that both users are in a friendship relationship is stored as “p, q It will be called "a pair is memorized".

  Depending on the type of game, there are cases where it is better to be able to make and cancel friendships more easily than in the real world. In such a case, the time limit for the friendship (the date and time when the friendship expires, or the grace period from the present until the friendship expires) is one of the records included in each element of the variable length array, The deadline management can be performed by a method such as using an element identified by giving a key to the associative array or providing a deadline field in the friendship parameter.

  The storage unit 201 is generally prepared inside the server apparatus 102 as in the present embodiment. However, as described above, if it is possible to manage reading and writing of information related to friendships, as a function, It is enough. That is, the storage medium itself that implements the storage unit 201 may be arranged outside the server device 102.

  For example, when a memory card or a hard disk of the terminal 104 is used as a place for storing actual information, the server apparatus 102 causes the CPU to communicate with the terminal 104 via the NIC to read / write information. The storage unit 201 is prepared in the terminal 104.

  In the following, consider a situation where the first user requests the second user to form a friendship. In order to start such a situation, the first user needs to know the existence of the second user by some means. For this, various modes such as having the first user introduce another user who already knows, knowing from the ranking of the game, introducing by matching of the server device 102 can be adopted. is there.

  FIG. 3 is a session diagram showing a state of communication in the game system 101 according to the embodiment of the present invention.

  First, the inquiry reception unit 207 of the server apparatus 102 receives an inquiry 301 for requesting information on the second user from the first user.

  Here, the inquiry 301 is for the first user who knows the existence of the second user to confirm the detailed information of the second user. After confirming the detailed information, the friend 301 forms a friendship. A request is made.

  Then, the selection unit 208 of the server apparatus 102 selects information that is related to the second user and should be presented to the first user, and the response sending unit 209 sends a response 302 indicating the selected information to the first user. Send to user.

  In general, the response 302 includes information such as the user name of the second user and an outline of game parameters, and the information of the second user is presented on the screen of the terminal 104 used by the first user.

  FIG. 4 is an explanatory diagram illustrating a display example in which information obtained by a user inquiry is displayed on the screen. Hereinafter, a description will be given with reference to FIG.

  The screen 401 includes an avatar area 402 in which an image of the appearance of an avatar (character) used by the second user during game play is displayed, a parameter area 403 in which an overview of the game parameters of the second user is displayed, and the like. A request button 404 for requesting the second user to establish a friendship and a menu button 405 serving as an entrance for performing various other operations are prepared. In this example, the name of the second user is “John”.

  As described above, the terminal 104 can be configured to advance the game by adopting an operation system according to the web browser. In a web browser mounted on a mobile phone, a keypad used for a telephone can be adopted as a shortcut for button operation. For example, the request button 404 is selected by pressing the key “5”, the menu button 405 is selected by operating the key “*”, and the like. It is desirable to make these operations common in other states described below.

  In addition, in the mode of selecting one of the operation targets displayed on the screen using the mouse, tab key, etc., specify various buttons with the cursor and then click with the mouse or press the return key. Thus, the request button 404 or the like may be operated.

  When the first user selects the request button 404, a request 303 is sent from the terminal 104 to the server device 102.

  As will be described later, after selecting the request button 404, it is preferable that the first user such as various messages addressed to the second user can input and select the information and attach the information to the request 303.

  Then, the request receiving unit 202 receives a request 303 for requesting establishment of a friendship with the second user from the first user.

  When the request 303 is accepted, if the first user and the second user are not associated with each other and stored in the storage unit 201, the inquiry sending unit 203 determines whether to approve or reject the request 303 to the second user. An inquiry 304 for inquiry is sent.

  If the second user is also accessing the server apparatus 102 and playing a game, the inquiry 304 can be transmitted in real time.

  However, similar to general sending and receiving of e-mails, various messages such as inquiries 304 addressed to the second user are accumulated in the server device 102, and when the second user logs into the server device 102, these messages are stored. A method of presenting a message to the second user or presenting a message to the second user after an explicit operation of the second user may be employed.

  FIG. 5 is an explanatory diagram showing a display example in which information is displayed on the screen in the inquiry to the user. Hereinafter, a description will be given with reference to FIG.

  Similar to the display example shown in FIG. 4, the screen 501 includes an avatar area 502 in which an image of the appearance of an avatar (character) used by the first user during game play is displayed, and an overview of the game parameters of the first user. In addition to a parameter area 503 for displaying the message area 504, a message area 504 for displaying a message from the first user is arranged. In the message area 504, a message input or selected when the first user selects the request button 404 is displayed. In this example, the name of the first user is “Maria”, and “Mr. John, please be friends” is displayed as a message from the first user.

  In addition, the approval button 505 for accepting the request 303 from the first user and establishing the friendship with the first user, rejecting the request 303 from the first user and establishing the friendship with the first user. A refusal button 506 for preventing the operation and a menu button 507 serving as an entrance for performing various other operations are prepared.

  When operating with a mobile phone, it is desirable to assign the key “5” to the approval button 505 and assign the key “*” to the menu button 507 to share the situation and operation system shown in FIG. On the other hand, the rejection button 506 may be assigned to a key different from these, for example, a “0” key.

  When the second user selects the approval button 505 or the rejection button 506, an answer 305 is sent from the terminal 104 used by the second user to the server apparatus 102. In this answer 305, approval or rejection is designated depending on which of the approval button 505 and the rejection button 506 the user has selected.

  Now, in the server apparatus 102, the answer reception unit 204 receives an answer 305 to the inquiry 304 from the second user.

  When the answer 305 is accepted, if approval is specified in the answer 305, the update unit 205 updates the storage unit 201 so that a pair of the first user and the second user is added.

  As a result, a friendship between the first user and the second user is established.

  The friendship can be canceled by an explicit operation instruction from the first user or the second user. As will be described later, when a time limit is set for the friendship, the friendship is canceled when the grace period until the time limit expires.

  The cancellation of the friendship is most simply performed by deleting the pair of the first user and the second user from the storage unit 201. For example, by adding flag information indicating that the pair is invalid , “Pair deletion” may be expressed.

  Further, when the answer 305 is accepted, the response sending unit 206 sends a response 306 indicating approval or rejection specified in the answer 305 to the first user.

  The response 306 is transmitted as a message from the second user to the first user, and is presented to the first user in real time, when the first user logs in, or by an explicit operation of the first user. .

  After this, communication 311 for proceeding with the game is appropriately performed between the terminal 104 used by the first user and the server apparatus 102.

  When a message 307 addressed to the second user from the first user is sent from the terminal 104 used by the first user to the server device 102, a message 308 in which the contents are copied is used by the second user from the server device 102. To the terminal 104 that performs the processing. Similarly, the message 309 addressed to the first user from the second user is relayed by the server apparatus 102 and arrives at the first user as a message 310.

  In addition, in this figure, although the communication for a 2nd user's game progress is abbreviate | omitting illustration, like the case of a 1st user, the server apparatus 102 and the terminal 102 which a 2nd user uses Communication takes place between them.

  FIG. 6 is a flowchart showing a control flow of the game control process executed in the server apparatus 102. Hereinafter, a description will be given with reference to FIG.

  This process is started when the server program is executed by the CPU in the server apparatus 102.

  When this process is started, the CPU first performs various initializations (step S601).

  Then, the CPU attempts to receive a packet sent from the terminal 104 by controlling the NIC (step S602). It is desirable to provide a predetermined timeout period for this trial.

  Next, the CPU checks the result of the trial, that is, whether or not the packet is received and if it is received, the type of the packet (step S603). Hereinafter, the user who sent the packet is referred to as “user p”.

  If the packet is an inquiry 301 of the user q (step S603; q is inquired), the CPU acquires the information of the user q from the hard disk or the like (step S604), and asks the user p based on the acquired information. Information on the user q to be presented is selected, a reply 302 is generated (step S605), the NIC is controlled, the reply 302 is sent to the user p (step S606), and the process returns to step S602.

  On the other hand, if the packet is a request 303 for establishing a friendship to the user q (step S603; request to q), the CPU is addressed to the user q inquiring whether or not to accept the request for establishing a friendship from the user p. A query 304 is generated (step S607), the NIC is controlled, the query 304 is sent to the user q (step S608), and the process returns to step S602.

  Further, if the packet is an answer 305 indicating whether or not a friendship with the user r is established (step S603; reply to r), and if the answer 305 is to approve the establishment of the friendship (step S621; Yes), the CPU adds a pair representing the friendship between the user p and the user r to the hard disk or the like (step S609). Further, a response 306 addressed to the user r is generated based on the answer 305 (step S610), the NIC is controlled, the response 306 is sent to the user r (step S611), and the process returns to step S602. If the friendship is rejected (step S621; No), the process proceeds to step S610.

  If the packet is a message 307 addressed to the user s (step S603; message to s), the CPU generates a message 308 to be sent to the user s from the received packet (step S612), and controls the NIC. The message 308 is sent to the user s (step S613), and the process returns to step S602.

  In addition, if the packet is an instruction for advancing the game (step S603; instruction), the game of the user p is advanced based on the instruction (step S614), and progress information indicating the progress result is displayed. It generates (step S615), sends the generated progress information to the user p (step S616), and returns to step S602.

  When the game progresses, referring to the number of other users who have a friendship with the user p and the game parameters of the other users, the more excellent friends, the more advantageous the progress of the game. It can be configured as follows.

  If another type of packet is received or if the packet cannot be received until time-out occurs (step S603; other), processing according to the circumstances is executed (step S617), and the process proceeds to step S602. Return.

  The above configuration corresponds to the basic configuration of the present invention, and the friendship can be further promoted by adopting various modes described below. Various configurations that can be added to the basic configuration will be described below.

  In this embodiment, in order to promote friendship, the message from the first user to the second user accompanying the inquiry 304 in the above embodiment is devised.

  This message is for making a call from the first user to the second user so as to establish a friendship. Whether the call accompanying the inquiry 304 approves or rejects the request 303? Is presented to the second user.

  That is, the message accompanying the inquiry 304 addressed to the second user from the first user is displayed in the message area 504 in the screen 501 of the terminal 104 used by the second user.

  In the present embodiment, the friendship is promoted by appropriately setting a challenge when the first user calls the second user.

  When the inquiry 301 is received by the server device 102, the selection unit 208 selects candidates for calling from the first user to the second user based on the game parameters of the first user and the second user in the game in step S605. Select. The following can be considered as candidates for interrogation.

  The first is a title for the second user. The server device 102 proposes an appropriate title because the requester to establish a friendship generally pays homage to the requester.

  For example, you may use terms that represent respect such as “sama” or “san” added to the user name of the second user, or you can use the 2nd user name such as “Sir,” “His Majesty”, “your Highness”, etc. An honorific name that does not use the user name of the user may be used.

  The second is a designation for the second user based on the degree of superiority or inferiority of the second user with respect to the first user. Of the game parameters, the degree of superiority or inferiority is determined by making a comparison based on numerical values that change as the game progresses, for example, level, stage, ability, experience value, physical strength, money held, number of possessed items, etc. .

  When the second user is superior to the first user, the honorary name is obtained by the same method as the first method, and this can be used as the name of the second user.

  When the second user is inferior to the first user, it is conceivable to add a term representing a casual relationship such as “you” or “chan” to the user name of the second user.

  Thirdly, a designation based on the attribute of the second user is used. Among the game parameters, attributes are determined based on the gender, occupation, title, etc. of the avatar (character) in the game of the second user or the second user, and the name is determined.

  For example, names such as “general”, “village chief”, “boss”, “director”, “Sir”, “Ma'am” can be adopted. Further, these methods may be used in an overlapping manner as appropriate. For example, when the user name of the second user is “Yamada”, “General” is added and “Yamada Shogun” is called.

  This aspect has the effect of increasing the motivation of the second user with respect to the establishment of the friendship by the second user being called by the first user with the honorific name, and the challenge candidates are managed by the server device 102. It is possible to prevent the user from using an inappropriate challenge by mistake.

  The selected challenge candidate is designated in the reply 302. For this reason, in this embodiment, when the request button 404 for the second user is selected by the first user, the terminal 104 used by the first user is selected if there is one candidate for the first user. Whether there is a plurality of candidates or not.

  FIG. 7 is an explanatory diagram illustrating a display example of a screen that prompts selection of challenge candidates. Hereinafter, a description will be given with reference to FIG.

  As shown in this figure, when the first user selects a request button 404 for requesting establishment of a friendship with the second user, the screen 401 of the terminal 104 used by the first user displays the first user A plurality of candidate calls 702 for the second user recommended to use are displayed.

In the example shown in the figure, the user name of the second user is “John”. In this example, as the challenge candidate 702,
(1) “Boss”
(2) “Director”
(3) "John"
(5) “Mr. John”
Are displayed.

  By pressing a numeric key associated with the challenge candidate 702, the challenge candidate 702 is determined as a challenge for the second user.

  In the example shown in the figure, the user's easiest selection operation is “Mr. John” assigned to the numeric key “5” arranged in the center of the keypad.

  Therefore, the selection unit 208 also calculates the degree of which candidate is more appropriate when a plurality of candidates are selected. The most appropriate candidate is set as a “default value”, and the default value is assigned to a key that can be selected most easily by the user. In such an aspect, user convenience can be improved.

  Hereinafter, an example in which the user selects “Mr. John” will be described.

  In the present embodiment, when the first user selects a challenge for the second user, the greeting message from the first user to the second user can be edited.

  FIG. 8 is an explanatory diagram showing a display example of a screen for prompting editing of a greeting message. Hereinafter, a description will be given with reference to FIG.

On the screen 401 of the terminal 104 used by the first user, greeting candidates 801 for selecting any one of the standard greetings are displayed.
(1) “Nice to meet you, John”
(2) “Thank you, John”
(3) “You ’re nice, John”
(5) "Mr. John, please be friends"

  Each greeting candidate 801 also includes a call selected by the first user.

  When the first user presses a numeric key preceding the greeting candidate 801, a request 303 specifying the greeting candidate 801 is sent from the terminal 104 used by the first user to the server apparatus 102, and the server apparatus 102 The inquiry 304 corresponding to the request 303 is sent to the terminal 104 used by the second user at an appropriate timing.

  Thus, in this embodiment, the request 303 is accompanied by a greeting message that always includes the challenge selected by the first user.

  Instead of presenting the greeting candidate 801 and allowing the user to select it, a message display field may be displayed to allow the user to input a free sentence. In such an aspect, the terminal device 104 used by the first user must always display “Mr. John”, which is the call selected by the first user, before or after the greeting message input by the first user. In addition, the request 303 includes a greeting message to which a challenge is added, and then the request 303 is sent to the server apparatus 102.

  As described above, in this embodiment, by sending a polite greeting message from the first user to the second user, the possibility that the friendship establishment request from the first user to the second user may be approved. Can be high.

  Note that the name selected by the first user as a challenge to the second user can be used even after the game has progressed. For example, assume that the first user wishes to transmit a message to the second user while the game is in progress.

  When the message 307 addressed to the second user from the first user is sent from the terminal 104 used by the first user to the server apparatus 102, the server apparatus 102 displays the call selected by the first user at the beginning or end of the message 307. A message 308 added to is generated.

  The server device 102 sends this message 308 to the second user, so that the polite attitude of the first user with respect to the second user is transmitted to the second user. For this reason, it becomes possible to raise the motivation which maintains the friendship with the 1st user of the 2nd user as it is.

  Here, the message addressed to the second user from the first user may be always added with a call selected by the first user, for example, with a predetermined probability using a random number. It's also good.

  In the case of adopting such an aspect, the server apparatus 102 stores the call from the first user to the second user determined by the first user in the storage unit 201 in association with the friend relationship between the two users. In addition, this information may be referred to as appropriate when the message is relayed.

  The present embodiment increases the frequency of cancellation and establishment of friendships by limiting the time limit for maintaining friendships.

  As described above, it is possible to set a time limit for the friendship. In the storage unit 201, this time limit is the date and time when the friendship expires, or a grace period from the current time to the date and time when the friendship expires. It is expressed by

  If the current date and time are subtracted from the date and time when the friendship expires, the grace period can be calculated, and if the grace period is added to the current date and time, the date and time when the friendship expires can be obtained. Therefore, the two representation formats are substantially equivalent.

  However, when the expression format of the grace period is adopted, the update unit 205 needs to reduce the grace period at an appropriate timing. For example, the updating unit 205 may subtract the grace period for 24 hours once a day.

  When the grace period becomes 0 or less, that is, when the current time is later than the date and time when the friendship expires, the update unit 205 deletes the pair from the storage unit 201. This deletion process cancels the friendship.

  In order to facilitate understanding of the present embodiment, first, the limitation on the time limit for maintaining the friendship will be described with specific numbers, and then a more general description will be given.

The user has, for example, a predetermined upper limit value such as 20 days as an equity, and this equity can be assigned to another user who has a friendship. For example, at some point, the remaining period during which user P can maintain a friendship is
(1) User X has another 5 days
(2) With user Y, another 4 days
(3) With user Z, 3 more days
(4) If there are 8 days left, the user W is 5 + 4 + 3 + 8 = 20, and since the equity has been allocated up to the upper limit, it is not possible to form a friendship with a new user.

When one day has passed, the period during which the user P can maintain friendship is
(1) With user X, 4 more days
(2) With User Y, another 3 days
(3) With user Z, two more days
(4) The user W has 7 days to go, and 4 + 3 + 2 + 7 = 16. Therefore, there is 4 days to the upper limit. Therefore, at this stage, measures such as “to make a friendship with a new user V for 4 days”, “to make a friendship with a new user V for 3 days, and to make a friendship with a new user U for 1 day”, etc. It is possible to take.

In addition, when two days have passed without forming a new friendship, the friendship with the user Z is canceled, and the period during which the user P can maintain the friendship is
(1) User X has two more days
(2) With user Y, one more day
(3) The user W has another 5 days, and 2 + 1 + 5 = 8, so there is a margin of 12 days. In this state, for example, “continue friendship with user W for 7 days, make friendship with new user V for 3 days, and make friendship with new user U for 2 days” is taken. be able to.

  In this way, the margin of the period during which the friendship can be established increases based on the passage of time and the current number of friends. For this reason, it is possible to maintain friendships, find new friends, and revive friendships by searching for appropriate strategies according to the user's own preferences and circumstances regarding who and who to build friendships with. You can also enjoy that.

Hereinafter, a set of other users who have a friendship with the user p at a certain date and time t is denoted as F (t, p). Further, a grace period of friendship between the user p and the user q at a certain date and time t is expressed as A (t, p, q). In addition, when the friendship is not established between the users p and q at the date and time t,
A (t, p, q) = 0
Suppose that

For example, if u is the last stage of the numerical example above,
F (u, P) = {X, Y, W};
A (u, P, X) = 2;
A (u, P, Y) = 1;
A (u, P, W) = 5;
A (u, P, Z) = 0;
A (u, P, V) = 0;
A (u, P, U) = 0
It becomes.

  As described above, the grace period A (t, p, q) or information substantially equivalent thereto is associated with the pair of users p and q in which the friendship is established, and is associated with the storage unit 201. It is remembered.

In a mode in which the grace period A (t, p, q) itself is stored in the storage unit 201, the update unit 205 subtracts this value at an appropriate timing. On the other hand, in the aspect in which the storage unit 201 stores the date and time C (p, q) when the friendship between the users p and q expires,
A (t, p, q) = max (C (p, q) -t, 0)
Thus, the grace period A (t, p, q) can be calculated from the expiration date / time C (p, q) and the current time t.

Now, the sum total of the grace period in the friendship that the user p is connected to is
Σ _{q∈F (t, p)} A (t, p, q)
It can be calculated as follows.

In the present embodiment, a limit is imposed on this sum. That is, a predetermined upper limit value T is provided, and for an arbitrary user p,
Σ _{q∈F (t, p)} A (t, p, q) ≦ T
It imposes restrictions on the grace period so that In the present embodiment, an arbitrary user p needs to strategically build friendships under the above restrictions.

In the numerical example at time u above,
T = 20;
_{Σq∈F (u, P)} A (u, P, q) = A (u, P, X) + A (u, P, Y) + A (u, P, W) = 2 + 1 + 5 = 8
It becomes.

Here, it is assumed that the user p thinks that he / she wants to make a new friendship with the user q at the date / time t. That is, no friendship is established between the user p and the user q at the date and time t. Then
F (t, p) ∩ {q} = φ, {p} ∩F (t, q) = φ
Is established. That is, at the date and time t, q is not included in the friend set F (t, p) of p, and p is not included in the friend set F (t, q) of q.

At time t, the maximum value B (t, p) for the grace period during which user p can newly establish a friendship is
B (t, p) = T-Σ _{s∈F (t, p)} A (t, p, s)
It is.

In addition, the maximum value B (t, q) for the grace period during which the user q can newly establish a friendship is
B (t, q) = T-Σ _{s∈F (t, q)} A (t, q, s)
It is.

Therefore, in a situation where the user p wants to request the establishment of a friendship with the user q, the upper limit D (t, p, q) for the grace period that can be set for the friendship between the users p and q is
D (t, p, q) = min (B (t, p), B (t, q))
It becomes.

  In this embodiment, when the server apparatus 102 receives the inquiry 301 of the second user q from the first user p at the date and time t, the server apparatus 102 calculates the upper limit value D (t, p, q) for the grace period. To do.

  If D (t, p, q)> 0, the reply 302 specifies that it is possible to form a friendship with the second user q together with the calculation result D (t, p, q). .

  On the other hand, if D (t, p, q) ≦ 0, the reply 302 specifies that a friendship with the second user q cannot be established.

  The terminal 104 of the first user p that has received the reply 302 presents to the first user p whether or not a friendship with the second user q can be made based on the reply 302.

  For example, as shown in FIG. 4, if the request button 404 is displayed, the first user p can be connected with the second user q.

  In addition, an upper limit period during which a friendship can be established may be presented in the parameter area 403 shown in FIG.

  Below, the method of the presentation to the 1st user p when the friendship with the 2nd user p cannot be concluded is demonstrated.

  FIG. 9 is an explanatory diagram illustrating a display example in which it is displayed on the screen that a friendship cannot be established by a user inquiry. Hereinafter, a description will be given with reference to FIG.

  The display example shown in this figure is almost the same as that shown in FIG. 4, but a note 901 indicating “no friend” is displayed instead of the request button 404. Since the first user p cannot operate the request button 404, the second user q cannot be requested to establish a friendship.

  Now, return to the case where you can make a friendship and continue the explanation. The first user p needs to set a period of time for maintaining a friendship with the second user q.

  In the present embodiment, after the first user p operates the request button 404, the period is selected.

  FIG. 10 is an explanatory diagram illustrating a display example for requesting the user to select a period in which a friendship is desired to be maintained. Hereinafter, a description will be given with reference to FIG.

As shown in the figure, the screen 401 displays operation candidates 902 that can be operated with numeric keys as follows.
(1) “Increase”
(3) “Reduce”
(5) “Decide on the day”

  The numeric keys “1” and “3” are used to increase or decrease the numerical value displayed in the period area 903. The numerical value displayed in the period area 903 indicates that the first user p wishes to make a friendship. It means the number of days to do.

  If the numeric key “1” is kept pressed, the numerical value displayed in the period area 903 continues to increase until the upper limit specified in the response 302 is reached.

  When the numeric key “3” is kept pressed, the numerical value displayed in the period area 903 continues to increase until reaching a predetermined lower limit (typically, a constant “1 day”).

  When the numeric key “5” is operated, the numerical value displayed in the period area 903 becomes the number of days selected by the first user p, and the period represented by this number of days is designated in the request 303 sent to the server apparatus 102. Will be.

  Similar to the input of various messages, the period may be input by inputting characters using a keypad or the like. In this example, the period is selected, but the date when the friendship expires may be input.

  In this way, the period specified in the request 303 is specified in the inquiry 304 and sent from the server apparatus 102 to the terminal 104 used by the second user q.

  Similarly to the above embodiment, when the inquiry 304 is sent, the terminal 104 of the second user q prompts the user to select whether to accept or reject the second user q using a display similar to that shown in FIG. At this time, along with the greeting from the first user p, the friendship period selected by the first user p is displayed in the message area 504.

  That is, in the present embodiment, the second user q only needs to consider whether or not to make a friendship for the period requested by the first user p.

  As shown in FIG. 10, the number of days can be edited so that the second user q can reduce the number of days desired by the first user p. In this case, the number of days allowed by the second user q is designated as the answer 305 that designates approval.

  In this way, when it is agreed between the first user p and the second user q to maintain a friendship for a certain period, the period specified by the first user p in the request 303 in step S609. (Or the period allowed by the second user p in the answer 305) may be stored in association with the pair.

  In the present embodiment, the information referred to in the second embodiment is also referred to in the third embodiment to promote establishment of friendship.

  In general, a user who is playing a game on a mobile phone tends to prefer an operation of repeatedly hitting a decision key (in this embodiment, the “5” key is used). Therefore, the convenience for the user is improved by providing an initial value that seems to be appropriate for establishing a friendship when selecting the period shown in FIG.

  Here, as described above, in the second embodiment, there is a mode in which the name of the second user is determined based on the user's superiority or inferiority in the game. In this embodiment, the superiority or inferiority is determined by the first user in the third embodiment. Used to determine initial value for period selection.

  That is, in the present embodiment, the selection unit 208 selects a period suitable for the first user p to request a friendship from the second user q. The selected period is specified in the reply 302 sent from the server apparatus 102 to the terminal apparatus 104. The terminal 104 of the first user p that has received the reply 302 employs the period specified in the reply 302 as an initial value to be displayed in the period area 903 immediately after the first user p operates the request button 404. It is.

  In general, when requesting a friendship from an inferior user to a superior user, it is possible that a friendship will be established if the period associated with the request is conserved rather than vice versa. Tend to be higher. Therefore, the selection unit 208 shortens the period of the initial value as the second user q is superior to the first user p.

Another way to do a more detailed statistical analysis is:
(1) Difference in user's superiority (2) Maximum requested grace period (3) For the length of the requested period (4) Analyzing the percentage of requests approved, An appropriate initial value may be selected from the difference between superiority and inferiority and the maximum value of the required grace period.

  According to the present embodiment, by using a difference in user's superiority and inferiority, a period in which a friendship is highly likely to be established is selected, and by setting this as an initial value, the convenience of the user is achieved, and the friendship Will be able to promote.

  As in the above embodiment, after the friendship between the first user p and the second user q is resolved by setting a time limit on the friendship, the first user p requests the friendship with the second user q again. There are things to do. For example, when the user wants to continue the friendship as it is, or when he wants to reestablish the friendship again with the partner who once had the friendship but has been canceled and the number of days has passed.

  Attention should be paid to the old call that was used for the second user q in the past and the new call that should be used for the second user q when trying to make a friendship again. Need to pay.

  That is, the old call and the new call may be the same, or the new call may be more polite than the old call, but the new call If the call is more rude than the old call, the possibility of causing trouble will increase.

  For example, if you call a friend whom you previously called “Mr. XX” called “Mr. XXX”, “Mr. XX”, and “Mr. XX” and request a friendship, the other person feels rude, The possibility of rejecting friendships is likely to increase.

  In addition, as the game progresses, the physical strength, occupation, and title of the second user q may change. For example, if the second user q has advanced, it is better to adopt a call suitable for a new position. On the other hand, when the second user q is demoted, if a friendship is requested with a call according to a new job title, the second user q feels “looked down by the first user p”, There is a possibility of refusing friendship.

It can be difficult to determine which of the two interrogations X, Y is more polite. However, for the two interrogations X and Y,
(1) Interrogation Y is more polite than interrogation X. Interrogation X is more rude than interrogation Y.
(2) The call X is more polite than the call Y. Call Y is more rude than Call X.
(3) The interrogation X and the interrogation Y are as polite.
(4) The difference in the degree of politeness between the challenge X and the challenge Y cannot be determined.
It is possible to determine which one is. That is, it can be considered that a semi-order relation in mathematics is established for the politeness of the interrogation.

  Therefore, in the present embodiment, the selection unit 208 selects the second user from the first user p previously selected by the first user p when selecting a candidate for calling from the first user p to the second user q. Get a call to user q.

  Then, the selection unit 208 selects candidates and default values so as to avoid a rude challenge in the above-mentioned partial order relationship as compared with the previous challenge.

  The first method is a method in which no more rude calls than previous calls are candidates. That is, after obtaining a call candidate by the same method as in the above embodiment, a call that is more rude than the previous call is excluded from the candidates.

  In the second method, the candidates themselves are obtained by the same method as in the above embodiment. However, if the default value of the candidate obtained in the same manner as in the above embodiment is more rude than the previous challenge, Instead of setting the candidate as a default value, the previous challenge is set as the default value.

  This embodiment is a mode in which the friendship is automatically canceled with the passage of time, in particular, when the cancellation of the friendship is detected or when the date to be canceled approaches, It is effective when combined with an aspect that prompts the determination of whether or not to continue the relationship.

  Note that, as in the example of the friendship re-request described above, the challenge added to the message may be updated even while the friendship is maintained.

  For the second user selected by the selection unit 208, the status of the second user changes, such as a change in the position or level of the second user, or a significant change in the ability difference between the first user and the second user. When it is detected that the candidate has changed, or periodically, the server apparatus 104 reselects the candidate and the default value, and inquires of the first user whether to change the challenge to the second user. I will do it.

  In particular, in the mode in which the call selected by the first user is automatically added by the subsequent message exchange, the friendship with the second user can be further strengthened by updating such a call. become able to.

  In the above embodiment, the game system 101 is based on the premise that the server apparatus 102 and the terminal 104 communicate via the computer communication network 103.

  However, the elements of the storage unit 201 to the response sending unit 209 are not necessarily provided in the server apparatus 102.

  That is, the game system 101 can be configured to include one or a plurality of computers that can exchange with a plurality of users. In this case, the storage unit 201 to the response sending unit 209 Each element can adopt a mode realized on any computer.

  For example, when the terminals 104 perform peer-to-peer communication directly or via the computer communication network 103 and the server apparatus 102 does not intervene in the communication, one of the two terminals 104 is connected to the storage unit 201 through the response sending unit 209. By realizing each of the above elements and functioning as the server device 102, the same effects as those of the above-described embodiment can be obtained.

  As described above, according to the present invention, a server device, a terminal, a game system, a game control method suitable for promoting friendship between users, and a program for realizing these on one or more computers Can be provided.

DESCRIPTION OF SYMBOLS 101 Game system 102 Server apparatus 103 Computer communication network 104 Terminal 201 Memory | storage part 202 Request reception part 203 Inquiry sending part 204 Answer reception part 205 Update part 206 Response sending part 207 Inquiry reception part 208 Selection part 209 Reply sending part 301 Inquiry 302 Reply 303 Request 304 Query 305 Reply 306 Response 307 Message 308 Message 309 Message 310 Message 311 Communication for game progress 401 Screen 402 Avatar area 403 Parameter area 404 Request button 405 Menu button 501 Screen 502 Avatar area 503 Parameter area 504 Message area 505 Approve button 506 Reject button 507 Menu button 702 Calling candidate 801 Greeting candidate 901 Precautionary statement 90 Candidate 903 period area of operation

Claims (7)

A game system that provides a game capable of building friendships between users,
An inquiry reception unit for receiving an inquiry for information on the second user from the first user;
When the inquiry is accepted, a selection unit that selects a candidate for calling from the first user to the second user based on the game parameters of the first user and the second user in the game,
A response sending unit for sending a response indicating the information of the second user and the selected candidate to the first user;
Wherein the first user, the request receiving unit that receives a request for establishment of friendship between the second user,
When the request is accepted, if the friendship between the first user and the second user is not stored in the storage unit that stores the friendship between the users, the request is approved to the second user. Inquiry sending department that sends inquiries asking whether to refuse or not,
An answer receiving unit for receiving an answer to the inquiry from the second user;
When the answer is accepted, if approval is specified for the answer, an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
A response sending unit that sends a response indicating approval or rejection specified in the answer to the first user when the answer is accepted;
The inquiry involves a call from the first user to the second user selected by the first user based on the candidate indicated in the response ;
The game system is characterized in that the challenge accompanying the inquiry is presented to the second user in order to determine whether the second user approves or rejects the request. The game system according to claim 1 ,
The game system is characterized in that the challenge is a name, a name, or a name for the first user to call the second user. The game system according to claim 2 ,
The challenge is determined based on a degree of superiority or inferiority of the second user with respect to the first user in the game. The game system according to any one of claims 1 to 3 ,
The update unit deletes the friend relationship that satisfies a predetermined cancellation condition from the storage unit,
The selection unit, if a call from the first user to the second user has been previously determined, selects the call candidate based on the previously determined call. A game system. The game system according to claim 4 ,
The game system adds the challenge to a message to be sent from the first user to the second user. A game control method executed by a game system that provides a game capable of building friendships between users,
The game system includes an inquiry reception unit, a selection unit, a response transmission unit, a request reception unit, an inquiry transmission unit, an answer reception unit, an update unit, and a response transmission unit.
The game control method includes:
An inquiry reception step in which the inquiry reception unit receives an inquiry for information on the second user from the first user;
When the inquiry is accepted, the selection unit selects a candidate for calling from the first user to the second user based on the game parameters of the first user and the second user in the game. Process,
A reply sending step in which the reply sending unit sends a reply indicating the information of the second user and the selected candidate to the first user;
The request receiving unit, from said first user, the request accepting step of accepting a request for the establishment of friendship between the second user,
When the request is accepted, the inquiry sending unit, if the friendship between the first user and the second user is not stored in the storage unit in which the friendship between the users is stored, the second user Sending an inquiry to inquire whether to approve or reject the request,
An answer receiving step in which the answer accepting unit accepts an answer to the inquiry from the second user;
When the answer is accepted, if the approval is specified for the answer, the update unit updates the storage unit so that the friendship between the first user and the second user is stored. Process,
When the answer is accepted, the response sending unit includes a response sending step of sending a response indicating approval or rejection specified in the answer to the first user.
The inquiry involves a call from the first user to the second user selected by the first user based on the candidate indicated in the response ;
The challenge according to the inquiry is presented to the second user to determine whether the second user approves or rejects the request. A program for realizing a game system that provides a game capable of building friendships between users, the program comprising:
An inquiry reception unit for receiving an inquiry for information on the second user from the first user;
When the inquiry is accepted, a selection unit that selects a candidate for calling from the first user to the second user based on the game parameters of the first user and the second user in the game,
A response sending unit for sending a response indicating the information of the second user and the selected candidate to the first user;
Wherein the first user, the request receiving unit that receives a request for establishment of friendship between the second user,
When the request is accepted, if the friendship between the first user and the second user is not stored in the storage unit that stores the friendship between the users, the request is approved to the second user. Inquiry sending department that sends inquiries asking whether to refuse or not,
An answer receiving unit for receiving an answer to the inquiry from the second user;
When the answer is accepted, if approval is specified for the answer, an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
When the answer is accepted, it functions as a response sending unit that sends a response indicating approval or rejection specified in the answer to the first user,
The inquiry involves a call from the first user to the second user selected by the first user based on the candidate indicated in the response ;
The interrogation accompanying the inquiry causes the second user to function as presented to the second user in order to decide whether to approve or reject the request.

Images