WO2013145472A1 - Serveur, terminal, système de jeu, procédé de commande de jeu, programme et support d'enregistrement non temporaire - Google Patents

Serveur, terminal, système de jeu, procédé de commande de jeu, programme et support d'enregistrement non temporaire Download PDF

Info

Publication number
WO2013145472A1
WO2013145472A1 PCT/JP2012/083066 JP2012083066W WO2013145472A1 WO 2013145472 A1 WO2013145472 A1 WO 2013145472A1 JP 2012083066 W JP2012083066 W JP 2012083066W WO 2013145472 A1 WO2013145472 A1 WO 2013145472A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
answer
inquiry
request
friendship
Prior art date
Application number
PCT/JP2012/083066
Other languages
English (en)
Japanese (ja)
Inventor
正能 鈴木
暢也 北村
浩之 冨田
Original Assignee
株式会社コナミデジタルエンタテインメント
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 株式会社コナミデジタルエンタテインメント filed Critical 株式会社コナミデジタルエンタテインメント
Publication of WO2013145472A1 publication Critical patent/WO2013145472A1/fr

Links

Images

Classifications

    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/70—Game security or game management aspects
    • A63F13/79—Game security or game management aspects involving player-related data, e.g. identities, accounts, preferences or play histories
    • A63F13/795—Game security or game management aspects involving player-related data, e.g. identities, accounts, preferences or play histories for finding other players; for building a team; for providing a buddy list
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/70—Game security or game management aspects
    • A63F13/79—Game security or game management aspects involving player-related data, e.g. identities, accounts, preferences or play histories
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/30—Interconnection arrangements between game servers and game devices; Interconnection arrangements between game devices; Interconnection arrangements between game servers
    • A63F13/35—Details of game servers
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/85—Providing additional services to players
    • A63F13/87—Communicating with other players during game play, e.g. by e-mail or chat
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/30—Interconnection arrangements between game servers and game devices; Interconnection arrangements between game devices; Interconnection arrangements between game servers
    • A63F13/35—Details of game servers
    • A63F13/352—Details of game servers involving special game server arrangements, e.g. regional servers connected to a national server or a plurality of servers managing partitions of the game world
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F2300/00—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game
    • A63F2300/50—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers
    • A63F2300/55—Details of game data or player data management
    • A63F2300/5593—Details of game data or player data management involving scheduling aspects

