KR101984808B1 - Probability fair game methode and system bisised on on line - Google Patents

Abstract

According to an embodiment of the present invention, provided is an online-based probability fair game method comprising a step of generating a server seed based on macro information, a step of generating a hash value for user identification based on the server seed, a step of sending the hash value for user identification to the user-side device, a step of generating a random value based on the server seed, a step of determining a probability-based variable component in the game based on the random value, and a step of transmitting the game data including the determined probability-based variable component to the user-side device. The macro information includes information on the result of another game.

Description

[0001] PROBABILITY FAIR GAME METHOD AND SYSTEM [0002] BACKGROUND OF THE INVENTION [0003]

The present invention relates to an online-based proberbility fair game method and system.

With the development of network diffusion environment, various services have recently been provided on the Internet. Among these content providing services, the game content providing service is the field where the expansion of the market and the speed of spread are the most rapid growth. The game contents provision service through online can enjoy the same game as an unspecified person at a remote location without restriction of time and space. Especially, cards and fire games through the Internet provide game contents services in the already known game methods, and are the most outstanding game services among the many game services currently provided.

Also, a card or a fighting game corresponds to a typical probability-based game. Therefore, the subject providing the game service has provided many technical devices to secure the reliability of the users on the fairness of the probability-based game. However, it is difficult to verify that the probability is not manipulated by the user himself, and on-line probability based games are not a true random number but a software random number generated based on a pseudo random number, Users question the fairness of probability based games. Moreover, it is increasingly difficult to secure the user's trust in probability-based games due to the emergence of a hacking method that collects all the random values that can appear in a game by utilizing a large amount of computing resources such as a rainbow table production.

Korean Patent Publication No. 10-2008-0085102 A1

The embodiment aims at eliminating the reversibility of generation of seed and hash value and securing the trust of the user on the probability based online game by blocking the possibility of seed leakage using sufficient process power.

It is also an object of the present invention to provide an online-based proberivity fair game method and system that can verify that a user is not a direct probabilistic operation.

An embodiment includes: generating a server seed based on macro information; Generating a user confirmation hash value based on the server seed; Sending the user confirmation hash value to the user device; Generating a random value based on the server seed; Determining a probability based variable component in the game based on the random value; And transmitting the game data including the determined probability-based variable component to the user-side device, wherein the macro information includes result information of another game based on the online-based proobligience fair game method can do.

In another aspect, there is provided a method for online pro baseball game, further comprising transmitting the server seed to the user side device after a game is finished.

In another aspect, the step of generating a server seed based on the macro information includes: retrieving, from a database, game money information of a user corresponding to a preset rank in another game; And generating the server seed based on the game money information. The present invention also provides an online-based pro-bubble-fair game method.

In another aspect, the step of generating a server seed based on the macro information comprises: retrieving card distribution order information in another game from a database; And generating the server seed based on the card distribution order information. The present invention also provides a method of online pro baseball game.

In another aspect, the step of generating a server seed based on the macro information includes: retrieving discarded card information of users in another game from the database; And generating the server seed based on the discarded card information. The present invention also provides an online-based proobligience fair game method comprising:

In another aspect, the method further comprises transmitting a page for verification in response to a request from the user-side device, wherein the verification page verifies that the user confirmation hash value is generated using the server seed Based online pro-bubble-paired gaming methodology that can be configured to play a game.

In another aspect, there is provided a method comprising: receiving a user seed from a user-side device; Generating a server seed based on macro information; Generating a combination seed in which the user seed and the server seed are combined; Generating a hash value for user identification based on the combination seed; Sending the user confirmation hash value to the user device; Generating a random value based on said combination seed; Determining a probability based variable component in the game based on the random value; Transmitting game data including the determined probability-based variable component to the user-side device; And transmitting the server seed to the user device after the game is finished, wherein the macro information may include a result information of another game, and may provide an online-based proberivity fair game method.

Embodiments can eliminate reversibility for seed and hash value generation.

Also, embodiments can block the possibility of seeding or random value hacking using a large amount of computing resources.

In addition, the embodiment makes it impossible for a user to infer a game result in real time even in a situation where a seed leaks or a rainbow table exists.

The embodiment can verify that the user is not a direct probability operation, thereby enhancing the user's credibility of the game fairness.

FIG. 1A is an exemplary diagram illustrating a proobality fair game system according to an embodiment of the present invention.
FIG. 1B is an exemplary view of a proobality fair game system according to another embodiment of the present invention.
FIG. 1C is a conceptual diagram for explaining a proberability fair game system. FIG.
FIGS. 2A to 2C are flowcharts of a pro bubble play method according to an embodiment of the present invention.
FIG. 2D is a conceptual diagram for helping understanding of the proobligience fair game method. FIG.
FIG. 3A and FIG. 3B are flowcharts of a proobligience fair game method according to another embodiment of the present invention.
FIG. 3C and FIG. 3D are conceptual diagrams for helping understanding of the proobligience fair game method.
FIG. 4A is a flowchart illustrating a method of playing a pro bubble game according to another embodiment of the present invention.
4B is a flowchart of a proobligience fair game method in another aspect.
4C is a conceptual diagram for helping understanding of the proobligience fair game method.
FIG. 5A is a flowchart of a proobligience fair game method according to another embodiment of the present invention.
5B is a conceptual diagram for helping understanding of the proobligience fair game method.

BRIEF DESCRIPTION OF THE DRAWINGS The present invention is capable of various modifications and various embodiments, and specific embodiments are illustrated in the drawings and described in detail in the detailed description. The effects and features of the present invention and methods of achieving them will be apparent with reference to the embodiments described in detail below with reference to the drawings. However, the present invention is not limited to the embodiments described below, but may be implemented in various forms. In the following embodiments, the terms first, second, and the like are used for the purpose of distinguishing one element from another element, not the limitative meaning. Also, the singular expressions include plural expressions unless the context clearly dictates otherwise. Also, the terms include, including, etc. mean that there is a feature, or element, recited in the specification and does not preclude the possibility that one or more other features or components may be added. Also, in the drawings, for convenience of explanation, the components may be exaggerated or reduced in size. For example, the size and thickness of each component shown in the drawings are arbitrarily shown for convenience of explanation, and thus the present invention is not necessarily limited to those shown in the drawings.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings, wherein like reference numerals refer to like or corresponding components throughout the drawings, and a duplicate description thereof will be omitted .

FIG. 1A is an exemplary view of a pro bubble pair game system according to an embodiment of the present invention, FIG. 1B is an exemplary view of a pro bubble pair game system according to another embodiment of the present invention, And is a conceptual diagram for explaining a reality fair game system.

1A and 1B, a proobality fair game system 10 according to an embodiment of the present invention may include at least one user-side device 100, a server 200, and a network 300 .

1A and 1B may be implemented or associated with hardware components, software components, or firmware components, or any combination of these components. In addition, the elements of FIGS. 1A and 1B may be implemented or associated with, for example, servers, software processors, and / or engines and / or various embedded systems. And the elements may be provided as content beading and / or distributed networks.

The user-side device 100 is one or more computers or other electronic devices used by a user to execute applications that perform various tasks. For example, a computer, a laptop computer, a smart phone, a mobile telephone, a PDA, a tablet PC, or any other device operable to communicate with the server 200. The user side device 100 includes processing logic that executes on various machines and interprets and executes instructions stored in the plurality of memories, and includes a graphical user interface (GUI) on the external input / output device, ), ≪ / RTI > and other processes for displaying graphical information for the user. In addition, the user side device 100 may be connected to an input device (e.g., a mouse, a keyboard, a touch sensitive surface, etc.) and an output device (e.g., a display device, a monitor, a screen, etc.). Applications executed by the user-side device 100 may include a game application, a web browser, a web application running on a web browser, word processors, media players, spreadsheets, image processors, security software or otherwise .

The user-side device 100 also includes at least one memory 101 and at least one processor 102 for storing instructions and the instructions are stored in the processor 102 to cause the processor 102 to perform operations. And operations may include operations of transmitting a game execution request signal, generating a user seed, receiving a user seed input, transmitting a user seed, transmitting and receiving game data, and receiving various information.

