KR102528440B1 - Method and device for matching game players using queue - Google Patents

Abstract

The present invention relates to a method and apparatus for matching a player's game opponent using a cue. According to a first aspect of the present invention, in a method of matching a player's game opponent using a queue, a queue is a queue of players who have requested to provide a game to each of at least one group having a predetermined criterion for classifying a plurality of players. Providing a step of arranging each group of players in each provided queue for each group and counting a waiting time from when the player is placed in the queue, arranging the player in the queue after a certain waiting time has elapsed may include closing the queue so that the game is stopped, and matching at least one player placed in the queue according to the order in which the player is placed in the queue.

Description

Method and device for matching player's game opponent using queue {METHOD AND DEVICE FOR MATCHING GAME PLAYERS USING QUEUE}

The present invention relates to a method and apparatus for matching a player's game opponent using a queue, and more particularly, to provide a queue, which is a queue of players who have requested to provide a game, to at least one group in which a plurality of players are classified based on a certain standard. and a method and apparatus for arranging players in a provided queue for a predetermined waiting time and matching the players placed in the queue when the predetermined waiting time elapses.

Recently, games of various genres have been developed and provided to players. In particular, games in which players compete against each other using characters between players in a game space are gaining much popularity.

In particular, a multiplayer online battle arena, in which a large number of players access a game server through a network and play against each other online, is gaining popularity.

In such a game, it is common to match opponent players of a similar level according to each player's level so that the matched players can play the game.

At this time, the player must wait without being provided with the game until an opponent of a level similar to his/her level is matched.

However, if the levels of players to be matched are not similar to each other, the player has to wait for a long time until another player of a similar level connects to the player or another player of a similar level finishes the game.

In relation to this, Korea Patent Publication No. 10-2002-0091528, a prior art document, describes a connection method and system between wireless terminal players based on a player matching method through a psychological test, but the prior art is related to players. It is only possible to enable mutual connection between wireless terminal players according to the information of other players, but it does not suggest a method of reducing waiting time for matching other players similar to the player's game level.

Therefore, a technique for solving the above problems has been required.

On the other hand, the above-mentioned background art is technical information that the inventor possessed for derivation of the present invention or acquired in the process of derivation of the present invention, and cannot necessarily be said to be known art disclosed to the general public prior to filing the present invention. .

An object of an embodiment of the present invention is to provide a method and apparatus for matching a game opponent of a player using a queue.

As a technical means for achieving the above-described technical problem, according to a first aspect of the present invention, in a method of matching a game opponent of a player using a queue, at least one group having a predetermined criterion for classifying a plurality of players For example, providing a queue, which is a queue of players requesting to provide a game, arranging at least one player of the group in a queue provided to the group, and stopping the arrangement of players in the queue after a predetermined waiting time has elapsed. The method may include closing the queue, and matching at least one player disposed in the queue according to an order in which the players are disposed in the queue.

According to a second aspect of the present invention, in an apparatus for matching a player's game opponent using a queue, a player grouping unit classifying a plurality of players according to a predetermined criterion and grouping them into at least one group, and a player requesting to provide a game. A queue providing unit for generating and providing a queue, which is a queue, for each group, a player arranging unit for arranging players classified by each group in a queue provided to each group for a predetermined waiting time, and placing the players in the queue according to whether the waiting time elapses. It may include a queue state conversion unit that switches the state of the queue to a closed state, which is a state in which the arrangement of players is stopped, and a player matching unit that matches at least one player placed in the queue according to the order in which the players are placed in the queue. there is.

According to a third aspect of the present invention, a computer readable recording medium on which a program for performing a game opponent matching method is recorded, wherein the game opponent matching method classifies a plurality of players into at least one group having a predetermined criterion. , Providing a queue, which is a queue of players requesting to provide a game, arranging at least one player of the group in a queue provided to the group; The method may include closing a queue, and matching at least one player disposed in the queue according to an order in which the players are disposed in the queue.

According to a fourth aspect of the present invention, a computer program performed by a game opponent matching device and stored in a recording medium for performing a game opponent matching method, wherein the game opponent matching method has a certain criterion for classifying a plurality of players. A step of providing a queue, which is a queue of players who requested to provide a game, to at least one group, a step of arranging at least one player of the group in the queue provided to the group, and after a predetermined waiting time has elapsed, the player is placed in the queue. The method may include closing the queue so that placement is stopped, and matching at least one player placed in the queue according to the order in which the player is placed in the queue.

According to any one of the above-described problem solving means of the present invention, an embodiment of the present invention may provide a method and apparatus for matching a game opponent of a player using a queue.

In addition, according to any one of the problem solving means of the present invention, by classifying and grouping a plurality of players by at least one group having a certain criterion, players with excessive game skill differences (excessive matching point differences, etc.) are not matched. , It is possible to present a game opponent matching method and device that can increase competition between players by matching players with similar game skills to each other and increase interest in the game.

In addition, according to any one of the problem solving means of the present invention, a player matching method can be implemented simply and efficiently by matching players by sequentially arranging players belonging to each group in a queue, which is a form of a data structure provided for each group. A possible game opponent matching method and device can be presented.

In addition, according to any one of the problem solving means of the present invention, by arranging players in the queue only for a certain waiting time, and matching only the players placed in the queue when the waiting time elapses, the waiting time for matching game opponents becomes long. It is possible to propose a game opponent matching method and device capable of maintaining interest in a game by providing a game quickly with a limit.

In addition, according to any one of the problem solving means of the present invention, game opponent matching that can maintain the balance of the game by matching players with similar levels by arranging players placed in the queue according to a certain criterion and sequentially matching players Methods and devices can be presented.

The effects obtainable in the present invention are not limited to the effects mentioned above, and other effects not mentioned can be clearly understood by those skilled in the art from the description below. will be.

1 is a block diagram showing a game opponent matching device according to an embodiment of the present invention.
2 is a flowchart illustrating a game opponent matching method according to an embodiment of the present invention.
3 and 4 are exemplary diagrams for explaining a game opponent matching method according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail so that those skilled in the art can easily practice the present invention with reference to the accompanying drawings. However, the present invention may be embodied in many different forms and is not limited to the embodiments described herein. And in order to clearly explain the present invention in the drawings, parts irrelevant to the description are omitted, and similar reference numerals are attached to similar parts throughout the specification.

Throughout the specification, when a part is said to be "connected" to another part, this includes not only the case where it is "directly connected" but also the case where it is "electrically connected" with another element interposed therebetween. . In addition, when a certain component is said to "include", this means that it may further include other components without excluding other components unless otherwise stated.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

However, prior to explaining this, the meaning of the terms used below is first defined.

Hereinafter, 'character' indicates graphic objects that are placed in the game space, which is a virtual space where the game is played, and affect the game result. In particular, it includes objects that are selected, moved, or whose state is changed under the player's control, that is, the player's control objects. For example, it may be a character of a roll playing game (RPG). In addition, among the graphic objects placed in the game space and influencing the game result, it includes objects that affect the character controlled by the player, but are not controlled by the player and are automatically moved or whose state is changed by the settings of the game itself. can do. For example, it can be an NPC (Non-Player Character) of an RPG. A character can be visualized as a 2D or 3D graphic image.

And 'character information' is attribute information for each of at least one character controlled by the player, and such character information may include the character's level, experience value, or skill.

The point determined by the result of a match between players in the game by controlling these characters is called a 'match point'.

Further, information about a game account including a player's ranking by match point, character information of a character possessed by the player, and the like is referred to as player information.

On the other hand, hereinafter, 'queue' is a queue of players who will play the game, and one form of data structure can be configured in the form of a queue. Players can be placed or removed from the queue by entering their ID (identification) into the queue.

In addition to the terms defined above, terms that require explanation are separately explained below.

1 is a block diagram showing the configuration of a game opponent matching device 10 according to an embodiment of the present invention.

The game opponent matching device 10 stores various information related to game progress, such as player information, game scenario information, and item information, and detects and records various events occurring in the game to enable time-sequential progress of the game.

The game opponent matching device 10 may be implemented as an electronic terminal on which a game application is installed or may be implemented as a server-client system, and the system may include an electronic terminal on which a client for interaction with a player is installed. .

At this time, the electronic terminal may be implemented as a computer, a portable terminal, a television, a wearable device, or the like that may include an interface capable of interacting with the player. Here, the computer includes, for example, a laptop, desktop, or laptop equipped with a web browser, and the portable terminal is, for example, a wireless communication device that ensures portability and mobility. , PCS(Personal Communication System), PDC(Personal Digital Cellular), PHS(Personal Handyphone System), PDA(Personal Digital Assistant), GSM(Global System for Mobile communications), IMT(International Mobile Telecommunication)-2000, CDMA(Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband Internet), Smart Phone, Mobile WiMAX (Mobile Worldwide Interoperability for Microwave Access), etc. (Handheld)-based wireless communication device may be included. In addition, television may include IPTV (Internet Protocol Television), Internet TV (Internet Television), terrestrial TV, cable TV, and the like. Furthermore, a wearable device is a type of information processing device that can be worn directly on the human body, such as, for example, a watch, glasses, accessories, clothes, shoes, etc. can be connected with

In addition, the server may be implemented as a computer capable of communicating through a network N with an electronic terminal installed with a client for interaction with the game player, and may include a storage device capable of storing data, or a third server (not shown). ) can also store data.

As described above, the game opponent matching device 10 implemented in the form of either an electronic terminal or a server-client system includes a player grouping unit 110, a cue providing unit 120, a player arranging unit 130, and a queue state transition. A unit 140 and a player matching unit 150 may be included.

In addition, the game opponent matching device 10 includes internal components, that is, the player grouping unit 110, the cue providing unit 120, the player arranging unit 130, the cue state switching unit 140, and the player matching unit 150. It may include a communication unit (not shown) enabling communication between the components and also enabling communication with external components.

Meanwhile, the player grouping unit 110 according to a preferred embodiment of the present invention may classify a plurality of players according to a predetermined criterion and group them into at least one group.

According to one embodiment, the player grouping unit 110 may classify at least one connected player according to a predetermined criterion. In addition, a group may be formed by grouping the classified players.

According to another embodiment, the player grouping unit 110 may create at least one group, and give each group a criterion for players who may participate in the corresponding group. Also, the player grouping unit 110 may classify at least one player into each group according to the criterion of each group.

At this time, a certain criterion is a condition for classifying players according to their game skills. Players can be categorized.

Meanwhile, the queue providing unit 120 may generate and provide queues, which are queues of players who have requested game provision, for each group.

According to one embodiment, the queue providing unit 120 may create a fixed size queue including at least one slot in which a player requesting game provision is placed for each group. At this time, the number of slots included in the queue may be determined based on the number of players classified in the group to which the queue is provided.

For example, if there are 23 players belonging to a group that includes only players whose levels are between 1 and 10, the cue providing unit 120 queues all 13 players who have requested game provision among the players belonging to the group. A queue consisting of 14 slots, including an even number of slots, can be created and provided.

According to another embodiment, the cue providing unit 120 provides a slot whenever at least one player among at least one player classified in each group requests to provide a game, and connects the slots provided for each group to form a queue. can do.

For example, if one player requests to provide a game to a group that includes only players whose levels are between 11 and 20, the cue providing unit 120 will provide a slot in which to place the player who requested the game to be provided. can

Thereafter, the queue providing unit 120 may create and provide additional slots whenever at least one player requests to provide a game, and may form a queue by sequentially connecting the slots provided to the group.

Meanwhile, the player arranging unit 130 may place the players classified for each group in a queue provided to each group for a preset waiting time.

For example, the player arranging unit 130 may sequentially place players in slots of the provided queue whenever at least one of the players in each group requests to provide a game.

At this time, the player arranging unit 130 may place the player in the queue only for a preset waiting time, and cannot place the player in the queue when the waiting time elapses.

For example, the player placement unit 130 may place a player in a slot of a queue provided to a group to which a plurality of players belong for a predetermined waiting time of 1 minute, and when the waiting time elapses and the queue is closed, the player's deployment can be aborted.

In addition, the player placement unit 130 may rearrange any one player placed in the queue according to whether the waiting time has elapsed and the placement of the player in the queue is in a closed state.

For example, when the waiting time elapses and the first queue is closed, the player placement unit 130, when the number of players arranged in the first queue is an odd number, assigns any one slot among the players arranged in the first queue to a new one. As a second queue, it is possible to rearrange the players by separating them from the first queue.

Alternatively, for example, the player arranging unit 130 may request a new second cue to be provided to the corresponding group through the cue providing unit 120, and rearrange the player last placed in the provided second cue.

Also, the player placement unit 130 may change the arrangement order by arranging the players in the closed queue according to the embodiment.

For example, the player arranging unit 130 may arrange at least one player disposed in the closed queue based on the match point of the player.

Through this, by sequentially sorting according to the game skills of the players, it is possible to match players having corresponding game skills through the player matching unit 150 later.

Meanwhile, the queue state switching unit 140 may switch the state of the queue to a closed state, which is a state in which the arrangement of players in the queue is stopped depending on whether the waiting time has elapsed.

As an embodiment, when the queue provision unit 120 provides a queue with a fixed slot, the queue status conversion unit 140 converts the status information located in the header of the queue to a closed state or sends meaningless information to an empty slot. You can prevent additional players from being placed by entering

For example, the queue status conversion unit 140 may count whether or not a predetermined waiting time of 1 minute has elapsed since the player is placed in the queue by the player arranging unit 130, and when the waiting time has elapsed, The status information of the queue can be switched to the closed state so that no players are placed in the queue. Alternatively, for example, if there are no empty slots in the provided queue even before the waiting time elapses, the queue state conversion unit 140 may switch the queue to the close state.

As another embodiment, when the queue providing unit 120 provides a flexible queue with extended slots, the queue status switching unit 140 puts the queue in a closed state by not connecting a new slot to a queue whose waiting time has elapsed. can switch

For example, the queue state switching unit 140 may connect and expand slots in which the players of the group are placed in the first queue during the waiting time, and after the waiting time elapses, a new slot is connected to the first queue. You can close it so that it doesn't happen.

Meanwhile, the player matching unit 150 may match at least one player disposed in the queue to the queue.

That is, the player matching unit 150 may match even-numbered players by pairing them sequentially from the first slot of the queue.

At this time, the player matching unit 150 may match players differently based on the match records of the players.

For example, the player matching unit 150, if the number of previously matched first and second players sequentially matched according to the position of the queue exceeds a preset 10 times, in the next order of the second player in the queue A located third player may be matched with the first player.

Here, the number of existing matches may be the number of matches within a limited period or the number of matches within the entire period during which the player played the game.

2 is a flowchart illustrating a game opponent matching method according to an embodiment of the present invention.

The game partner matching method according to the embodiment shown in FIG. 2 includes steps processed time-sequentially in the game partner matching apparatus 10 shown in FIG. 1 . Therefore, even if the contents are omitted below, the contents described above regarding the game opponent matching device 10 shown in FIG. 1 can also be applied to the game opponent matching method according to the embodiment shown in FIG. 2 .

As shown in FIG. 2 , the game opponent matching apparatus 10 may provide a queue, which is a queue of players who have requested to provide a game, to each of at least one group having a predetermined criterion for classifying a plurality of players (S2001).

According to one embodiment, the game opponent matching device 10 may form a group by grouping at least one player connected to play the game according to a predetermined criterion, and a queue for matching players according to the formed group queues can be provided.

For example, the game opponent matching device 10 may form a group by sequentially arranging the connected players from the highest rank to the lowest rank, and dividing the players into a uniform number sequentially.

According to another embodiment, the game opponent matching device 10 may create at least one group in advance, assign a certain condition to each group, and include players in each group according to the condition of each group. .

For example, the game opponent matching device 10 can create a group for each stage by dividing it into 10 stages based on the maximum level of 100 in the game, and if the player's level is 10, it can be included in the 1st stage group, , if the player's level is 95, it can be included in the 10th level group.

In this way, by classifying and grouping a plurality of players by at least one group having a certain standard, it is possible to increase competition between players by matching players with similar game levels to each other without matching players with excessive game level differences, It can increase your interest in the game.

Also, the game opponent matching device 10 may provide a queue for each group, which is a queue for matching players who have requested to provide a game among the players grouped in each group.

At this time, the queue may be composed of at least one slot capable of storing identification information capable of identifying the player.

3 is an exemplary view conceptually illustrating a queue provided by the game opponent matching device 10. Referring to this, the queue 300 can be sequentially connected to slots 301 where IDs, which are player identification information, can be placed. An index 302 for identifying the order of slots may be assigned to each slot 301 .

According to one embodiment, the game opponent matching device 10 may determine the number of slots included in the queue based on the number of players requesting to provide a game among players belonging to each group.

For example, when the number of players requesting provision of a game among the players included in the first stage group is 7, the game partner matching device 10 may provide a queue having 8 slots to the first stage group.

According to another embodiment, the game partner matching device 10 may provide queues in which slots can be extended to each group. That is, the game opponent matching device 10 may generate slots and provide them to each group whenever a player requests to provide a game to each group, and connect the slots provided for each group in the order in which slots are provided to form a queue. can form

For example, when one of the plurality of players classified into the first-level group requests to provide a game, the game partner matching device 10 may provide the first slot to the first-level group. And, when two players in the first-stage group request additional game provision, the game opponent matching device 10 may sequentially provide the second slot and the third slot whenever the player additionally requests game provision, A queue may be formed by sequentially connecting the second slot and the third slot to the first slot.

Thereafter, the game opponent matching device 10 may place players in queues provided for each group and count the waiting time, which is the time for placing the players in the queues (S2002).

According to one embodiment, the game opponent matching device 10 may randomly place players belonging to a group into a queue.

For example, the game opponent matching device 10 may randomly arrange 7 players who requested to provide a game in the first stage group to the slots of the queue in sequence.

According to another embodiment, the game opponent matching device 10 may sequentially place players who have requested to provide a game into a queue according to a predetermined criterion.

For example, the game opponent matching device 10 may sequentially arrange the 7 players belonging to the first stage group into the slots of the queue according to the access time, or may place the player who purchased the matching item first in the slot of the queue first. there is.

At this time, the game opponent matching device 10 may count the waiting time, which is the time to place the player in the queue, from when the player is placed in the queue, and may count the waiting time differently for each group.

In addition, the game opponent matching device 10 may close the queue so that the arrangement of players in the queue is stopped after a predetermined waiting time has elapsed (S2003).

That is, the game opponent matching device 10 may place the player in the queue until the counted waiting time elapses.

For example, when the game partner matching device 10 provides a queue with a fixed number of slots, the game partner matching device 10 may place 7 players in a first stage group provided with 8 slots, and wait. If a player in addition to the first stage group requests game provision before the time elapses by one minute or more, the player requesting game provision may be placed in an empty slot of the queue.

Or, for example, when the game partner matching device 10 provides a queue in which the number of slots is extended, the game partner matching device 10 stops providing games among the players classified in the group until the waiting time elapses for 1 minute or more. Depending on the number of players requesting it, slots can be created and attached to the queue.

Thereafter, when the waiting time elapses for a certain amount of time, the game opponent matching device 10 may close the queue so that the player requesting to provide the game is not placed in the queue.

When the game partner matching device 10 provides a queue with a fixed number of slots, the game partner matching device 10, for example, uses state information included in a header including information about the queue to close the queue. It can be closed by converting to close or entering meaningless information into the empty slot of the queue so that there are no empty slots in the queue.

In contrast, when the game partner matching device 10 provides a queue in which the number of slots is expanded, the game partner matching device 10 may, for example, close the queue by connecting a new slot to the queue so that it does not expand. .

Through this, by stopping the arrangement of players in the queue when the waiting time elapses, it is possible to quickly provide the game by limiting the increase in waiting time for matching game opponents, thereby maintaining interest in the game.

Thereafter, the game opponent matching device 10 may determine whether to rearrange any one of the players arranged in the queue based on the number of players arranged in the closed queue (S2004).

That is, the game opponent matching device 10 may determine whether or not to rearrange the players according to whether the number of players arranged in the closed queue is even.

For example, if the number of players arranged in the closed queue is an even number, the game partner matching device 10 may determine not to rearrange the players, and may not perform rearrangement of players, which is a step S2005 to be described later. .

In contrast, when the number of players arranged in the closed queue is an odd number, the game opponent matching apparatus 10 may determine to rearrange any one of the players arranged in the queue.

And if the rearrangement is determined, the game opponent matching device 10 may rearrange the players (S2005).

For example, if there are 7 players placed in the first queue of the first stage group, the game opponent matching device 10 rearranges any one player placed in the first queue to the second queue newly provided in the first stage group. Thus, the number of players placed in the first queue can be made even.

Alternatively, for example, the game partner matching device 10 may make the first queue an even number by removing any one of the slots of the first queue and providing it as a new second queue of the first stage group.

At this time, the game opponent matching device 10 may select a player to be reassigned according to a predetermined criterion.

For example, the game opponent matching device 10 may first select a player to be reassigned according to whether or not a matching item is purchased or the player's connection time.

Unlike this, the game opponent matching device 10 may randomly select one player or select the player placed last.

4 is an exemplary diagram conceptually illustrating a process in which the game opponent matching device 10 rearranges players arranged in a flexible queue in which slots are expanded. 'Max' of the last slot 402 may be separated from the first queue 401 and rearranged as the second queue 403 .

Also, the game opponent matching apparatus 10 may match at least one player placed in the queue according to the order in which the players are placed in the queue (S2006).

According to one embodiment, the game opponent matching device 10 may sequentially match at least one player placed in the queue two by two according to the order in which they are placed in the queue.

At this time, the game opponent matching device 10 may arrange the players according to the game ability of the players before matching the players placed in the queue. For example, the game opponent matching device 10 may arrange the order of players based on their match points.

According to another embodiment, the game opponent matching device 10 may randomly select at least one player disposed in the queue and match the player.

As described above, the player matching method can be implemented simply and efficiently by sequentially arranging players belonging to each group in a queue, which is a form of the data structure provided for each group, and matching the players.

The term '~unit' used in this embodiment means software or a hardware component such as a field programmable gate array (FPGA) or ASIC, and '~unit' performs certain roles. However, '~ part' is not limited to software or hardware. '~bu' may be configured to be in an addressable storage medium and may be configured to reproduce one or more processors. Therefore, as an example, '~unit' refers to components such as software components, object-oriented software components, class components, and task components, processes, functions, properties, and procedures. , subroutines, segments of program patent code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.

Functions provided within components and '~units' may be combined into smaller numbers of components and '~units' or separated from additional components and '~units'.

In addition, components and '~units' may be implemented to play one or more CPUs in a device or a secure multimedia card.

The game counterpart matching method according to the embodiment described with reference to FIG. 2 can also be implemented in the form of a recording medium containing instructions executable by a computer, such as program modules executed by a computer. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. Also, computer readable media may include both computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transport mechanism, and includes any information delivery media.

In addition, the game opponent matching method according to an embodiment of the present invention may be implemented as a computer program (or computer program product) including instructions executable by a computer. A computer program includes programmable machine instructions processed by a processor and may be implemented in a high-level programming language, object-oriented programming language, assembly language, or machine language. . Also, the computer program may be recorded on a tangible computer-readable recording medium (eg, a memory, a hard disk, a magnetic/optical medium, or a solid-state drive (SSD)).