Definitions

  • the present invention provides a server device, a terminal, a game system, a game control method suitable for promoting friendship between users, a program for realizing these on one or more computers, and a non-transitory ) Related recording media.
  • 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
  • the game parameters of the user are updated.
  • 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.
  • Patent Document 1 proposes a technique for increasing the intention of participating in a game by maintaining a friendship between users.
  • 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.
  • the present invention solves the above-described problems, and implements a server device, a terminal, a game system, a game control method, and the like suitable for promoting friendship between users by one or more computers.
  • An object is to provide a program and a non-transitory recording medium.
  • the server device 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 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 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.
  • the challenge may be configured such that the first user is a name, name or honorary name for calling the second user.
  • 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.
  • 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.
  • 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.
  • 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 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.
  • 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 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 storing 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;
  • an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
  • the answer 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.
  • a non-temporary recording medium is a non-temporary recording medium for recording a program for realizing a game system that provides a game capable of building a friendship between users.
  • the program is 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;
  • an update unit that updates the storage unit so that a friendship between the first user and the second user is stored;
  • the answer 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 can be 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, semiconductor memory, and the like. It is read temporarily (Random) Access Memory) or the like and executed by a CPU (Central Processing Unit) or the like.
  • 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, semiconductor memory, and the like. It is read temporarily (Random) Access Memory) or the like and executed by a CPU (Central Processing Unit) or the like.
  • 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.
  • a server device a terminal, a game system, a game control method suitable for promoting friendship between users, a program for realizing these on one or more computers, and non-temporary recording A medium can be provided.
  • FIG. 1 is an explanatory diagram showing a hardware configuration for realizing the game system according to the present embodiment.
  • FIG. 1 is an explanatory diagram showing a hardware configuration for realizing the game system according to the present embodiment.
  • 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.
  • each server apparatus 102 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.
  • a CPU Central Processing Unit
  • a program recorded in a non-volatile 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-transitory information recording medium such as a DVD-ROM (Digital Versatile Disk Read Only Memory).
  • a high-speed information storage device such as a RAM (Random Access Memory).
  • 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.
  • NIC Network Interface Card
  • the CPU 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 to inform 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.
  • the game system 101 can be realized by using the server device 102 that functions as a web server.
  • the game system 101 may be realized by executing a client program dedicated to the game in the terminal 104 and executing a server program dedicated to the game in the server device 102.
  • 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.
  • a description will be given with reference to FIG.
  • the server apparatus 102 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.
  • 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.
  • the game system 101 can be configured by the server apparatus 102 alone without providing the independent terminal 104.
  • 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.
  • the server apparatus 102 typically further includes an inquiry reception unit 207, a selection unit 208, and a response sending unit 209, but these elements can be omitted.
  • the storage unit 201 is most commonly realized by a non-volatile 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. .
  • 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.
  • users who are friends are stored in association with each other.
  • the user of the user name p and the user of the user name q are in a friendship
  • the following Conceivable 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.
  • 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.
  • the user name of the user who has a friendship is stored.
  • the CPU manages the storage unit 201.
  • 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”.
  • 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.
  • 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.
  • a situation is considered in which the first user requests the second user to make a friendship.
  • the first user needs to know the existence of the second user by some means.
  • 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.
  • 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.
  • 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.
  • 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.
  • the response 302 includes information such as the user name of the second user and an outline of the game parameter, 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 showing a display example in which information obtained by a user inquiry is displayed on the screen.
  • FIG. 4 is an explanatory diagram showing a display example in which information obtained by a user inquiry is displayed on the screen.
  • 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.
  • the name of the second user is “John”.
  • the terminal 104 can be configured to advance a game by adopting an operation system according to a web browser.
  • a keypad used for a telephone can be adopted as a shortcut for button operation.
  • 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.
  • the request button 404 or the like may be operated.
  • a request 303 is sent from the terminal 104 to the server apparatus 102.
  • the request button 404 it is desirable to attach the information to the request 303 so that the first user can input and select various messages addressed to the second user.
  • the request receiving unit 202 receives a request 303 for requesting establishment of a friendship with the second user from the first user.
  • 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.
  • the inquiry 304 can be transmitted in real time.
  • 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.
  • a description will be given with reference to FIG.
  • 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.
  • a message area 504 for displaying a message from the first user is arranged.
  • a message input or selected when the first user selects the request button 404 is displayed.
  • the name of the first user is “Maria”, and “Mr. John, please be friends” is displayed as a message from the first user.
  • 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.
  • the rejection button 506 may be assigned to a key different from these, for example, a “0” key.
  • an answer 305 is sent from the terminal 104 used by the second user to the server apparatus 102.
  • 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.
  • the answer reception unit 204 receives an answer 305 to the inquiry 304 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.
  • friendship can be canceled by an explicit operation instruction from the first user or the second user.
  • 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.
  • 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. .
  • communication 311 for proceeding with the game is appropriately performed between the terminal 104 used by the first user and the server apparatus 102.
  • 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 apparatus 102
  • a message 308 in which the contents are copied is used by the second user from the server apparatus 102.
  • 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.
  • FIG. 6 is a flowchart showing a control flow of the game control process executed in the server apparatus 102.
  • 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.
  • step S601 the CPU first performs various initializations.
  • the CPU controls the NIC and tries to receive a packet sent from the terminal 104 (step S602). It is desirable to provide a predetermined timeout period for this trial.
  • the CPU checks the result of the trial, that is, whether or not the packet can be received and, if received, the type of the packet (step S603).
  • the user who sent the packet is referred to as “user p”.
  • step S603 If the packet is an inquiry 301 of the user q (step S603; q inquiry), 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.
  • step S603 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.
  • step S603 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.
  • step S603 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.
  • step S603 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.
  • step S603 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.
  • the message from the first user to the second user accompanying the inquiry 304 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.
  • 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.
  • the friendship is promoted by appropriately setting the challenge when the first user calls the second user.
  • 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.
  • 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.
  • 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. .
  • 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.
  • 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.
  • the third uses a name based on the attribute of the second user.
  • 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.
  • 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 showing a display example of a screen for prompting selection of challenge candidates.
  • a description will be given with reference to FIG.
  • 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.
  • the user name of the second user is “John”.
  • the challenge candidate 702 (1) “Boss” (2) “Director” (3) "John” (5) “Mr. John” are displayed.
  • the challenge candidate 702 is determined as a challenge for the second user.
  • the user's easiest selection operation is “Mr. John” assigned to the numeric key “5” arranged in the center of the keypad.
  • 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.
  • 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.
  • a description will be given with reference to FIG.
  • 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.
  • 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.
  • the request 303 is accompanied by a greeting message that always includes the challenge selected by the first user.
  • 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.
  • 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.
  • 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.
  • the server apparatus 102 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 apparatus 102 sends this message 308 to the second user, whereby 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.
  • 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.
  • 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.
  • this information may be referred to as appropriate when the message is relayed.
  • This example increases the frequency of cancellation and establishment of friendships by setting a limit on the time limit for maintaining friendships.
  • 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
  • the grace period can be calculated by subtracting the current date and time from the date and time when the friendship expires, and the date and time when the friendship expires can be obtained by adding the grace period to the current date and time. Therefore, the two representation formats are substantially equivalent.
  • 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.
  • the update unit 205 deletes the pair from the storage unit 201. This deletion process cancels the friendship.
  • 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.
  • a predetermined upper limit value such as 20 days as an equity
  • this equity can be assigned to another user who has a friendship.
  • the remaining period during which user P can maintain a friendship is (1)
  • User X has another 5 days
  • user Y 4 more days
  • With user Z 3 more days
  • 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.
  • the margin of the period in 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.
  • 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).
  • the grace period of the friendship between the user p and the user q at a certain date and time t is denoted as A (t, p, q).
  • a (t, p, q) 0
  • 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.
  • the update unit 205 subtracts this value at an appropriate timing.
  • the grace period A (t, p, q) can be calculated from the expiration date / time C (p, q) and the current time t.
  • 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.
  • B (t, p) T- ⁇ s ⁇ F (t, p) A (t, p, s) It is.
  • B (t, q) T- ⁇ s ⁇ F (t, q) A (t, q, s) It is.
  • the server apparatus 102 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.
  • 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). .
  • the terminal 104 of the first user p that has received the response 302 presents to the first user p whether or not a friendship with the second user q can be made based on the response 302.
  • a friendship with the second user q can be established with the first user p.
  • an upper limit period during which a friendship can be established may be presented in the parameter area 403 shown in FIG.
  • FIG. 9 is an explanatory diagram showing a display example in which it is displayed on the screen that a friendship cannot be established by a user inquiry.
  • 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.
  • the first user p needs to set a period of time for maintaining a friendship with the second user q.
  • 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.
  • a description will be given with reference to FIG. 10
  • 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.
  • the numerical value displayed in the period area 903 continues to increase until the upper limit specified in the response 302 is reached.
  • the numerical value displayed in the period area 903 continues to increase until reaching a predetermined lower limit (typically a constant “1 day”).
  • 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.
  • 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.
  • 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.
  • the friendship period selected by the first user p is displayed in the message area 504.
  • the second user q only needs to consider whether or not to make a friendship for the period requested by the first user p.
  • 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.
  • the number of days allowed by the second user q is designated as the answer 305 that designates approval.
  • 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.
  • the information referred to in the second embodiment is also referred to in the third embodiment to promote establishment of friendship.
  • a user who is playing a game on a mobile phone tends to prefer an operation of repeatedly pressing 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.
  • the name of the second user is determined based on the user's superiority or inferiority in the game.
  • the superiority or inferiority is determined by the first user in the third embodiment. This is used to determine the initial value for selecting the period.
  • 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.
  • the selection unit 208 shortens the period of the initial value as the second user q is superior to the first user p.
  • 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.
  • the first user p requests the friendship with the second user q again.
  • the friendship 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 with the partner who once had the friendship but has been canceled and has passed.
  • 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.
  • the physical strength, occupation, and position 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.
  • 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.
  • the selection unit 208 selects candidates and default values so as to avoid a rude call in the above-mentioned partial order relationship as compared with the previous call.
  • 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.
  • the candidates themselves are obtained by the same method as in the above embodiment.
  • 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.
  • the challenge added to the message may be updated even while the friendship is maintained.
  • 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.
  • the server apparatus 102 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.
  • the friendship with the second user can be further strengthened by updating such a call. become able to.
  • 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.
  • the elements of the storage unit 201 to the response sending unit 209 are not necessarily provided in the server apparatus 102.
  • the game system 101 can be configured to include one or a plurality of computers that can exchange with a plurality of users.
  • the storage unit 201 to the response sending unit 209 Each element can adopt a mode realized on any computer.
  • 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.
  • the same effects as those of the above-described embodiment can be obtained.
  • a server device As described above, according to the present invention, a server device, a terminal, a game system, a game control method, a non-transitory recording medium, and one or more of these suitable for promoting friendship between users It is possible to provide a program that is realized by a computer.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • General Business, Economics & Management (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

L'unité de réception de requêtes (202) du serveur de la présente invention (102) reçoit d'un premier utilisateur une requête de mise en relation amicale avec un second utilisateur. Une unité de transmission de demandes (203) transmet au second utilisateur une demande pour savoir si la requête doit être acceptée ou rejetée. Une unité de réception de réponses (204) reçoit une réponse du second utilisateur. Une unité de mise à jour (205) met à jour une unité d'enregistrement (201) de façon à ajouter la paire associant premier et second utilisateur lorsque la réponse correspond à une acceptation. Une unité de transmission de réponses (206) transmet au premier utilisateur une réponse indiquant l'acceptation ou le rejet indiqué dans la réponse du second utilisateur. La demande accompagne un chiffre-référence en provenance du premier utilisateur et à destination du second utilisateur. Le chiffre-référence accompagnant la demande est présenté au second utilisateur afin que celui-ci décide s'il accepte ou rejette la requête.
PCT/JP2012/083066 2012-03-29 2012-12-20 Serveur, terminal, système de jeu, procédé de commande de jeu, programme et support d'enregistrement non temporaire WO2013145472A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2012077781A JP5291819B1 (ja) 2012-03-29 2012-03-29 ゲームシステム、ゲーム制御方法、ならびに、プログラム
JP2012-077781 2012-03-29

Publications (1)

Publication Number Publication Date
WO2013145472A1 true WO2013145472A1 (fr) 2013-10-03

Family

ID=49258805

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2012/083066 WO2013145472A1 (fr) 2012-03-29 2012-12-20 Serveur, terminal, système de jeu, procédé de commande de jeu, programme et support d'enregistrement non temporaire

Country Status (2)

Country Link
JP (1) JP5291819B1 (fr)
WO (1) WO2013145472A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008212269A (ja) * 2007-03-01 2008-09-18 Konami Digital Entertainment:Kk ゲーム装置、キャラクタ制御方法、および、プログラム
JP2010035908A (ja) * 2008-08-07 2010-02-18 Namco Bandai Games Inc プログラム、情報記憶媒体及びゲーム装置
JP2010237970A (ja) * 2009-03-31 2010-10-21 Namco Bandai Games Inc ネットワークシステム、サーバ、プログラム、及び情報記憶媒体

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008212269A (ja) * 2007-03-01 2008-09-18 Konami Digital Entertainment:Kk ゲーム装置、キャラクタ制御方法、および、プログラム
JP2010035908A (ja) * 2008-08-07 2010-02-18 Namco Bandai Games Inc プログラム、情報記憶媒体及びゲーム装置
JP2010237970A (ja) * 2009-03-31 2010-10-21 Namco Bandai Games Inc ネットワークシステム、サーバ、プログラム、及び情報記憶媒体

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"Final Fantasy XI o Asobo", DENGEKI PLAYSTATION, vol. 8, no. 14, 28 June 2002 (2002-06-28), pages 38 *

Also Published As

Publication number Publication date
JP2013202343A (ja) 2013-10-07
JP5291819B1 (ja) 2013-09-18

Similar Documents

Publication Publication Date Title
US9597597B2 (en) Management server, controlling method thereof, non-transitory computer readable storage medium having stored thereon a computer program for a management server and terminal device
US8965978B2 (en) Methods and devices for maintaining sessions based on presence status information
JP4971210B2 (ja) サービス提供システム、サービス提供方法、及びコンピュータプログラム
US20140349754A1 (en) Management server, controlling method thereof, non-transitory computer readable storage medium having stored thereon a computer program for a management server and terminal device
US9486710B2 (en) Management server, controlling method thereof, non-transitory computer readable storage medium having stored thereon a computer program for a management server and terminal device
WO2006098588A1 (fr) Systeme de gestion de reseau humain en ligne et procede pour inciter les utilisateurs a construire divers aspects de la relation
JP4976565B1 (ja) メッセージ配信システム、メッセージ配信システムの制御方法、メッセージ配信制御装置、及びプログラム
JP6709589B2 (ja) コミュニケーション装置、コミュニケーションシステムおよびコミュニケーションプログラム
KR101889154B1 (ko) 온라인 쿠폰 및 포인트 적립을 이용하여 오프라인 만남 확률을 증가시키는 온라인 친구 추천 서비스 제공 방법
JP5227469B1 (ja) サーバ装置、ゲームシステム、ゲーム制御方法、ならびに、プログラム
KR20180095478A (ko) 온라인 쿠폰 및 포인트 적립을 이용하여 오프라인 만남 확률을 증가시키는 온라인 친구 추천 서비스 제공 방법
JP5689503B2 (ja) サーバ装置、ゲームシステム及びプログラム
JP5291819B1 (ja) ゲームシステム、ゲーム制御方法、ならびに、プログラム
KR101781520B1 (ko) 여행정보 공유 서비스 시스템 및 여행정보 공유 서비스 방법
JP6097953B2 (ja) 管理装置、管理装置と通信可能な端末装置、サービス提供システム、管理装置の制御方法、端末装置のプログラム及び管理装置のプログラム
JP6762641B1 (ja) マッチング支援方法及びサーバ
JP6843496B2 (ja) 参加管理システム、管理支援装置、管理支援プログラム
JP2007213516A (ja) 制御サーバ及び制御方法
WO2021049594A1 (fr) Serveur d'aide à la communication, procédé d'aide à la communication, et programme d'aide à la communication
JP2014119835A (ja) 情報提供装置のプログラム、情報提供装置の制御方法、情報提供装置、及び、情報提供システム
KR20010097190A (ko) 통신상의 만남주선 서비스방법
JP2014035586A (ja) イベント管理装置、イベント管理装置の制御方法、イベント管理装置のプログラム
JP6175730B2 (ja) 管理装置、管理装置と通信可能な端末装置、サービス提供システム、管理装置の制御方法、端末装置のプログラム及び管理装置のプログラム
JP2014038415A (ja) 催事管理装置の管理方法、催事管理装置、及び、催事管理装置のプログラム
JP2014191443A (ja) 予約管理装置のプログラム、予約管理装置の制御方法、予約管理装置、及び、予約管理システム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12872422

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 12872422

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE