JP5340977B2 - Introduction device, introduction method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an introduction device and the like suitable for preventing a fraud caused when specific characters frequently play with each other in an online game. <P>SOLUTION: A reception part 201 of the introduction device 200 receives a request for designating a character seeking for an opponent, from a plurality of terminal devices. A request memory part 202 stores the requests. A selection part 203 selects any two of the requests stored in the request memory part 202. A notification part 204 transmits a response for designating the character concerning the other request to the terminal device concerning one request, and transmits the response for designating the character concerning the one request to the terminal device concerning the other request. An erasing part 205 erases a pair of selected requests, after notification, from the request memory part 202. A history memory part 206 stores the history of the pair of the requests. The selection part 203 selects requests again when a predetermined prohibited time has not passed since the pair of requests were stored in the history memory part 206. <P>COPYRIGHT: (C)2011,JPO&amp;INPIT

Description

  The present invention relates to an introduction device, an introduction method, and a program suitable for preventing fraudulent acts caused by frequent battles between specific characters in a communication battle game.

  A communication battle game in which a plurality of players play a game via a communication network is known. Such games include a game in which one character is assigned to one player, such as a battle fighting game, and a game in which one team composed of a plurality of characters is assigned to one player, such as a soccer game or a baseball game. is there. In the following, it is assumed that the “character” includes a team assigned to one player. In starting the battle game, the player first connects a terminal device operated by the player to a server device called a lobby server, and introduces a character as an opponent. After that, the player plays a battle game against an unspecified number of opponents through communication established between the terminal device of the player and the terminal device on which the introduced character is operated. Made. Here, Patent Document 1 discloses a technique for detecting fraudulent attempts to manipulate rankings by invalidating the battle results.

JP 2009-189622 A

  In the battle game as described above, a player having two terminal devices connects to the two terminal devices at the same time to introduce the lobby server so that a battle is performed between the two terminal devices. In order to cause the characters associated with both terminal devices to battle each other many times and raise the ranking of one character, an illegal act of losing the other character may be performed. Therefore, a technique for preventing such an action is required.

  The present invention solves the problems as described above, and provides an introduction device, an introduction method, and a program suitable for preventing fraudulent acts caused by frequent battles between specific characters in a communication battle game. The purpose is to do.

  An introduction device according to a first aspect of the present invention includes a reception unit, a request storage unit, a selection unit, a notification unit, an erasure unit, and a history storage unit, and is configured as follows.

  The accepting unit accepts a request for designating a character that is operated by the player in the terminal device and is seeking an opponent from each of the plurality of terminal devices.

  For example, when a player starts a battle game, a request for specifying a character operated by the player on his / her terminal device and a character to battle is transmitted to the introduction device. The accepting unit of the introducing device accepts a request transmitted from the terminal device. The accepting unit accepts such a request from a plurality of terminal devices.

  The request storage unit stores the received request.

  Here, the request includes information on the terminal device that has transmitted the request and the character that is operated on the terminal device. For example, if the accepting unit accepts a request for an opponent of the character A operated on the terminal device X, the request storage unit stores the accepted request, the terminal device X, and the character A in association with each other. To do.

  The selection unit selects any two of the requests stored in the request storage unit as a pair.

  For example, when requests transmitted from the terminal devices X, Y, and Z are stored in the request storage unit, the selection unit selects any two requests from these three requests.

  The notification unit notifies the terminal device related to one request of the selected request pairs of a response specifying the character related to the other request as an opponent, and the terminal device related to the other request A response that designates the character related to the request as an opponent is notified.

  For example, when the selection unit selects a request from the terminal device X and a request from the terminal device Y, the notification unit uses the terminal device Y as the opponent of the character A operated by the terminal device X. A response designating the character B to be operated is notified. At the same time, the notification unit notifies the terminal device Y of a response that designates the character A operated by the terminal device X as the opponent of the character B operated by the terminal device Y.

  When notified, the erasure unit erases each of the selected request pairs from the request storage unit.

  For example, after the notification unit notifies the terminal device X and the terminal device Y of a response specifying the opponent, the erasure unit erases the request transmitted from the terminal device X and the terminal device Y stored in the request storage unit To do.

  The history storage unit stores the history of the notified request pair.

  For example, after the notification unit notifies the terminal device X and the terminal device Y of a response specifying the opponent, the request transmitted by the terminal device X and the terminal device Y is stored in the history storage unit.

  When the selected request pair is included in the pair stored in the history storage unit and the pair is stored in the history storage unit, the predetermined rematch prohibition period has not yet elapsed. Redo the selection.

  For example, when the selection unit selects a request for finding an opponent of the character A operated by the terminal device X and a request for finding an opponent of the character B operated by the terminal device Y, the character A of the terminal device X is selected. And the set of the character B of the terminal device Y is stored in the history storage unit, and if the predetermined rematch prohibition time (for example, 2 hours) has not elapsed since the set was stored in the history storage unit, the selection is discarded. The selection unit selects two requests again from the plurality of requests stored in the request storage unit.

  According to the present invention, it is possible to prevent specific characters from frequently fighting in a short period of time, so that a player having two terminal devices battles the specific characters many times, It is possible to prevent an act of deliberately defeating and illegally raising the ranking of the other character.

  Further, the selection unit can wait for selection until the number of requests stored in the request storage unit exceeds a predetermined number.

  For example, if the predetermined number is 5, when only requests transmitted by the terminal device X and the terminal device Y are stored in the request storage unit, the selection unit does not select two requests from the request storage unit, and requests Wait until six or more requests are stored in the storage unit, and after six or more requests are stored, a selection is made.

  According to the present invention, even if a player having two terminal devices transmits a request from the two terminal devices, the request is not selected by the selection unit unless another request is received. Thus, it is possible to prevent specific characters from fighting frequently.

  The request storage unit stores the request in association with the time when the request is received, and the selection unit stores the request stored in the request storage unit from the time when the request is received to the present. Any two requests can be selected from requests whose elapsed time exceeds a predetermined waiting time.

  For example, if the time when the request from the terminal device X is received is 17:00, the request storage unit stores the request from the terminal device X and the received time (17:00) in association with each other. If the predetermined waiting time is 3 minutes, the selection unit transmits the terminal device X until a predetermined waiting time elapses (after 17:03) after the request from the terminal device X is received. A request to be paired with the request is not selected, and after a predetermined waiting time has elapsed, similarly to the request from the terminal device X, the request is selected from other requests after the predetermined waiting time has elapsed since the request was accepted.

  According to the present invention, it is possible to always wait until a pair of requests is selected after the introduction device receives the request. Thereby, even if a player transmits a request from two terminal devices at the same time, the player waits to receive a request from another terminal device, and the probability that specific characters are frequently selected is reduced. be able to.

  Further, the predetermined waiting time is determined according to the number of requests stored in the request storage unit at the time when the request is accepted.

  For example, it is assumed that the predetermined waiting time is set shorter as the number of requests stored in the request storage unit increases. That is, when five requests are stored in the request storage unit when a request from the terminal device X is accepted, the predetermined waiting time is set to 30 seconds, and the request transmitted by the terminal device X is not matched. The request to be selected is selected after 30 seconds. When two requests are stored in the request storage unit, the predetermined waiting time is set to 3 minutes, and a request that is paired with the request transmitted by the terminal device X is selected after 3 minutes.

  According to the present invention, when a large number of requests are stored in the request storage unit, the probability that specific characters will be selected again becomes low, so it is not necessary to wait for a long time until a request pair is selected. On the contrary, when only a small number of requests are stored in the request storage unit, by setting a long standby time, it is possible to sufficiently ensure the time for receiving requests from other terminal devices, The probability of selecting specific characters again can be reduced.

  In addition, the introduction device further includes a rank storage unit that stores changes in the respective ranks of the characters, and the selection unit refers to the rank storage unit so that the rank of the character related to one request increases and the other request If the order of the character related to is lowered, the selection can be redone.

  For example, the rank storage unit stores the current rank and the past rank of each character. Of the two requests selected by the selection unit, the current rank of the character related to one request is higher than the previous rank, and the current rank of the character related to the other request is If it is lower than the ranking, the selection unit redoes the selection. When the current ranks of the characters are both rising or both falling, the selection unit does not redo the selection.

  According to the present invention, an up-graded character and a down-graded character are not selected as opponents, so that one character intentionally continues to win and the other character continues to lose. By doing so, it is possible to prevent an illegal act of raising the rank of a specific character.

  In addition, the result of the battle between the character according to one request and the character according to the other request is determined by the difference between the points acquired by the two, and the introducing device responds to the character according to one request and the other request. A result storage unit for storing the result of the battle with the character is further provided, and the predetermined rematch prohibition period is determined according to the difference in the points of the battle result for each requested pair.

  For example, the character A according to one selected request and the character B according to the other request have battled in the past, and the greater the difference between the acquired points of the character A and the character B at that time, Lengthen.

  According to the present invention, it is possible to prevent characters with large differences in performance from being frequently selected as opponents, and thereby, a character that has won a great deal by cheating and a character that has been intentionally lost Can reduce the probability that will be selected again as an opponent.

  An introduction method according to a second aspect of the present invention is an introduction method executed by an introduction device including a reception unit, a request storage unit, a selection unit, a notification unit, an erasure unit, and a history storage unit. The receiving process, the request storing process, the selecting process, the notifying process, the erasing process, and the history storing process are configured as follows.

  In the accepting step, the accepting unit accepts a request for designating a character that is operated by the player in the terminal device and is seeking an opponent from each of the plurality of terminal devices.

  In the request storage step, the request storage unit stores the received request.

  In the selection step, the selection unit selects any two as a pair from the requests stored in the request storage unit.

  In the notification step, the notification unit notifies the terminal device related to one request out of the selected request pair to the response specifying the character related to the other request as the opponent, and the terminal device related to the other request In addition, a response specifying the character related to one of the requests as the opponent is notified.

  In the erasure process, when the erasure unit is notified, each of the selected request pairs is erased from the request storage unit.

  In the history storage step, the history storage unit stores the history of the notified request pair.

  In the selection step, the selection unit includes the selected request pair included in the pair stored in the history storage unit, and the predetermined rematch prohibition period has not yet elapsed since the pair is stored in the history storage unit. If not, redo the selection.

  A program according to another aspect of the present invention is configured to cause a computer to function as the introduction device and to cause the computer to execute the introduction method.

  The program of the present invention can be recorded on a computer-readable information storage medium such as a compact disk, flexible disk, hard disk, magneto-optical disk, digital video disk, magnetic tape, and semiconductor memory.

  The above program can be distributed and sold via a computer communication network independently of the computer on which the program is executed. The information recording medium can be distributed and sold independently of the computer.

  According to the present invention, it is possible to provide an introduction device, an introduction method, and a program that are suitable for preventing illegal acts caused by frequent battles between specific characters in a communication battle game.