Therefore, the game opponent matching method according to an embodiment of the present invention can be implemented by executing the computer program as described above by a computing device. A computing device may include at least some of a processor, a memory, a storage device, a high-speed interface connected to the memory and a high-speed expansion port, and a low-speed interface connected to a low-speed bus and a storage device. Each of these components are connected to each other using various buses and may be mounted on a common motherboard or mounted in any other suitable manner.

Here, the processor may process commands within the computing device, for example, to display graphic information for providing a GUI (Graphic User Interface) on an external input/output device, such as a display connected to a high-speed interface. Examples include instructions stored in memory or storage devices. As another example, multiple processors and/or multiple buses may be used along with multiple memories and memory types as appropriate. Also, the processor may be implemented as a chipset comprising chips including a plurality of independent analog and/or digital processors.

Memory also stores information within the computing device. In one example, the memory may consist of a volatile memory unit or a collection thereof. As another example, the memory may be composed of a non-volatile memory unit or a collection thereof. Memory may also be another form of computer readable medium, such as, for example, a magnetic or optical disk.

Also, the storage device may provide a large amount of storage space to the computing device. A storage device may be a computer-readable medium or a component that includes such a medium, and may include, for example, devices in a storage area network (SAN) or other components, such as a floppy disk device, a hard disk device, an optical disk device, or a tape device, flash memory, or other semiconductor memory device or device array of the like.

The above description of the present invention is for illustrative purposes, and those skilled in the art can understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, the embodiments described above should be understood as illustrative in all respects and not limiting. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is indicated by the following claims rather than the detailed description above, and all changes or modifications derived from the meaning and scope of the claims and equivalent concepts should be construed as being included in the scope of the present invention. do.

10: Game opponent matching device
110: player grouping unit 120: cue providing unit
130: player arrangement unit 140: queue status conversion unit
150: player matching unit

Claims (10)

A method of matching a game opponent of a player using a queue, performed by a game opponent matching device, comprising:
providing a plurality of queues, which are queues of players who have requested to provide a game, to a plurality of groups having a predetermined criterion for classifying a plurality of players;
arranging at least one player of the group in a queue provided to any one of the plurality of groups;
Closing the queue to stop placing players in the queue after a predetermined waiting time has elapsed; and
and matching a plurality of players arranged in the queue with each other. According to claim 1,
The game opponent matching method,
Based on the number of players arranged in the closed queue, determining whether to reassign any one of the players arranged in the queue, the game opponent matching method further comprising. According to claim 2,
The step of determining whether to relocate,
and rearranging any one of the players arranged in the first queue to a second queue when the number of players arranged in the first queue is an odd number. According to claim 1,
The game opponent matching method,
and arranging the arrangement order of each player in the queue based on the information of each player placed in the queue. An apparatus for matching a player's game opponent using a queue, comprising:
a player grouping unit for classifying a plurality of players according to a predetermined criterion and grouping them into a plurality of groups;
A queue providing unit that creates and provides a plurality of queues for each group, which is a queue of players who have requested game provision;
a player arranging unit for arranging the players classified by each group in a queue provided to each group for a preset waiting time;
a queue state switching unit for switching the state of the queue to a closed state, which is a state in which the arrangement of players in the queue is stopped according to whether the waiting time has elapsed; and
and a player matching unit that matches a plurality of players arranged in the queue with each other. According to claim 5,
The player arrangement unit additionally,
A game opponent matching apparatus that rearranges one of the players arranged in the queue based on the number of players arranged in the closed queue. According to claim 5,
The player arrangement unit additionally,
If the number of players arranged in the first queue is odd, rearranges one of the players arranged in the first queue to a newly created second queue. According to claim 5,
The player arrangement unit additionally,
Arranging at least one player disposed in the queue sequentially according to the rank of each player in the game. A computer-readable recording medium on which a program for performing the method according to claim 1 is recorded. A computer program executed by a game opponent matching device and stored in a recording medium to perform the method according to claim 1.

Images