When the game application is executed in the user-side device 100, the game environment is configured in the user-side device 100. [ The game application exchanges game data with the server 200 through the network 300 to allow the game service to be executed on the user-side device 100.

The game service provided by the server 200 may be configured such that a virtual computer user provided by the server 200 and an actual user participate in a game together. This is because one actual user and at least one computer user play the game together in the game environment implemented on the user-side device 100. [ In another aspect, the game service provided by the server 200 may be configured such that a plurality of user-side devices participate and a game is played.

The game service provided by the server 200 may be a probability game service based on a proberability fair. Here, the probability game service exemplarily includes a combination of 52 different cards, such as a trump, by collecting cards based on predetermined rules, or arranging cards held by each user There is a game that determines win or loss. As another example, there is a game in which win or loss is determined according to a random number determined within a predetermined number of ranges such as a die. However, the present invention is not limited to this, and there may be a poker, a blackjack, a fireball or various dice games using cards, and the number of cards used in the game may vary depending on the type of game or the rules of the game.

Referring to FIG. 1C, the server 200 may provide a game service to at least one user-side device 100. When the server 200 receives a game execution request from the user-side device 100, the server 200 may configure a probability-based variable component, which is a component of the components constituting the game. Then, the server 200 transmits the game data including the data on the probability-based variable components to the user-side device 100. An example of a probability-based variable component may be deck information in a card game. Deck means a card suit. And any one of a plurality of decks may be selected according to the probability. Here, the cards constituting each of the plurality of decks may be different from each other in mixing. The types of cards to be distributed to the users in the game environment are different depending on which deck is selected among the plurality of decks because the blending of the cards constituting each of the plurality of decks is different. In another example, the probability-based variable component may be the number of pieces of information that a die in a die game represents. However, the probability-based variable component is not limited to the above-described example, and all the game components randomly determined among the components constituting the game may be included here.

The server 200 includes at least one memory 201 and at least one processor 202 for storing instructions and instructions are executable by the processor 202 to cause the processor 202 to perform operations. The operations include receiving a game execution request signal, transmitting a random value request signal, generating a server seed, receiving a user seed, generating a combined seed, generating a hash value, determining a probability based variable component, retrieving data in the memory 210, And various transmission and transmission operations.

In addition, the server 200 may use a seed, a random function, and a hash function to generate a probability-based variable component. A random function is a function that receives a seed and outputs a random value of arbitrary length. For example, the server 200 may match all the random values that can be output from the random function to each of the plurality of deck information, and may select deck information matched in advance to the random value output from the random function among the plurality of deck information have. As another example, the server 200 may match all of the random values that can be output from the random function to each of the numbers that can be represented by the die, and may select the number of dice matched in advance to the random value output from the random function, have. The random functions described herein can be different kinds of random functions. Thus, the random functions may each output different values for the same input, but are not limited thereto.

The hash function is a function that receives a seed message having an arbitrary length and outputs a hash value of a fixed length. The hash function does not use keys, so the same output always appears for the same input. The purpose of using these functions is to provide an integrity to detect seed errors or tampering by extracting unchangeable evidence values for the input seeds. Examples of the hash function include Secure Hash Algorithm (SHA) and HAS-160, but not limited thereto, and well-known hash functions can be used.

The server 200 can generate a seed that is at least a part of the input values of the random function and the hash function, and can configure the game service and provide it to the user-side device 100. In another aspect, the server 200 may be composed of a seed generation server 210 and a game server 220 that generate a seed. The game server 220 may receive the seed generated from the seed generation server 210 to generate a probability-based variable component and provide the game service to the user-side device 100.

The network 300 may include any element or system that facilitates communication between various network nodes, such as the user-side device 100 and the servers 200. For example, the network 300 may include one or more telecommunication networks, such as computer networks, telephone or other communication networks, the Internet, and the like. In addition, the network 300 may include a shared public or private data network covering a wide area (e.g., WAN) or a nearby area (e.g., a LAN). In some implementations, the network 300 may facilitate exchanging data in a packet-switched manner using the Internet Protocol (IP). Also, the network 300 may facilitate wired and / or wireless connections and communications.

FIGS. 2A to 2C are flowcharts of a pro bubble play method according to an embodiment of the present invention, and FIG. 2D is a conceptual diagram for helping understanding of a pro bubble play method.

2A to 2D, a prooblessy game method S100 according to an exemplary embodiment of the present invention includes generating a server seed based on macro information (S110), generating a hash for user confirmation Generating a random value based on the server seed (S140); generating a random number based on the probability value in the game based on the random value (S120) (S160) of transmitting the game data including the determined probability-based variable component to the user device (S160); and transmitting the server seed to the user device (S170) after the game is finished . ≪ / RTI >

More specifically, the server 200 may generate a server seed based on the macro information (S110). The macro information is information that can be changed every game without a certain regularity. For example, the macro information may include user information and game play information. The user information may be information unique to a user who can vary every game, such as a user's game grade level, winning or losing information in a specific game, number of games in a specific game, virtual money held by the user, and the like. Also, the game play information may be various game scenario information displayed in a specific game environment such as game progress information, game result information, and the like.

The server 200 may provide user services and game play information to the user-side device 100 while storing the user information and the game play information in a database, and may continuously update the user information and the game play information.

Referring to FIG. 2A, a server seed generation step (S110) includes a step (S111a) of retrieving game money information of a user corresponding to a preset rank in a previous game from a database (S111a) And generating a server seed (S112a). For example, the server 200 may search the database for the user who recorded the first rank in the previous game and read the game money information of the user. The output value of the random function that receives game money information can be used as the server seed.

Referring to FIG. 2B, a server seed generation step (S110) includes a step (S111b) of retrieving card distribution order information in a previous game from a database and a step (S112b) of generating a server seed based on card distribution order information ). For example, the server 200 can search the database for the order information of the cards distributed to the users according to the game scenario in the previous game. The output value of the random function that receives the card distribution order information that is searched can be used as the server seed. Here, the card dispense order may be information on a card distributed at a specific point in the game play process. On the other hand, it can be information about all the cards distributed during a specific time period during the game play process. In another aspect, it may be information about x cards distributed from a particular point in the gameplay process. However, the present invention is not limited thereto.

Referring to FIG. 2C, a server seed generation step (S110) includes a step S111c of retrieving discarded card information of users in a previous game play situation from a database and a step of generating a server seed based on discarded card information S112C). For example, the server 200 may search the database for card information that has been abandoned by users according to the game scenario in the previous game. The output value of the random function that receives the retrieved card information can be used as the server seed. The card information that the user has discarded here may be information on the card discarded at a specific point in the game play process. In other respects, it may be information about discarded cards during a specific time period during the game play process. In another aspect, it may be information about x cards discarded from a particular point in the gameplay process. However, the present invention is not limited thereto.