It is a schematic diagram which shows the general | schematic structure of the typical information processing apparatus with which the introduction apparatus which concerns on embodiment of this invention is implement | achieved. It is a figure for demonstrating the relationship between an introduction apparatus and a terminal device. It is explanatory drawing which shows the function structure of the terminal device which concerns on embodiment. It is explanatory drawing which shows the function structure of the introduction apparatus which concerns on 1st Embodiment. It is a figure for demonstrating the request | requirement memory | storage table (before response notification) which concerns on 1st Embodiment. It is a figure for demonstrating the request | requirement memory | storage table (after response notification) which concerns on 1st Embodiment. It is a figure for demonstrating the log | history storage table (before response notification) which concerns on 1st Embodiment. It is a figure for demonstrating the log | history storage table (after notification of a response) which concerns on 1st Embodiment. It is a flowchart for demonstrating the process which each part of the introduction apparatus which concerns on 1st Embodiment performs. It is a flowchart for demonstrating the process which each part of the introduction apparatus which concerns on 2nd Embodiment performs. It is a figure for demonstrating the request | requirement memory | storage table (before response notification) which concerns on 3rd Embodiment. It is a figure which shows the relationship between the number of requests | requirements, and waiting time. It is a flowchart for demonstrating the process which each part of the introduction apparatus which concerns on 3rd Embodiment performs. It is explanatory drawing which shows the function structure of the introduction apparatus which concerns on 4th Embodiment. It is a figure for demonstrating an order | rank storage table. It is a flowchart for demonstrating the process which each part of the introduction apparatus which concerns on 4th Embodiment performs. It is a figure which shows the relationship between an order | rank and log | history preservation | save time. It is explanatory drawing which shows the function structure of the introduction apparatus which concerns on 5th Embodiment. It is a figure for demonstrating a result storage table. It is a figure for demonstrating the relationship between a point difference and a rematch prohibition period. It is a flowchart for demonstrating the process which each part of the introduction apparatus which concerns on 5th Embodiment performs.

The communication battle game introduction device receives a request for specifying a character to be an opponent from a plurality of terminal devices that play the battle game, and transmits a response for specifying the character to the terminal device. The terminal device that has received the response communicates directly with the terminal device on which the designated character is operated to play a battle game.
Characters include
(A) a character assigned to one player in a competitive fighting game;
(B) a team assigned to one player in a soccer game or a baseball game;
(C) A car or robot assigned to one player in a car racing game or a game of operating a robot;
Etc. shall be included.

  The introduction device of the present invention prevents fraudulent acts caused by frequent battles between specific characters by the following method when specifying an opponent. Introducing apparatuses employing different methods will be described as Embodiments 1 to 5.

The introduction device according to the first embodiment employs a technique in which a rematch prohibition period is provided and selection is repeated if the selected characters have not passed the rematch prohibition period.
The introduction device of the second embodiment employs the method of the first embodiment and the method of selecting a character when the number of requests for opponents exceeds a predetermined number.
The introduction device of the third embodiment employs the method of the first embodiment and the method of selecting a character related to a request that exceeds a predetermined waiting time after the request is received.
The introduction device of the fourth embodiment employs the method of the first embodiment and the method of selecting a character to fight against in consideration of the tendency of the character rank variation.
The introduction device of the fifth embodiment employs a method of setting the rematch prohibition period provided by the introduction device of the first embodiment based on the past battle results (point difference) between the selected characters.

  As illustrated in FIG. 2, the introduction device 200 according to the first to fifth embodiments includes n terminal devices 301, 302, 303, 304 to 30 n (terminal devices 1, 2, 3, 4 to 4) via the Internet 500. n) receives a request for requesting the opponent (requests 411, 412, 413, 414 to 41n) and transmits a response (response 421, 422) specifying the opponent to the terminal devices 301 to 30n. . Further, it is assumed that the terminal devices 301 to 30n can communicate peer-to-peer via the Internet 500, respectively.

  Hereinafter, an information processing apparatus in which the introduction device 200 and the terminal devices 301 to 30n according to the first to fifth embodiments are implemented will be described. In the following, for ease of understanding, an embodiment will be described using an information processing device for games. However, the following embodiment is for description and does not limit the scope of the present invention. . Accordingly, those skilled in the art can adopt embodiments in which each of these elements or all of the elements are replaced with equivalent ones, and these embodiments are also included in the scope of the present invention.

  Here, although the introduction device 200 and the terminal devices 301 to 30n are different in processing capability, the fundamental operation principle and configuration are common. Therefore, in the following, the outline of the information processing apparatus will be described, and differences between the introduction apparatus 200 and the terminal apparatuses 301 to 30n will be described as appropriate accordingly.

  FIG. 1 is a schematic diagram illustrating a schematic configuration of a typical information processing apparatus 100 that performs functions of the introduction device 200 and the terminal devices 301 to 30n according to the embodiment of the present invention by executing a program. Hereinafter, a description will be given with reference to FIG.

  The information processing apparatus 100 includes a CPU (Central Processing Unit) 101, a ROM 102, a RAM (Random Access Memory) 103, an interface 104, a controller 105, an external memory 106, an image processing unit 107, and a DVD-ROM. (Digital Versatile Disc ROM) drive 108, NIC (Network Interface Card) 109, and audio processing unit 110.

  The CPU 101 controls the overall operation of the information processing apparatus 100 and is connected to each component to exchange control signals and data. Further, the CPU 101 uses arithmetic operations such as addition / subtraction / multiplication / division, logical sum, logical product, etc. using an ALU (Arithmetic Logic Unit) (not shown) for a storage area called a register (not shown) that can be accessed at high speed. , Logic operations such as logical negation, bit operations such as bit sum, bit product, bit inversion, bit shift, and bit rotation can be performed. In addition, the CPU 101 itself is configured so that saturation operations such as addition / subtraction / multiplication / division for multimedia processing, vector operations such as trigonometric functions, etc. can be performed at a high speed, and those provided with a coprocessor. There is.

  The ROM 102 records an IPL (Initial Program Loader) that is executed immediately after the power is turned on, and when this is executed, the program recorded on the DVD-ROM is read out to the RAM 103 and execution by the CPU 101 is started. The The ROM 102 stores an operating system program and various data necessary for operation control of the entire information processing apparatus 100.

  The RAM 103 is for temporarily storing data and programs, and holds programs and data read from the DVD-ROM and other data necessary for game progress and chat communication. Further, the CPU 101 provides a variable area in the RAM 103 and performs an operation by directly operating the ALU on the value stored in the variable, or temporarily stores the value stored in the RAM 103 in the register. Processing is performed on the register, and the result of the operation is written back to the memory.

  The controller 105 connected via the interface 104 receives an operation input performed when the player executes the game.

  The external memory 106 detachably connected via the interface 104 stores data indicating game play status (past results, etc.), data indicating the progress of the game, and log of chat communication in a network battle ( Data) is stored in a rewritable manner. The player can record these data in the external memory 106 as appropriate by inputting an instruction via the controller 105.

  The image processing unit 107 processes the data read from the DVD-ROM by an image arithmetic processor (not shown) included in the CPU 101 or the image processing unit 107, and then processes the processed data on a frame memory ( (Not shown). The image information recorded in the frame memory is converted into a video signal at a predetermined synchronization timing and output to a monitor connected to the image processing unit 107. Thereby, various image displays are possible.

  A DVD-ROM mounted on the DVD-ROM drive 108 stores a program for realizing the game and image data and audio data associated with the game. Under the control of the CPU 101, the DVD-ROM drive 108 performs a reading process on the DVD-ROM loaded therein, reads out necessary programs and data, and these are temporarily stored in the RAM 103 or the like.

  Further, the image calculation processor can execute a two-dimensional image overlay calculation, a transmission calculation such as α blending, and various saturation calculations at high speed.

  In addition, when the virtual space is configured in three dimensions, polygon information that is arranged in the three-dimensional space and to which various texture information is added is rendered by the Z buffer method, and a predetermined viewpoint position is used. It is also possible to perform a high-speed execution of a calculation that obtains a rendering image obtained by looking down at a polygon arranged in the virtual space in the direction of a predetermined line of sight.

  Further, the CPU 101 and the image arithmetic processor cooperate to draw a character string as a two-dimensional image in the frame memory or draw it on the surface of each polygon according to the font information that defines the character shape. It is.

  The NIC 109 is used to connect the information processing apparatus 100 to a computer communication network (not shown) such as the Internet 500, and is used in configuring a LAN (Local Area Network). 10BASE-T / 100BASE-T Connect to the Internet 500 using an analog modem, ISDN (Integrated Services Digital Network) modem, ADSL (Asymmetric Digital Subscriber Line) modem, or cable television line to comply with the standard, or to connect to the Internet 500 using a telephone line For example, and an interface (not shown) that mediates between them and the CPU 101.

  The audio processing unit 110 converts audio data read from the DVD-ROM into an analog audio signal and outputs the analog audio signal from a speaker (not shown) connected thereto. Further, under the control of the CPU 101, sound effects and music data to be generated during the progress of the game are generated, and sound corresponding to this is output from the speaker.

  When the audio data recorded on the DVD-ROM is MIDI data, the audio processing unit 110 converts the MIDI data into PCM data with reference to the sound source data included in the audio data. If the compressed audio data is in ADPCM format or Ogg Vorbis format, it is expanded and converted to PCM data. The PCM data can be output by performing D / A (Digital / Analog) conversion at a timing corresponding to the sampling frequency and outputting it to a speaker.

  In addition, the information processing apparatus 100 uses a large-capacity external storage device such as a hard disk so as to perform the same function as the ROM 102, the RAM 103, the external memory 106, the DVD-ROM mounted on the DVD-ROM drive 108, and the like. You may comprise.

  The information processing apparatus 100 described above corresponds to a so-called “consumer video game apparatus”, but the present invention can be realized as long as it performs image processing to display a virtual space. Therefore, the present invention can be realized on various computers such as a mobile phone, a portable game device, a karaoke device, and a general business computer.

  For example, a general computer includes an CPU, a RAM, a ROM, a DVD-ROM drive, and an NIC as in the information processing apparatus 100, and an image processing unit having a simpler function than the information processing apparatus 100. In addition to having a hard disk as an external storage device, a flexible disk, a magneto-optical disk, a magnetic tape, and the like can be used. Further, not the controller 105 but a keyboard or a mouse is used as an input device.

  Hereinafter, functional configurations of the terminal devices 301 to 30n according to the respective embodiments realized in the information processing apparatus 100 will be described with reference to FIG. Note that the functional configuration of the terminal device of the present invention is the same in each embodiment.

The terminal devices 301 to 30n of each embodiment are game devices operated by each player, for example.
As illustrated in FIG. 3, the terminal devices 301 to 30 n include an input reception unit 31, a control unit 32, a presentation control unit 33, and a communication unit 34, and are configured as follows.

The input receiving unit 31 receives an operation from the player. For example, an operation for instructing the start of a battle game or an operation for requesting to specify a character to be battled is received from the player.
Accordingly, the CPU 101 and the controller 105 cooperate to function as the input receiving unit 31.

The control unit 32 controls the entire terminal devices 301 to 30n. For example, if the input reception unit 31 receives an operation requesting to specify a character to fight against, the control unit 32 causes the communication unit 34 to transmit requests 411 to 41n based on the operation.
Therefore, the CPU 101 functions as the control unit 32.

The presentation control unit 33 displays a game image or the like on a monitor, or outputs music or the like used for the game to a speaker. For example, if a response specifying a battle character is received from the introduction device 200, the battle character is displayed on the monitor. Also, sound effects and music data to be generated during the progress of the game are output from the speaker.
Therefore, the CPU 101 and the image processing unit 107 cooperate to function as the presentation control unit 33.

The communication unit 34 transmits requests 411 to 41n based on an operation from the player, and receives responses from the introduction device 200 and other terminal devices. For example, when the introduction device 200 transmits responses 421 and 422 specifying the battle character to the terminal device 301, the communication unit 34 receives the responses 421 and 422.
Therefore, the CPU 101 and the NIC 109 cooperate to function as the communication unit 34.

  Next, a functional configuration of the introduction device 200 according to each embodiment realized in the information processing apparatus 100 will be described with reference to FIGS. 4 to 21.

(Embodiment 1)
The introduction device 200 according to the present embodiment employs a technique in which a rematch prohibition period is provided and selection is repeated if the selected characters have not passed the rematch prohibition period.
As shown in FIG. 4, the introduction device 200 includes a reception unit 201, a request storage unit 202, a selection unit 203, a notification unit 204, a deletion unit 205, and a history storage unit 206, as follows. Configure.

The accepting unit 201 accepts requests 411 to 41n for designating a character that is operated by the player in each of the terminal devices 301 to 30n and is seeking an opponent from each of the plurality of terminal devices 301 to 30n. The requests 411 to 41n include information such as the identifier of the terminal device that transmitted the request and the type of character operated on the terminal device.
Therefore, the CPU 101 and the NIC 109 cooperate to function as the reception unit 201.

The request storage unit 202 stores the request received by the reception unit 201 in a table (hereinafter referred to as “request storage table 202a”) as illustrated in FIG. The request (request 202a1) received by the receiving unit 201 is stored in association with the terminal device (terminal device 202a2) that transmitted the request and the character (character 202a3) operated on the terminal device. The terminal device and the character are obtained from the request received by the receiving unit 201. For example, if the accepting unit 201 accepts a “request 411” for specifying an opponent from “terminal device 1 (terminal device 301)” that operates “character A”, the request storage unit 202 displays “request 411”. ”,“ Terminal device 1 ”, and“ character A ”are registered in the request storage table 202a in association with each other.
Therefore, the CPU 101 and the RAM 103 cooperate to function as the request storage unit 202.

The selection unit 203 selects any two of the requests stored in the request storage unit 202 as a pair. That is, the selection unit 203 refers to the request storage table 202a stored in the request storage unit 202, and selects any two requests from the terminal devices registered in the request storage table 202a. At this time, the selection method can be set as appropriate, such as selecting at random or selecting from the first request registered in the request storage table 202a. Then, the selection unit 203 refers to the history storage unit 206 to be described later, determines whether the selected request pair is an appropriate request pair, and determines that the selected request pair is not an appropriate request pair. 203 redoes the selection. If it is determined that the request pair is appropriate, the notification unit 204 is notified of the request pair.
Therefore, the CPU 101 functions as the selection unit 203.

When the notification unit 204 receives a request pair from the selection unit 203, the notification unit 204 designates the character operated by the terminal device related to the other request as the opponent for the terminal device related to the one request among the received request pairs. A response is notified, and a response specifying the character operated by the terminal device according to the one request is notified to the terminal device according to the other request. For example, when the selection unit 203 selects the request 411 and the request 412, the character B operated by the terminal device 2 (terminal device 302) that transmitted the request 412 is transmitted to the terminal device 1 (terminal device 301) that transmitted the request 411. A response 421 designated as the opponent is notified. In addition, the selection unit 203 transmits a response 422 specifying the character A operated by the terminal device 1 that has transmitted the request 411 as the opponent to the terminal device 2 that has transmitted the request 412.
Therefore, the CPU 101 and the NIC 109 cooperate to function as the notification unit 204.

When the notification unit 204 notifies the terminal device related to the request selected by the selection unit 203, the deletion unit 205 deletes the request from the request storage table 202a of the request storage unit 202. For example, if the selection unit 203 selects the request 411 and the request 412, and the notification unit 204 notifies the terminal device 1 and the terminal device 2 with the response 421 and the response 422, respectively, as illustrated in FIG. “Request 411”, “request 412” and information related to them (“terminal device 1”, “character A”, “terminal device 2”, “character B”) are deleted.
Therefore, the CPU 101 functions as the erasing unit 205.

The history storage unit 206 stores the request pair notified by the notification unit 204 as a notification history in a table (hereinafter referred to as a “history storage table”) illustrated in FIG. 7 stored in the history storage unit 206. The request pair notified by the notification unit 204 (request 206a1 and request 206a4) is a terminal device (terminal device 206a2) related to one request, a character (character 206a3) operated by the terminal device, and a terminal related to the other request. Device (partner terminal device 206a5), character operated by the terminal device (partner character 206a6), time stored in history storage unit 206 (storage time 206a7), and elapsed time since stored in history storage unit 206 (Hereinafter referred to as “history elapsed time”. History elapsed time 206a8) and stored. The storage time 206a7 and the history elapsed time 206a8 are obtained by the history storage unit 206 when registered in the history storage table 206a.
Accordingly, the CPU 101 and the RAM 103 cooperate to function as the history storage unit 206.

  For example, the introduction device 200 receives the request 411 and the request 412, and the notification unit 204 specifies a response 421 that specifies the character B as an opponent in the terminal device 1 and a response 422 that specifies the character A as an opponent in the terminal device 2. 7, the history storage unit 206 stores “request 411”, “terminal device 1” and “character A” related to the request 411, “request 412”, and a request in the history storage table 206a of FIG. “Terminal 2” and “Character B” 412 and the storage time “18:05:00” stored in the history storage unit 206 as a pair of the request 411 and the request 412 are stored in the history storage unit 206. Then, the elapsed time “00:00:00” from the current time to the current time is registered in association with each other (history storage table 206a in FIG. 8). In the history storage table 206a of FIG. 8, the history of the same terminal device and character combination (“terminal device 1”, “character A”, “terminal device 2”, “character B”) remains. Only the latest history (information related to “request 411” and “request 412”) may be left, and the old history (information related to “request XXX” and “request YYY”) may be deleted.

  As described above, the selection unit 203 refers to the information stored in the history storage unit 206 when selecting any two requests as a pair from the request storage table 202a in FIG. Is determined to be appropriate. The history storage unit 206 stores a pair of requests that the notification unit 204 has notified of in the past as a history (history storage table 206a in FIG. 7). The selection unit 203 determines whether the character set related to the selected request is registered in the history storage table 206a of FIG. 7 and the elapsed time since the request pair is registered in the history storage table 206a (history elapsed time). ) Is over the re-ban prohibition period. Here, the rematch prohibition period refers to a period during which the characters associated with the selected pair of requests cannot play again after they have played. The selection unit 203 stores the terminal device and the character set related to the selected request in the history storage table 206a. If the history elapsed time of the character set does not exceed the rematch prohibition period, the selection unit 203 selects the request. Try again. On the other hand, when the terminal device and character pair are not registered in the history storage table 206a, or the terminal device and character pair are registered, but the history elapsed time of the pair exceeds the rematch prohibition period The selection unit 203 sends the selection result to the notification unit 204.

  Hereinafter, operations performed by each unit of the introduction device 200 according to the present embodiment will be described. When the introduction apparatus 200 is powered on, the CPU 101 starts processing shown in the flowchart of FIG.

  The receiving unit 201 determines whether or not a request for specifying the opponent of the character operated on the terminal device has been received from the terminal device (step S101). For example, as illustrated in FIG. 2, when a request 411 for an opponent is transmitted from the terminal device 1 and the request 411 reaches the introduction device 200, the reception unit 201 determines that the request 411 has been received (step S <b> 101; Yes). . On the other hand, if the request for the opponent is not accepted (step S101; No), the process waits until the request is accepted.

  When the reception unit 201 receives a request for an opponent (step S101; Yes), the request storage unit 202 stores the request (step S102). Specifically, the request storage unit 202 registers the request received by the reception unit 201 in the request storage table 202 a stored in the request storage unit 202. For example, when the request 411 is received from the terminal device 1, the request storage unit 202 is operated by the terminal device 1 as “request 411”, “terminal device 1” that transmitted the request 411, as shown in FIG. 5. "Character A" is registered in the request storage table 202a in association with each other.

  Next, the selection unit 203 selects any two requests from the requests registered in the request storage table 202a (step S103). For example, “request 411” and “request 412” are selected from the requests registered in the request storage table 202a of FIG.

  The selection unit 203 determines whether or not the combination of the terminal device and the character related to the selected request is stored in the history storage table 206a stored in the history storage unit 206 (step S104). For example, a combination of a character A operated by the terminal device 1 and a character B operated by the terminal device 2 is selected by the selection unit 203 in the past, and the notification unit 204 notifies the terminal device 1 and the terminal device 2 of a response. As shown in FIG. 7, in the history storage table 206a, “request XXX” transmitted from the terminal device 1, “terminal device 1”, “character A” operated by the terminal device 1, and terminal device “Request YYY” transmitted from 2, “Terminal device 2”, “Character B” operated by the terminal device 2, and storage time “13” when these pieces of information are registered (stored) in the history storage table 206 a. It is assumed that “00 hour 00 second” and the history elapsed time “05:01:00” from registration to the present (current time: 18:01:00) are stored in association with each other. In this case, the selection unit 203 determines that the pair of the terminal device 1 and the character A related to the currently selected request 411 and the terminal device 2 and the character B related to the request 412 is stored in the history storage table 206a of FIG. (Step S104; Yes), the process proceeds to Step S105.

When the combination of the terminal device and the character related to the selected request is registered in the history storage table 206a (step S104; Yes), the selection unit 203 then records the combination history registered in the history storage table 206a. It is determined whether or not the elapsed time has passed a predetermined rematch prohibition period (step S105). For example, when the rematch prohibition period is “02:00:00” and the set of the terminal device and the character related to the selected request is a set of the terminal device 1 and the character A, the terminal device 2 and the character B, The selection unit 203 obtains the history elapsed time “05:01:00” with reference to the history storage table 206a of FIG. 7, and determines that the history elapsed time has passed the re-war prohibition period (step S105; Yes).
Further, for example, when the set of the terminal device and the character related to the selected request is a set of the terminal device 1 and the character A and the terminal device 3 and the character C, the selection unit 203 stores the history storage table 206a in FIG. With reference to the history elapsed time “01:01:00”, it is determined that the history elapsed time has not passed the rematch prohibition period (step S105; No). When it is determined that the history elapsed time has not passed the rematch prohibition period (step S105; No), the process returns to step S103, and the selection unit 203 again selects any two of the requests registered in the request storage table 202a. Select a request.

  On the other hand, when the set of the terminal device and the character related to the selected request is not stored in the history storage unit 206 (Step S104; No), or the history elapsed time of the set of the terminal device and the character related to the selected request When the predetermined rematch prohibition period has elapsed (step S105; Yes), the notification unit 204 notifies the response to each of the terminal devices related to the request selected by the selection unit 203 (step S106). For example, when the selection unit 203 selects the request 411 and the request 412, the character B operated by the terminal device 2 is designated as the opponent for the request 411 for determining the opponent of the character A operated by the terminal device 1. Response 421 to be notified to the terminal device 1, while in response to the request 412 for determining the opponent of the character B operated on the terminal device 2, the response 422 specifying the character A operated on the terminal device 1 as the opponent To the terminal device 2.

  After the notification unit 204 notifies each terminal device related to the request selected by the selection unit 203 (step S106), the deletion unit 205 selects the selection unit 203 from the request storage table 202a of the request storage unit 202. The request is deleted (step S107). For example, after the request unit 411 and the request 412 are selected by the selection unit 203 and the notification unit 204 notifies the response 421 and the response 422 to the terminal device related to the request, the erasure unit 205 reads the request storage table 202a in FIG. The “request 411” and “request 412” and the terminal device and character information related to those requests are deleted (FIG. 6).

In addition, after the notification unit 204 notifies each terminal device related to the request selected by the selection unit 203 (step S106), the history storage unit 206 transmits the request selected by the selection unit 203 to the history storage table 206a and the request. Information related to the request is registered (step S108). For example, the “request 411” and “request 412” notified to the history storage table 206a (FIG. 7) before the response notification and information (terminal device, character, storage time, history elapsed time) related to those requests are sent. Registration is performed (history storage table 206a in FIG. 8). Then, the process returns to step S101 and waits until a new request is accepted.
Note that the order of the processes in step S107 and step S108 is not limited to this, and the order of the processes in step S107 and step S108 may be switched or may be performed simultaneously.

  According to this embodiment, it is possible to prevent specific characters from frequently fighting in a short time.

(Embodiment 2)
The introduction device 200 of the present embodiment employs the method of the first embodiment and the method of not selecting an opponent until a predetermined number of requests are received.
The introduction device 200 of this embodiment includes a reception unit 201, a request storage unit 202, a selection unit 203, a notification unit 204, an erasure unit 205, and a history storage unit 206. The reception unit 201, request storage unit 202, notification unit 204, deletion unit 205, and history storage unit 206 of this embodiment have the same functions as those of the first embodiment. Hereinafter, the selection unit 203 having a function different from that of the first embodiment will be described.

When the number of requests registered in the request storage table 202a of the request storage unit 202 exceeds a predetermined number, the selection unit 203 selects any two requests from the request storage table 202a as a pair. For example, the predetermined number is set to (n-1), and the reception unit 201 receives a request for an opponent from the terminal devices 301 to 30n (terminal devices 1 to n), and stores the request as illustrated in FIG. It is assumed that n requests are registered in the table 202a. In this case, the selection unit 203 selects two requests from the request storage table 202a. The predetermined number can be set as appropriate by the administrator of the introduction device 200. On the other hand, when the number of requests registered in the request storage table 202a is less than n, the selection unit 203 does not select a request and waits until n or more requests are registered. In addition, the selection unit 203 determines whether or not the selected pair of two requests is stored in the history storage unit 206, and whether or not the character pair related to the two request pairs has passed the rematch prohibition period. Judging.
Therefore, the CPU 101 functions as the selection unit 203.

  Hereinafter, operations performed by each unit of the introduction device 200 according to the present embodiment will be described. When the introduction device 200 is powered on, the CPU 101 starts the process shown in the flowchart of FIG. In the flowchart of FIG. 10, steps having the same step numbers as in FIG. 9 perform the same processing as the processing in the flowchart of FIG.

  After the processing of step S101 and step S102 is performed, the selection unit 203 refers to the request storage table 202a and determines whether or not the number of registered requests is equal to or greater than a predetermined number (step S201). For example, assuming that the predetermined number is 3, and the current request storage table 202a is FIG. 5, since n requests are registered in the request storage table 202a, the selection unit 203 counts the number of registered requests. Is greater than or equal to a predetermined number (step S201; Yes), the process proceeds to step S103. On the other hand, when the predetermined number is set to n + 1, the selection unit 203 determines that the number of registered requests does not exceed the predetermined number (step S201; No), and returns to step S101.

  When the number of requests registered in the request storage table 202a is equal to or greater than a predetermined number (step S201; Yes), the selection unit 203 selects two arbitrary requests from the n requests. The selection method can be set as appropriate, for example, by selecting from the top of the request storage table 202a or by selecting at random.

  Thereafter, the processing after step S104 is performed for the two requests selected in step S103.

  According to the present embodiment, the opponent is not designated until a predetermined number of requests are received, so that the opponent is selected from a few character candidates, thereby preventing the same opponent from being frequently selected. be able to.

(Embodiment 3)
The introduction device 200 of the present embodiment employs the method of the first embodiment and the method of selecting a character related to a request that exceeds a predetermined waiting time after the request is received.
The introduction device 200 of this embodiment includes a reception unit 201, a request storage unit 202, a selection unit 203, a notification unit 204, an erasure unit 205, and a history storage unit 206. The receiving unit 201, the notification unit 204, the erasing unit 205, and the history storage unit 206 of this embodiment have the same functions as those of the first embodiment. The request storage unit 202 and the selection unit 203 having functions different from those in the first embodiment will be described below.

The request storage unit 202 stores the request received by the reception unit 201 in a table (request storage table 202a) as illustrated in FIG. The request received by the reception unit 201 (request 202a1) includes the terminal device (terminal device 202a2) that transmitted the request, the character operated by the terminal device (character 202a3), and the time when the reception unit 201 received the request (reception time) 202a4) and the elapsed time from the reception of the request by the reception unit 201 to the present (hereinafter referred to as “request elapsed time”; request elapsed time 202a5). The request storage unit 202 obtains the reception time 202a4 and the request elapsed time 202a5 when registering in the request storage table 202a.
Therefore, the CPU 101 and the RAM 103 cooperate to function as the request storage unit 202.

The selection unit 203 selects any two of the requests registered in the request storage table 202a from requests whose request elapsed time 202a5 exceeds a predetermined standby time. A request that does not exceed the predetermined waiting time is not selected by the selection unit 203 even if it is registered in the request storage table 202a. For example, when the predetermined standby time is set to “00:02:00”, the selection unit 203 refers to the request elapsed time 202a5 in the request storage table 202a and exceeds 00:02:00. Select a request. In the request storage table 202a of FIG. 11, only requests 411 to 413 exceed 00:02:00, so any two are selected from these requests. In addition, the selection unit 203 determines whether or not the selected pair of two requests is stored in the history storage unit 206, and whether or not the character pair related to the two request pairs has passed the rematch prohibition period. Judging.
Therefore, the CPU 101 functions as the selection unit 203.

  Here, the predetermined waiting time is set according to the number of requests 202a1 registered in the request storage table 202a at the time when the receiving unit 201 receives the request. For example, suppose that a predetermined waiting time is determined according to the graph of FIG. 12, and n requests are registered in the request storage table 202a (FIG. 11) at the time when the receiving unit 201 receives the request 411. The standby time is set to “00:02:00”.

  Hereinafter, operations performed by each unit of the introduction device 200 according to the present embodiment will be described. When the introduction device 200 is powered on, the CPU 101 starts the process shown in the flowchart of FIG. In the flowchart of FIG. 13, steps having the same step numbers as in FIG. 9 perform the same processing as the processing in the flowchart of FIG.

  When the reception unit 201 receives a request for an opponent (step S101; Yes), the request storage unit 202 stores the request (step S102). Specifically, the request storage unit 202 registers the request received by the reception unit 201 together with predetermined information in the request storage table 202 a stored in the request storage unit 202. For example, when the request 411 is received from the terminal device 1, the request storage unit 202 receives the “request 411”, “terminal device 1”, “character A” operated by the terminal device 1, and the request 411. The reception time “17:55:00” is registered in the request storage table 202a in association with the elapsed time (request elapsed time) from the reception of the request 411 to the present. The request elapsed time is registered as “00:00:00” when the request is registered, but changes with the passage of time. For example, when the current time is “18:00:00”, the elapsed time of the request 411 is “00:05:00”.

  Next, the selection unit 203 determines whether or not there are two or more requests in the request storage table 202a whose request elapsed time exceeds a predetermined standby time (step S301). When two or more requests exceeding the predetermined waiting time are registered in the request storage table 202a (step S301; Yes), two requests are selected from the exceeding requests (step S302). For example, when the predetermined standby time is “00:02:00” and n requests are registered in the request storage table 202a as shown in FIG. 11, the request exceeding the predetermined standby time is , 411, 412, and 413, the selection unit 203 selects two arbitrary requests from the three requests. The selection method can be set as appropriate, for example, from the longer elapsed time, from the shorter elapsed time, or at random.

  On the other hand, when there are not two or more requests that have passed the waiting time in the request storage table 202a (step S301; No), the process returns to step S101 and waits until a new request is accepted. When a new request is accepted and the request elapsed time of the request exceeds the standby time, the selection unit 203 selects the request again.

  When two requests are selected in step S302, the processes after step S104 are performed for the two selected requests.

  According to the present embodiment, since the selection is made from the requests after the waiting time has elapsed, the opponent can be designated after recruiting enough candidates for the opponent (request for the opponent). Thus, it is possible to prevent specific characters from fighting frequently. In addition, since the waiting time is set according to the number of registered requests, it is possible to prevent unnecessary waiting when the opponent candidates are sufficiently registered.

(Embodiment 4)
As illustrated in FIG. 14, the introduction device 200 according to the present embodiment includes a reception unit 201, a request storage unit 202, a selection unit 203, a notification unit 204, a deletion unit 205, a history storage unit 206, and a rank storage. Unit 207. The reception unit 201, request storage unit 202, notification unit 204, deletion unit 205, and history storage unit 206 of this embodiment have the same functions as those of the first embodiment. Hereinafter, the selection unit 203 and the rank storage unit 207 having functions different from those of the first embodiment will be mainly described.

The rank storage unit 207 stores changes in the rank of characters operated by a plurality of terminal devices. Specifically, the ranking storage unit 207 stores a table as shown in FIG. 15 (hereinafter referred to as “ranking storage table 207a”), and the ranking storage table 207a includes terminal devices that have played a battle game in the past. (Terminal device 207a1), the character operated on the terminal device (character 207a2), the ranking of the character at the current time (current ranking 207a3), the past ranking of the character (past ranking 207a4), and the past ranking The change tendency of the ranking from the current ranking to the current ranking (trend 207a5) is stored in association with each other.
Therefore, the CPU 101 and the RAM 103 work together to function as the order storage unit 207.

The selection unit 203 selects any two of the requests stored in the request storage unit 202 as a pair, whether or not the selected request pair is stored in the history storage unit 206, and whether or not the character related to the request It is determined whether or not the history elapsed time of the pair has passed the rematch prohibition period. Further, the selection unit 203 refers to the rank storage unit 207 to check the tendency of the rank of the character related to the request pair, the rank of the character related to one request increases, and the rank of the character related to the other request If is down, redo the selection.
Therefore, the CPU 101 functions as the selection unit 203.

  Hereinafter, operations performed by each unit of the introduction device 200 according to the present embodiment will be described. When the introduction apparatus 200 is powered on, the CPU 101 starts the process shown in the flowchart of FIG. In the flowchart of FIG. 16, steps having the same step numbers as in FIG. 9 perform the same processing as the processing in the flowchart of FIG.

  From step S101 to step S105, the same processing as in the first embodiment is performed. When the history of the pair of requests selected by the selection unit 203 exceeds the rematch prohibition period (step S105; Yes), the selection unit 203 next relates to one of the two selected requests. It is determined whether or not the current rank of the character has risen compared to the previous rank and the current rank of the other character has fallen compared to the past rank (step S401). When the current rank of one character is rising and the current rank of the other character is falling (step S401; Yes), the process returns to step S103, and the selection unit 203 redoes the selection. If both of the current ranks of the two characters are increasing or both are decreasing (step S401; No), the process proceeds to step S106.

  For example, if the selection unit 203 selects the request 411 and the request 412, the selection unit 203 refers to the rank storage table 207a in FIG. 15 to check the character rank tendency 207a5 related to each request. In this case, the current ranking 207a3 (150th) of the character A is “up” from the previous ranking 207a4 (200th), and the current ranking 207a3 (100th) of the character B is past the ranking 207a4 (90th). ) ”(Step S401; Yes), the selection unit 203 redoes the request selection (step S103).

  According to the present embodiment, since a character whose ranking tends to rise is not selected as an opponent, a character whose ranking tends to decline is intentionally kept winning one character and continuing to lose the other character. Thus, an illegal act of raising the rank of a specific character can be prevented.

  It should be noted that the higher the rank of the character, the longer the time for which the history is stored in the history storage table 206a (hereinafter referred to as “history storage time”). For example, the CPU 101 obtains the rank of the characters registered in the history storage table 206a with reference to the rank storage table 207a, and determines the history storage time based on the higher rank of the character set. Then, the history relating to the request pair is registered in the history storage table 206a until the history storage period elapses, and is deleted from the history storage table 206a after the history storage period elapses.

  For example, it is assumed that the history storage time is obtained according to a graph as shown in FIG. The CPU 101 obtains the rank of “character A” operated by the terminal device 1 related to “request XXX” in FIG. 7 as “150” th with reference to the rank storage table 207a, and the terminal related to “request YYY”. The order of “character B” operated by the device 2 is obtained as “100”. Since the order of “Character B” is higher than that of “Character A”, the history storage period is determined based on the order of “Character B” from the graph of FIG. 17 (history storage time: 7.5 hours). The CPU 101 stores information related to the pair of “request XXX” and “request YYY” for 7.5 hours. By doing so, for example, even when the history has to be erased due to the limitation of the capacity of the history storage unit 206, the history of the higher-order character is stored for a longer time. As a result, regarding the request for the opponent of the higher character, it is highly likely that it is determined whether or not the rematch prohibition period has elapsed, and the higher character is less likely to perform cheating.

  In addition, the waiting time of the third embodiment may be determined according to the rank of the character. For example, the longer the character rank is, the longer the standby time is set. As a result, when specifying a character to fight against a higher-order character, the player waits for a longer time, so that more requests may be stored in the request storage unit 202, and a battle from many candidates will be performed. The opponent character can be selected. As a result, the higher the character, the harder it is to cheat.

(Embodiment 5)
As illustrated in FIG. 18, the introduction device 200 according to the present embodiment includes a reception unit 201, a request storage unit 202, a selection unit 203, a notification unit 204, a deletion unit 205, a history storage unit 206, and a result storage. Unit 208. The reception unit 201, request storage unit 202, selection unit 203, notification unit 204, deletion unit 205, and history storage unit 206 of the present embodiment have the same functions as those of the first embodiment. Hereinafter, the result storage unit 208 having a function different from that of the first embodiment will be mainly described.

The result storage unit 208 stores a battle result between the character according to one request and the character according to the other request. The battle result is determined by the point difference acquired by both characters. The result storage unit 208 stores a table as shown in FIG. 19 (hereinafter, “result storage table 208a”), and the result storage table 208a includes one terminal device (terminal device 208a1) that has played a past battle game. The character (character 208a2) operated on the terminal device, the other terminal device (partner terminal device 208a3) that played against the terminal device, the character (partner character 208a4) operated on the partner terminal device, A point difference (point difference 208a5) acquired in the competitive game is stored in association with each other.
Accordingly, the CPU 101 and the RAM 103 cooperate to function as the result storage unit 208.

  The CPU 101 determines a rematch prohibition period according to the point difference. The selected character A according to one request and the character B according to the other request have played in the past, and as a result of the battle, the greater the difference between the acquired points of the character A and the character B, the longer the rematch prohibition period. However, the smaller the point difference, the shorter the rematch prohibition period. For example, the CPU 101 determines the rematch prohibition period according to the graph shown in FIG. 20 (rematch prohibition period [hour] = point difference [point] / 100), and the selection unit 203 selects the request 411 and the request 412 from the request storage table 202a. Suppose that The selection unit 203 refers to the result storage table 208a of the result storage unit 208, and points between the character A operated by the terminal device 1 according to the request 411 and the character B operated by the terminal device 2 according to the request 412 The difference is obtained, and the rematch prohibition period is obtained as 1 hour from the point difference (100 [point]).

  Hereinafter, operations performed by each unit of the introduction device 200 according to the present embodiment will be described. When the introduction device 200 is powered on, the CPU 101 starts processing shown in the flowchart of FIG. In the flowchart of FIG. 21, steps having the same step numbers as in FIG. 9 perform the same processing as the processing in the flowchart of FIG.

  From step S101 to step S104, the same processing as in the first embodiment is performed. When the request pair selected by the selection unit 203 is stored in the history storage unit 206 (history storage table 206a) (step S104; Yes), the CPU 101 refers to the result storage table 208a and sets the rematch prohibition period. Obtained (step S501). For example, when the selection unit 203 selects the request 411 and the request 412, the point difference (100 [point]) between the character A of the terminal device 1 and the character B of the terminal device 2 according to the request is referred to the result storage table 208a. ) And the rematch prohibition period is determined as 1 hour from the graph of FIG. And the selection part 203 judges whether the log | history elapsed time which concerns on the group of the character A of the said terminal device 1 and the character B of the terminal device 2 has exceeded the rematch prohibition period calculated | required by step S501 ( Step S105). In this case, the history elapsed time of the set of the character A of the terminal device 1 and the character B of the terminal device 2 is “05:01:00” (the current time is “18:01:00”), so step S501 Since the rematch prohibition period 1 hour obtained in step S1 is exceeded, the selection unit 203 determines that the history elapsed time has exceeded the rematch prohibition period (step S105; Yes). On the other hand, when the history elapsed time does not exceed the rematch prohibition period obtained in step S501 (step S105; No), the process returns to step S103 and the selection is performed again.

  According to the present embodiment, it is possible to prevent characters with large differences in performance from being frequently selected as opponents, and thereby, a character that has won a great deal by cheating and a character that has been intentionally lost Can reduce the probability that will be selected again as an opponent.

  According to the present invention, it is possible to provide an introduction device, an introduction method, and a program that are suitable for preventing illegal acts caused by frequent battles between specific characters in a communication battle game.

100 Information processing apparatus
101 CPU
102 ROM
103 RAM
104 interface
105 controller
106 External memory
107 Image processing unit
108 DVD-ROM drive
109 NIC
110 Speech processing unit
200 Introduction device
201 reception unit 202 request storage unit 202a request storage table 202a1 request 202a2 terminal device 202a3 character 202a4 reception time 202a5 request elapsed time 203 selection unit 204 notification unit 205 deletion unit 206 history storage unit 206a history storage table 206a1, 206a4 request 206a2 terminal device 206a3 Character 206a5 Counter terminal device 206a6 Counter character 206a7 Storage time 206a8 History elapsed time 207 Rank storage unit 207a Rank storage table 207a1 Terminal device 207a2 Character 207a3 Current rank 207a4 Past rank 207a5 Trend 208 Result storage unit 208a Result storage table 208a1 Terminal device 208a1 Character 208a3 partner terminal device 208a4 partner character Data 208a5 point difference 301~30n terminal equipment 1~n
31 Input Reception Unit 32 Control Unit 33 Presentation Control Unit 34 Communication Unit 411-41n Request 421, 422 Response 500 Internet

Claims (8)

A receiving unit that receives a request from each of the plurality of terminal devices to specify a character that is operated by the player in the terminal device and is seeking an opponent;
A request storage unit for storing the received request;
A selection unit that selects any two as a pair from the requests stored in the request storage unit;
Of the selected pair of requests, the terminal device related to one request is notified of a response specifying the character related to the other request as an opponent, and the one request is transmitted to the terminal device related to the other request. A notification unit for notifying a response that designates the character according to as an opponent;
When the notification is made, an erasure unit that erases each of the selected request pairs from the request storage unit;
A history storage unit that stores the history of the notified request pair;
With
The selection unit includes a predetermined rematch that cannot be set by the player after the selected request pair is included in the pair stored in the history storage unit and the pair is stored in the history storage unit. An introductory device characterized in that if the prohibited period has not yet passed, the selection is redone. An introduction device according to claim 1,
The selection device waits for the selection until the number of requests stored in the request storage unit exceeds a predetermined number. An introduction device according to claim 1,
The request storage unit stores the request in association with the time when the request is received,
The selection unit selects any two of the requests stored in the request storage unit from requests whose elapsed time from the time when the request is received until the present time exceeds a predetermined waiting time. An introduction device characterized by that. An introduction device according to claim 3,
The predetermined waiting time is determined according to the number of requests stored in the request storage unit at the time when the request is received. An introduction device according to claim 1,
A rank storage unit that stores changes in ranks of the characters;
The selection unit refers to the rank storage unit and redoes the selection when the rank of the character according to the one request is increased and the rank of the character according to the other request is decreased. Introduction device. An introduction device according to claim 1,
The result of the battle between the character according to the one request and the character according to the other request is determined by the difference between the points acquired by both,
A result storage unit that stores a result of a battle between the character according to the one request and the character according to the other request;
The predetermined rematch prohibition period is determined for each pair of requests according to a difference in points of the result of the battle. An introduction method executed by an introduction device having a reception unit, a request storage unit, a selection unit, a notification unit, an erasure unit, and a history storage unit,
A receiving step in which the receiving unit receives a request for designating a character that is operated by a player in the terminal device and is seeking an opponent from each of the plurality of terminal devices;
A request storage step in which the request storage unit stores the received request;
A selection step in which the selection unit selects any two as a pair from the requests stored in the request storage unit;
The notification unit notifies the terminal device related to one request out of the selected request pair to the terminal device related to the other request to the terminal device related to the other request. A notification step of notifying a response designating the character according to the one request as an opponent;
The erasure unit, when the notification is made, an erasure step of erasing each of the selected request pairs from the request storage unit;
A history storage step in which the history storage unit stores a history of the notified request pair;
With
In the selection step, the selection unit, the selected pair of request is contained in the pair to be stored in the history storage unit, from the pairs stored in said history storage unit, set by the player not An introductory method characterized by re-selecting the selection if the possible predetermined re-warning period has not yet passed. Computer
A receiving unit that receives a request from each of the plurality of terminal devices to specify a character that is operated by the player in the terminal device and is seeking an opponent;
A request storage unit for storing the received request;
A selection unit that selects any two as a pair from the requests stored in the request storage unit,
Of the selected pair of requests, the terminal device related to one request is notified of a response specifying the character related to the other request as an opponent, and the one request is transmitted to the terminal device related to the other request. A notification unit for notifying a response designating the character according to as an opponent,
When the notification is made, an erasure unit for erasing each of the selected request pairs from the request storage unit,
A history storage unit for storing a history of the notified request pair;
Function as
The selection unit includes a predetermined rematch that cannot be set by the player after the selected request pair is included in the pair stored in the history storage unit and the pair is stored in the history storage unit. A program that functions to redo the selection if the prohibition period has not yet passed.

Images