On the other hand, the server seed may be composed of numerals, letters or numbers, strings, or combinations of numbers and letters, but is not limited thereto.

In addition, if the server seed generated based on the macro information does not correspond to the length of 32 bits or 64 bits, the server 200 may adjust the length of the number through encoding or hashing.

The server 200 can generate a hash value for user confirmation that is an output value of the hash function that receives the created server seed as input. In addition, the server 200 can transmit the user confirmation hash value to the user-side device 100. [

Upon receiving the user confirmation hash value, the user-side device 100 can display the hash value. In another aspect, the user-side device 100 may display a hash value display icon for user confirmation. And display the user confirmation hash value received from the server 200 in response to the user's selection of the corresponding icon.

The server 200 can generate a random value which is an output value of the random function that receives the server seed. According to some embodiments, the server seed in the server 200, which is a 32-bit system, may be composed of numbers corresponding to or close to the 32th power of 2, and the server seed in the server 200 of 64-bit system corresponds to 2 to 64 Or a number close thereto.

In addition, the server 200 may determine a probability-based variable component in the game based on the generated random value. In addition, the server 200 may transmit the game data including the determined probability-based variable component to the user-side device 100. [ The user device 100 can play the game based on the received game data.

In addition, the server 200 can transmit the server seed to the user-side device 100 after the game ends.

In addition, the proobality fair game method (SlOO) may further include transmitting a verification page capable of verifying that the user confirmation hash value is generated using the server seed in response to the request of the user device have.

The hash function used by the server 200 can be preprogrammed in the verification page.

In another aspect, the verification page may be configured to include a link to a page that allows the server 200 to calculate the output value using the hash function used by the server 200. [ Therefore, the user inputs the server seed received from the server 200 on the verification page (or on the page connected to the link on the verification page) and checks whether the same value as the user confirmation hash value received from the server 200 Can be verified.

According to the embodiment of the present invention, the server 200 generates a server seed based on macro information. Therefore, even if the user knows information on all server seeds that the server 200 can generate due to hacking or the like, the user can infer what actual server seed will be used when determining the probability-based variable component It is very difficult.

In addition, the server 200 may be configured to generate server seeds using different macro information for each game. Therefore, even if a user utilizes a large amount of computing resources, it is almost impossible for a user to infer a server seed to be used in a current game in real time.

FIG. 2E is a flowchart of a proobligience fair game method according to another embodiment of the present invention.

Referring to FIG. 2E, a proobabity fair game method S100 according to an embodiment of the present invention includes a step S110 of receiving a user seed from a user side device, a step S120 of generating a server seed based on macro information, (S130) generating a combination seed in which a user seed and a server seed are combined, generating a user confirmation hash value based on the combination seed (S140), and transmitting the user confirmation hash value to the user device (S160), generating a random value based on the combination seed (S160), determining a probability-based variable component in the game based on the random value (S170), determining a game including the determined probability-based variable component Transmitting the data to the user device (S180), and transmitting the server seed to the user device (S190) after the game is finished.

More specifically, when the proberability game is executed in the user-side device 100, the user-side device 100 can transmit the user seed to the server 200. [ The user device 100 can transmit to the server 200 a user seed automatically generated by the random number generation program installed in advance on the user device 100 at the time of execution of the proberability fair game. The random number generation program may generate a user seed based on various input variables associated with the characteristics of the various user-side devices 100 or related to the user's game information. The user seed generated by the random number generation program can be displayed on the user-side device 100 so that the user can confirm it. In another aspect, the user-side device 100 may send the user seed entered by the user to the server 200. [

The server 200 can generate a server seed which is an output value of a random function that receives macro information as input.

The user seed and the server seed may consist of, but are not limited to, numbers, letters or numbers, strings, or combinations of numbers and letters.

The server 200 can generate a combination seed in which a user seed and a server seed are combined. For example, the server 200 can generate a combination seed, which is a string AAABBB, by combining a user seed, which is a string of AAA, and a server seed, which is a string of BBB.

The server 200 may generate a hash value for user confirmation based on the combination seed. For example, the server 200 may generate a user confirmation hash value using a hash function that outputs a user confirmation hash value, which is string #! Ojqncui @ $, as an input of a combination seed, which is an AAABBB string.

The server 200 can transmit the user confirmation hash value to the user side device. The server 200 may generate a random value for the combination seed using a random function that outputs a random value based on the combination seed, and may determine a probability-based variable component in the game based on the generated random value . Then, the server 200 may transmit the game data including the determined probability-based variable component to the user-side device 100 so that the game is played. The server 200 may transmit the server seed to the user-side device 100 in response to a request from the user-side device 100 after the game ends.

When a user inputs a combination seed obtained by combining a received server seed with a known user seed using the hash function used in the server 200, the user checks whether or not the hash function outputs a hash value for user confirmation, Fairness can be verified.

In addition, since the embodiment uses the user seed when generating the random value, the reliability of the fairness of the game of the user can be improved. In addition, since the embodiment uses variable macro information according to a game play result of a user when creating a server seed, possibility of server seed leakage and possibility of seed hacking using a rainbow table can be minimized.

Meanwhile, the method of generating the server seed using the macro information may be applied to other embodiments.

FIG. 3A and FIG. 3B are flowcharts of a proobligience fair game method according to another embodiment of the present invention. And FIGS. 3C and 3D are conceptual diagrams for helping understanding of the proobligience fair game method.

Referring to FIGS. 1B, 3A, and 3C, a proobligience fair game method (S200) according to another embodiment of the present invention includes counting the number of times of receiving a game execution request signal from the user device (S210) A random number request signal including counting information to the seed generation server (S220), generating a hash value for user confirmation based on the received random number (S230), and transmitting the generated hash value to the user (S240) of transmitting the random variable based on the random variable based on the received random variable to the side device (S250), determining (S250) a probability variable component in the game based on the received random value, S260) and transmitting the random value to the user device after the game ends (S270).

More specifically, when the game server 220 receives the game execution request signal from the user-side device 100, the game server 220 can update the counting information. That is, each time a game execution request signal is received from each of the plurality of user-side devices, the number of reception times can be counted. When the game server 220 receives the game execution request signal from the specific user device, the game server 220 updates the counting information and transmits the updated counting number to the seed generation server 210 to request a random value. The seed generation server 210 may generate a random value based on the counted number received in response to the random value request. That is, the seed generation server 210 may generate a random value that is an output value of a random function that inputs a counting number. The game server 220 may use the random value received from the seed generation server 210 as a server seed. In addition, the game server 220 may generate a hash value for user confirmation based on the server seed and transmit it to the user-side device 100. The game server 220 may then determine the variable-random component in the game based on the output value of the random function that takes the server seed as input. Then, the game server 220 may transmit the game data including the determined variable variable component information to the user-side device 100. The user device 100 can play the game based on the received game data. Then, the user-side device 100 can request a game verification to the game server 220 for game verification after the game ends. The game server 220 may then send the server seed, which is a random value, to the user-side device 100 in response to the game verification request.

The embodiment makes it impossible to hack the random value to be used as the server seed even in the case where all the server seeds are leaked. More specifically, when the game server 200 receives a game execution request signal from a plurality of user devices, the game server 200 counts the game execution request signal and transmits the counting information to the seed generation server. And the seed generation server generates a random value based on the received counting information. That is, if the counting information is different, the random value may also be changed. In this case, even if a specific user hacked the random value generation algorithm of the seed generation server, it is very difficult to guess how many times the game device 220 transmits the game execution request signal to the game server 220. Therefore, the embodiment makes it very difficult for the user to grasp the random value generated by the seed generation server 210 in real time.

Referring to FIG. 1B, FIG. 3A and FIG. 3D, a prooblessience game method (S200) according to another embodiment of the present invention will be described in another aspect. The embodiment includes a step S210 of counting the number of receipt of a game execution request signal from the user device (S210), a step S210 of counting the number of receipt of the game execution request signal from the user side device (Step S220), generating a hash value for user confirmation based on the received random value (S230), transmitting the created hash value for user confirmation to the user device (step S240 (S250) of determining a probability variable component in the game based on the received random value, transmitting the game data including the determined probability-based variable component to the user device (S260) To the user device (S270).

More specifically, the game server 220 can receive a game execution request signal from the plurality of user-side devices 100. [ Here, the game execution request signal may be a signal for causing the game server 220 to start generating the server seed. The game server 220 may count the received game execution request signal. The game server 220 can request a random value from any one of the plurality of seed generation servers 210 based on the number information and the counting information of the plurality of seed generation servers 210 registered in advance. For example, the game server 200 receives the game execution request signal from the user-side device 100 and updates the counting information (for example, if the current counting number is 21, the updated counting number is 22) . And may request a random value from any one of the six seed generation servers 210.

The game server 220 may select one seed generation server corresponding to the result from Equation 1 among the J seed generation servers 210 and request a random value to the selected seed generation server.

[Equation 1]

Number of counted% Number of pre-registered random servers = result value

In the above example, since the counted number is 22 and the number of seed generation servers 210 registered in advance is 6, 22 is divided by 6, and the rest is 4. So the result is 4. In this case, the game server 220 may request a random value to the fourth seed generation server. In another aspect, a random value may be requested to a seed generation server that has been pre-matched to result value 4.

The game server 220 may receive a random value from the seed generation server and use the received random value as a server seed. The game server 220 may generate a user confirmation hash value that is an output value of the hash function that receives the server seed as input. Then, the game server 220 can transmit the created user confirmation hash value to the user-side device 100. The game server 220 may generate an output value of the random function that receives the server seed. The game server 220 may then determine a random variable component in the game based on the random value. The game server 220 may then transmit the game data including the determined probability-based variable element to the user-side device 100. In addition, the game server 220 may transmit the server seed to the user-side device 100 in response to the request of the user-side device 100. [

Referring to FIG. 3B, a proobality fair game method (S200) according to another embodiment of the present invention includes counting the number of times of receiving a game execution request signal from the user device (S210) A step S230 of requesting a seed generation server of a plurality of seed generation servers based on the number information and counting information of a plurality of seed generation servers registered in advance (S220) (S240) generating a combination seed by combining the received random value and the user seed, generating a user confirmation hash value based on the combination seed (S250), and transmitting the generated user confirmation hash value to the user device (S260), determining a probability-based variable component in the game based on the combination seed (S270), determining the game data including the determined probability-based variable element (S280) of transmitting the random value to the user device (S280), and transmitting the random value to the user device after the game (S290).

For example, in more detail, the game server 220 may count a game execution request signal by incrementing the game execution request signal by one each time the game execution request signal is received from the user-side device 100. The game server 220 may receive the user seed generated by the user-side device 100. In another aspect, the game execution request signal may include user seed information. The game server 220 can calculate the result of Equation (1) based on the number of seed generating servers previously registered according to Equation (1) and the current counting information. Then, the game server 220 can request a random value to the seed generation server matching the calculated result value. The seed generation server 210 may generate a random value in response to the random value request signal received from the game server 220 and may transmit the generated random value to the game server 220.

The game server 220 may use the received random value as a server seed. The game server 220 generates a combination seed in which the user seed and the server seed are combined, and generates a user confirmation hash value that is an output value of the hash function that receives the combination seed as an input. Then, the game server 220 may transmit the user confirmation hash value to the user-side device 100. In addition, the game server 220 may determine a probability-based variable component in the game based on the combination seed, and may transmit the game data including information on the determined probability-based variable component to the user-side device 100. [ Further, after the game ends, the user device 100 may request the game server 220 to perform game verification. The game server 220 may transmit the server seed to the user side device 100 in response to the game verification request of the user side device 100. [

The embodiment makes it impossible to hack the information on the server seed, which is basic information for determining the probability-based variable component, even in a situation where all the server seeds are leaked. More specifically, when receiving a game execution request signal from a plurality of user devices, the game server 200 counts the game execution request signal and selects a seed generation server to request a random value according to the counting information. Accordingly, it is very difficult for a specific user-side device to deduce how many times the game execution request signal of the specific user-side device is transmitted to the game server 220. [ This has the effect of making it very difficult for a specific user to guess a random value to be used as a server seed.

In addition, the embodiment can block the possibility of hacking the server seed by setting the random value generation algorithm of each of the plurality of seed generation servers differently. For example, even when a specific user hackes the number of game execution request signals while controlling a plurality of user devices, it is possible to use a real time generation algorithm in real time unless a specific user grasps all the random value generation algorithms of a plurality of seed generation servers It is almost impossible to hack the server seed.

Meanwhile, the server seed generation method described in this embodiment can be applied to other embodiments as well.

FIG. 4A is a flowchart illustrating a pro bubble play method according to another embodiment of the present invention, and FIG. 4B is a flowchart illustrating a pro bubble play method according to another embodiment of the present invention. 4C is a conceptual diagram for helping understanding of the proobligience fair game method.

Referring to FIGS. 4A to 4C, a method S300 of a proberability fair game according to another embodiment of the present invention includes a step S310 of receiving a user seed from a user side device, Generating a random value based on the user seed and the server seed (S330); determining a probability-based variable component in the game based on the random value (step S320) S340), transmitting the user confirmation hash value to the user device (S350), generating game data based on the determined probability-based variable component (S360), transmitting the game data to the user device S370) and transmitting the server seed to the user-side device (S380).

More specifically, the server 200 can receive the user seed from the user-side device 100. [ In another aspect, the server 200 may receive a user seed from a plurality of user-side devices 100 when a plurality of user-side devices participate in one game. In this case, it is possible to use only one user seed among a plurality of received user seeds. In another aspect, when a plurality of users participate in one game, the server 200 may request a user seed to only one of the plurality of user-side devices.

In addition, the server 200 may generate a server seed. In another aspect, the server 200 may be composed of a game server and a seed generation server. According to the above-described method, the random value received from the seed generation server by the game server may be used as the server seed. The server 200 may generate a user confirmation hash value based on the user seed and the server seed.

In another aspect, server seeding may include first and second server seeds.

The server 200 may generate a first combination seed in which the user seed and the first server seed are combined (S321). For example, the server 200 can generate a first combination seed, which is a string AAABBB, by combining a user seed, which is a string of AAA, and a first server seed, which is a string of BBB. Then, the server 200 may generate the first hash value based on the first combination seed (S322). For example, a hash function can generate a first hash value of #! Ojqncui @ $ string with the first combination seed as the AAABBB string as an input. The server 200 may generate a second hash value based on the second server seed (S323). For example, a hash function can generate a second hash value that is a string of ^ & nxcaoi! # $ Q with a second server seed as the CCC string as input. In addition, the server 200 may generate a second combination seed in which the first hash value and the second hash value are combined (S324). For example, the server 200 may use a combination of a first hash value of #! Ojqncui @ $ and a second hash value ^ ^ nxcaoi! # $ Q, 2 combination seeds can be generated. Then, the server 200 can generate a user confirmation hash value based on the second combination seed (S325). For example, a hash function can generate a hash value for user identification, which is string% $ #% vssdf3! & 4, with the second combination seed as the string #! Ojqncui @ $ ^ & nxcaoi! # $ Q. The server 200 may transmit the user confirmation hash value to the user device 100. [

In addition, the server 200 can generate a random value which is an output value of a random function using the user seed and the server seed as inputs. For example, the random function may generate a random value that is an output value of a random function that takes the first combination seed as an input. The server 200 may then determine a probability-based variable component in the game based on the generated random value. The server 200 may construct game data based on the probability-based variable components, and may transmit the configured game data to the user-side device 100. [

In addition, the server 200 may transmit a server seed and a random value to the user-side device 100 after the game ends. In another aspect, the server 200 may send a server seed to the user-side device 100 in response to a game verification request from the user-side device 100 after the game ends.

The embodiment transmits the user confirmation hash value generated based on the second combination seed to the user device 100 so that the user can not infer the server seed from the user confirmation hash value. That is, the hash value for user identification and the seed are not matched one to one with each other, and the server seed outflow is made almost impossible by a method of producing the rainbow table.

FIG. 5A is a flowchart of a proobligience fair game method according to another embodiment of the present invention. And FIG. 5B is a conceptual diagram for helping understanding of the proobligience fair game method.

5A and 5B, a prooblessy game method (S400) according to another embodiment of the present invention includes a step S410 of receiving a user seed from a user side device, a step S410 of, based on a user seed and a server seed (S430) generating a first user confirmation hash value, generating a random value based on the user seed and the server seed (S430), selecting one of the plurality of decks based on the random value (S440), updating (S450) the position of the card in the selected deck based on the position information seed, generating (S460) a second user confirmation hash value based on the position information seed, (S470) of transmitting the hash value for user identification to the user device (S470), constructing the game data based on the updated deck information (S480), and transmitting the game data to the user device S490) It can hamhal.

More specifically, the server 200 may receive the user seed from the user device. In addition, the server 200 can generate a combination seed in which a user seed and a server seed are combined. Then, the server 200 can generate a first user confirmation hash value which is an output value of the hash function inputting the combination seed. The server 200 can generate a random value which is an output value of the random function that receives the combination seed as an input. The server 200 may retrieve a plurality of deck information from the database and select one deck information matched in advance to a random value. Each of the plurality of decks may include N (N is a natural number of 2 or more) cards. Each of the plurality of deck information may include card position information of each card. The card position information may be matched with the order information in which cards constituting one deck in the game environment are distributed. That is, depending on the location information of the cards, the types of cards sequentially distributed in the game environment are different.

The server 200 may update the position of the card in the selected deck based on the position information seed. For example, the server 200 may generate a position information seed, which is an output value of a random function that receives a combination seed as an input.

The position information seed may be composed of a sequence of N numbers that do not overlap with each other. And each of the N numbers constituting the position information seed may correspond to the position of the cards in the selected deck. The server 200 may update the positions of the cards in the selected deck by sequentially rearranging the cards in the positions corresponding to the numbers sequentially designated from the first number to the Nth number of the position information seeds. For example, assume that the selected deck contains six cards, and the deck contains D1, D2, S1, S2, H1, and H2. If the location information of the card in the deck is not updated, the card will be distributed to users in order of D1, D2, S1, S2, H1 and H2 in the game environment. If the position information seed is {3, 2, 4, 5, 1, 6}, a position corresponding to the number of each number sequentially from the first number (3) to the sixth number (6) The cards are rearranged in order, and the positions of the cards in the updated deck are S1, D2, S2, H1, D1, H2. Therefore, cards can be distributed to users in the order of S1, D2, S2, H1, D1, and H2 in the game environment.

The server 200 may convert the position information seed. Illustratively, a total of 52 cards in the deck and a positional information seed of {6, 10, 17, 44, 28,. . . , 2}, the server 200 can convert the position information seed by excluding 10 digits for the number of 10 or more of the numbers in the position information seed. In the case of 10, 20, 30, 40, and 50, 0 is substituted for 10, and 0 is replaced by -1. In the above example, the converted position information seed is {6, -1, 7, 4, 8,. . . , 2}, which is a total of 52 numbers. The server 200 may square the respective numbers constituting the converted position information seed. If the square root is greater than long, the transformed position information seed can be transformed by using only the mantissa part of the exponent. And generate a second user confirmation hash value that is an output value of the hash function that takes the positionally-changed seed information as an input.

The server 200 may transmit the first and second user confirmation hash values to the user-side device 100 before starting the game. Then, the server 200 can construct the game data based on the information of the deck where the position of the card is updated, and transmit the configured game data to the user-side device 100. [

In addition, the server 200 may transmit the server seed and the converted position information seed to the user-side device 100 in response to the game end. Alternatively, in response to a game verification request of the user device 100 after the game ends, the server seed and the converted position information seed may be transmitted to the user device 100. [

The user can verify the game result using the first user confirmation hash value and the server seed. The embodiment also provides the user with the converted location information seed and the second user confirmation hash value to allow the user to trust that the updating of the deck information is done in a fair manner.

In addition, in the embodiment, in order to block the problem of the hacking user continuously collecting the position information seed and hacking the game play result, the position information seed is transmitted to the user device 100 without transmitting the converted position information seed do.

In addition, the embodiment can prevent the problem that the hacking user constantly collects the deck information to be played and infer the game play result by changing the position of the card in the selected deck based on the random value. Further, the hash value of the updated position information of the card is transmitted to the user, thereby securing the user's trust in the fairness of the game.

The embodiments of the present invention described above can be implemented in the form of program instructions that can be executed through various computer components and recorded in a computer-readable recording medium. The computer-readable recording medium may include program commands, data files, data structures, and the like, alone or in combination. The program instructions recorded on the computer-readable recording medium may be those specifically designed and configured for the present invention or may be those known and used by those skilled in the computer software arts. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROM and DVD, magneto-optical media such as floptical disks, medium, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those generated by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware device may be modified into one or more software modules for performing the processing according to the present invention, and vice versa.

The specific acts described in the present invention are, by way of example, not intended to limit the scope of the invention in any way. For brevity of description, descriptions of conventional electronic configurations, control systems, software, and other functional aspects of such systems may be omitted. Also, the connections or connecting members of the lines between the components shown in the figures are illustrative of functional connections and / or physical or circuit connections, which may be replaced or additionally provided by a variety of functional connections, physical Connection, or circuit connections. Also, unless explicitly mentioned, such as " essential ", " importantly ", etc., it may not be a necessary component for application of the present invention.

While the present invention has been described in connection with what is presently considered to be practical exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the technical scope of the present invention should not be limited to the contents described in the detailed description of the specification, but should be defined by the claims.

Claims (7)

Generating a server seed based on macro information;
Generating a user confirmation hash value based on the server seed;
Sending the user confirmation hash value to the user device;
Generating a random value based on the server seed;
Determining a probability based variable component in the game based on the random value; And
And transmitting the game data including the determined probability-based variable component to the user-side device,
The macro information includes information on the result of another game
An online based pro bubble game. The method according to claim 1,
And transmitting the server seed to the user-side device after the game ends
An online based pro bubble game. The method according to claim 1,
Wherein generating the server seed based on the macro information comprises:
Retrieving game money information of a user from a database corresponding to a preset rank in another game; And
And generating the server seed based on the game money information
An online based pro bubble game. The method according to claim 1,
Wherein generating the server seed based on the macro information comprises:
Retrieving card distribution order information in another game from the database; And
And generating the server seed based on the card distribution order information
An online based pro bubble game. The method according to claim 1,
Wherein generating the server seed based on the macro information comprises:
Retrieving abandoned card information of users in other games from the database; And
And generating the server seed based on the discarded card information
An online based pro bubble game. The method according to claim 1,
Further comprising: transmitting a page for verification in response to a request from the user-side device,
Wherein the verification page is configured to verify that the user confirmation hash value is generated using the server seed
An online based pro bubble game. Receiving a user seed from a user-side device;
Generating a server seed based on macro information;
Generating a combination seed in which the user seed and the server seed are combined;
Generating a hash value for user identification based on the combination seed;
Sending the user confirmation hash value to the user device;
Generating a random value based on said combination seed;
Determining a probability based variable component in the game based on the random value;
Transmitting game data including the determined probability-based variable component to the user-side device; And
And transmitting the server seed to the user device after the game is finished,
The macro information includes information on the result of another game
An online based pro bubble game.

Images