KR101097545B1 - Method For Providing Paduk Game - Google Patents

Abstract

A next number suggestion method using a next number relation database according to the present invention includes a first step of forming a halftone pattern based on a current number of points and a second step of searching whether the halftone pattern is stored in the halftone pattern database by the current number. Step 3, when the search result of the second step, if the half-pattern pattern is stored, a third step of obtaining the serial number of the half-pattern pattern from the half-pattern pattern database, a tuple having the serial number in the next number relation database by the current number A fourth step of searching and a fifth step of reading and displaying next arrival point information from the searched tuple.
In the case of implementing the next number proposal method according to the present invention, an optimal next number having the highest odds in a given situation can be proposed using the reverse pattern database and the next number relation database.

Description

How to provide Go game {Method For Providing Paduk Game}

The present invention relates to a method for proposing the next number in Go using a half-phase pattern database and a next number relation database.

In the case of Go, one can intuitively think of a few places where he wants to be, but a computer program is not capable of looking over the board as human eyes and associating it with its own experience or knowledge.

Also, beginners who just go to Go programs or Go will need to select the next number in the paving stage. In particular, it is important to systematically store odds statistics, etc. in the situation on the board by step by step, in order to improve the paving ability of the Go program.

In the case of FIG. 1, the conventional technique is '0' for the space not occupied by the white stone or black stone, '1' for the space occupied by the black stone, and the space occupied by the black stone in the inversion pattern indicating the arrangement information of the black stone and the white stone placed on the board. Can be displayed as a '2' to display a checkerboard pattern.

The conventional technique is merely a method of transforming a half-pattern pattern into a ternary number. For example, in the case of a real country's paving stone phase, when the first number needs to be found, it is necessary to place the first and the first. It is not possible to analyze the statistical data of various powers such as displaying the winning rate when the knight points to the point or suggesting the landing point according to the winning rate so that the paving can be carried out more effectively.

Therefore, a database that can systematically store the pattern of the pattern according to the progress of the number when the number of posterior stones is important as well as the stage of the silk paving stone, and a database having the next number of winning and losing information from the pattern of patterns formed by the recent number. It is desirable to analyze the winning rate by each case to obtain efficient progress.

SUMMARY OF THE INVENTION The present invention has been made to solve the problems of the prior art, and an object thereof is to propose an optimal next number using a reverse pattern database and a next number relation database.

The next number suggestion method according to the present invention includes a first step of forming a halftone pattern based on a current number of points, a second step of searching whether the halftone pattern is stored in the halftone pattern database by the current number, and the second step. A third step of obtaining a serial number of the reverse pattern from the reverse pattern database when the reverse pattern is stored; and a fourth step of searching for a tuple having the serial number in a next number relation database based on a current number; And a fifth step of reading and displaying next arrival point information from the retrieved tuple.
The next number suggestion method according to the present invention is characterized in that it further comprises the step of terminating if the search result of the second step is not stored.
The next number suggestion method according to the present invention is further characterized in that, in the fifth step, reading and displaying the black victorious and the white victorious from the searched tuples.

In the case of implementing the next number proposal method according to the present invention, an optimal next number having the highest odds in a given situation can be proposed using the reverse pattern database and the next number relation database.

BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a diagram for illustrating the representation of a half-phase pattern in ternary number.
2 is a flowchart of a method for proposing the next number using the reverse pattern database and the next number relation database according to the present invention;
3 is a diagram showing the next proposed number using the reverse pattern database and the next number relation database according to the present invention.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. First, in adding reference numerals to the components of each drawing, it should be noted that the same reference numerals are used as much as possible even if displayed on different drawings. In describing the present invention, when it is determined that the detailed description of the related well-known configuration or function may flow the gist of the present invention, the detailed description thereof will be omitted.

In the following, it is assumed that Go is finished within 500 numbers. In addition, the checkerboard is square, and the pattern generated by rotating 90 degrees with respect to its center point of thousand won also represents the same game situation as the original pattern. Therefore, the arbitrary half-pattern pattern can be said to be a pattern equivalent to the pattern after rotating it 90 degrees, 180 degrees, and 270 degrees centering on the thousand won, respectively. Based on the arrangement of the stones among the four equivalent patterns, the representative half-pattern pattern can be calculated and determined. Hereinafter, when any one pattern stored in the notation file is the same as the pattern after rotating the pattern stored in the other notation file by 90 degrees, 180 degrees, or 270 degrees, the description will be made based only on the representative reflection pattern. do. Therefore, the half phase pattern stored as one tuple in the database below means such a representative half phase pattern.

It is assumed that Fig. 1 is a representative halftone pattern of a certain halftone pattern. If this is expressed in ternary form by row unit, it is as follows.

A row in which the upper left ear exists is defined as the first row, and a row in which the lower left ear exists is defined as the 19th row. Then, the first row is black stone-space-black stone-space-white stone-space. Therefore, if you give the value of 1 in black stone, 2 in white stone, and 0 in space, it is equal to 1010201000000000000.

As such, when the half-pattern pattern of FIG. 1 is displayed in a ternary manner for each row, it is shown in Table 1 below.

First row

1010201000000000000
2nd row

2111111200000111000
…

…
7th row

0000000000000001222
8th row

0000000000000001111
…

…
Row 19

0000000000000000000

Also, a value of 3 ¹⁸ can be assigned to the leftmost column, such as 3 ^{0 in} the rightmost column and 3 ^{1 in} the immediately left column, based on the rightmost column. It is also possible to give the value of 1, 2, and 0 to the black stone, the white stone and the space located at, respectively.

The result calculated by multiplying the power of 3 according to the column corresponding to the value of 0, 1 or 2 of the first row to the 19 constituting the reverse pattern of Table 1 is expressed in decimal notation as shown in Table 2 below.

First row

440564589
2nd row

968640147
…

…
7th row

53
8th row

40
…

…
Row 19

0

As described above, the coordinates expressed by the ternary method of the row number, the space of the row, the positions of the black stones and the white stones will be referred to as ternary coordinates.

In addition, as described above, in addition to the method of expressing the ternary coordinate in the display of the pattern, it is also possible to display the position of the black stone or the white stone in two-dimensional x and y coordinates based on a specific point of the half table. This will be described with reference to FIG. 2.

The black stone 10 of FIG. 2 is attached to the fire store of the upper right part of the board. If it is expressed in the above-described ternary number, it can be displayed in the fourth row, 27 (= 3 ³ ), as described above. It can also be expressed as (15,3) using the upper left ear as a reference point (0,0).

Hereinafter, in the present specification, the row in which the upper left and right ear of the representative upper half pattern exist is the first row, and the row number is increased by increasing in the direction in which the lower left and right lower ears exist. In addition, let the upper left ear be (0,0) which is a reference point of two-dimensional coordinates.

However, this is for the purpose of illustrating or illustrating the present invention and is not intended to limit the technical spirit of the present invention. In addition, a person having ordinary knowledge in the technical field to which the present invention belongs can easily express the column unit from the unit of the row as shown in the present invention, and the method of counting the number of rows is also easy. Modifications are possible. Furthermore, it is also possible to change the reference point of the two-dimensional coordinates to a reference point of one half and one half other.

First, we design a half-phase pattern database after the first landing, a half-phase pattern database after the second landing, ..., a half-phase pattern database after the 500th landing. It is also designed to have attributes for.

First, we design an on-board pattern after i-th move (obPi). The attributes and data types of the inverse pattern database formed by the i th number are shown in Table 3 below.

i-th point information

Game Results



Filename


Serial Number
lp1

lp2
…
lp19
Black victory record
A hundred victory record
Number

Number

…
Number

Number

Number

Char

Number

In Table 3, 1p1 to lp19 constituting the i < th > point information indicate each row of the checkerboard. Numbers lp1 to lp19 express and store the pattern of each line by the ternary method. The number value means a value sufficient to express the value represented by the ternary number as a decimal number. The victorious constituent of the game result is the number of times the black won in the pattern, and the defeat is the number of times the bag won in the pattern.

In addition, the file name is an original file name when a given pattern is registered for the first time, and the data type Char is a character string large enough to represent all file names.

The serial number is a unique value for one reverse pattern. The serial number indicates the number of times registered in this table. It is a unique integer value. Therefore, the serial number value cannot be a null value.

The reverse pattern database is sequentially formed as the number progresses. Namely, a half-pattern pattern database formed by the first chakjeom, a half-phase pattern database of the patterns formed by the second chakjeom,. It is constructed as a database for the pattern formed by the 500th chakjeom.

The pattern after the Nth landing and the pattern after the N + 1th landing have a relationship of "next number". The next number relation database from the first to the second number, the second to the third number, ..., the 499th to 500th numbers, for searching the next number of points for the inversion pattern formed by the current number. Design jnTk, join Table for k-th to (k + 1) th move). The attributes and data types of the following number relational database are shown in Table 4 below.

Serial number of the pattern formed by the last landing
Serial number of the pattern formed by the recent point of contact
Location Information
Game results when playing against a game with a pattern formed by a recent quest from a pattern formed by a previous quest



Filename



Game results when playing against a game in a pattern formed by recent arrival
x coordinate y coordinate
Black victory record
A hundred victory record

Win
Loss
Number

Number

Number

Number

Number

Number

Char

Number

Number

Each of the data types Number and Char constituting the tuple of the database is the same as the above-described antiphase pattern database.

Here, the serial number of the pattern formed by the last chakjeom represents the serial number value of a specific tuple in the halftone pattern database formed by the last chakjeom, and refers to the serial number value of the corresponding halftone pattern stored in the halftone pattern database formed by the last chakjeom. The serial number of the pattern formed by the recent chakjeom represents the serial number value of a specific tuple in the halftone pattern database formed by the recent chakjeom and is set to refer to the serial number value of the halftone pattern formed by the latest chakjeom.

The x coordinate and the y coordinate constituting the spot information represent the x and y coordinates of the spot in the most recent number of the halftone pattern database formed by the recent spot.

In addition, when the game progresses from the pattern formed by the last landing to the pattern formed by the recent landing, the game result indicates the result of winning or losing in the case where the game is played by the pattern formed by the recent number from the pattern formed by the last number. The game result when the match is played in the pattern formed by the chakjeom represents the result of winning or losing in the case where the match is played in the match pattern formed by the current number regardless of the half pattern formed by the last number.

The file name indicates the original file name when the tuple is registered for the first time, and the game result when the game is played in the pattern formed by the recent chakjeom indicates the win or loss when the game continues in the pattern formed by the latest chakjeom. .

Next, a method of suggesting the next number using the representative phase pattern database and the next number relation database will be described with reference to FIG. 2.
Go players form a reverse pattern based on the number of landings currently placed (S10).
Subsequently, it is searched whether the formed halftone pattern is stored in the halftone pattern database by the current number (S20). As a result of the search, if the formed halftone pattern is stored in the halftone pattern database according to the current number, a serial number of the found halftone pattern is obtained (S30). This is for retrieving the next number stored in the next number relation database using the serial number of the current half pattern when the next one is placed from the current half pattern.
Next, the serial number attribute of the pattern formed by the immediately preceding point of the next number relation database corresponding to the serial number of the reverse pattern formed by the retrieved current number is retrieved (S40).
At this time, the next number of landing information can be obtained from the tuple of the searched next number relation database, and furthermore, the information such as the victory of black and the victory of white when the match is played from the corresponding inversion pattern can be displayed. (S50)
Through this method, a method of proposing a third number in the situation where the black has the first number at the position 107 and the white has the second number at the position 108 is described in more detail.
First, a half-phase pattern by the point of contact up to the second number is formed.

Then, it is searched whether such a halftone pattern is stored in a halftone pattern database by a second number. At this time, assuming the result of 1 as the serial number value of the anti-pattern pattern, the next number of the second and third chakjeom that tells the pattern of the relationship between the database of the anti-pattern pattern formed by the second chakjeom and the next number Assume that the relational database is shown in Table 5.

delete

delete

delete

delete

delete

delete

Serial number of the reverse pattern formed by the last landing
Serial number of the anti-pattern pattern formed by recent defect
Location Information
Game results when playing against a game with a pattern formed by a recent quest from a pattern formed by a previous quest

Filename
Game results when playing against a game in a pattern formed by recent arrival x coordinate y coordinate Black victory record A hundred victory record Win Loss
One

One
16
15
16
25
H00b
16
25
One

5
15
16
11
17
H06B
11
17
One

23
15
15
2
2
M66w
2
2
…

4

4
15
16
18
20
H04b
20
20
4

28

14
2
0
One
M85w
0
One
4

27
2
14
0
One
M83w
0
One
…

In this case, it corresponds to a case where a pattern having a 1 as a serial number value of a half-phase pattern database formed by a second point is advanced to the next number.

In order to propose the next number, look at the next number relation database of Table 5, the half-pattern database serial number formed by the last chasm of the half-phase pattern formed by the last chakjeom is a series of patterns formed by the numbers that have been played so far. It can be seen that the number, and the half-pattern database serial number formed by the recent chakjeom formed by the recent chakjeom stored in the next number of chakjeom information of the game progressed from the current pattern and game results.

Therefore, the serial number of the pattern that has been performed up to the last two numbers is 1, and the case of the pattern having the 1, 5 or 23 as the reverse pattern database serial number formed by the next number is stored in the next number relationship database as the first to third tuples. have.

FIG. 3 shows the point information stored in each tuple storing a pattern having 1, 5, and 23 as the serial number.

In FIG. 3, the odds stored in the database when the black is placed at (16, 15) and 111, which are positions having the serial number 1 as the third number, are 16 / (16 + 15), and the position having the serial number 5 is ( 15, 16) (113), the odds are 11 / (11 + 17), and black stone at (15, 15) 112, the position having the serial number 23, shows that the odds are 2 / (2 + 2). Can be.

Through this, it is possible to propose the next number of landing positions to the knights in the game by displaying the winning percentage according to the landing positions. Furthermore, even if this database is applied to the game of Go game, it is possible to proceed with the game by finding the next number of points having the highest odds of winning the opponent.

Therefore, the next number stored in the database can be proposed through the recent number, the reverse pattern database, and the next number relation database. When a plurality of next numbers exist, it is also possible to propose the next number by displaying a win rate.

In addition, when the next number is proposed from the current number, the pattern formed by the next number of points suggested by the current run point indicates the winning rate according to the game result when the game is played, In the pattern formed by the game, the odds according to the game result can be displayed.

While the preferred embodiments of the present invention have been described so far, those skilled in the art may implement the present invention in a modified form without departing from the essential characteristics of the present invention. Therefore, the embodiments of the present invention described herein are to be considered in descriptive sense only and not for purposes of limitation, and the scope of the present invention is shown in the appended claims rather than the foregoing description, and all differences within the equivalent scope of the present invention Should be interpreted as being included in.

S01 to S03 show each step of the method for proposing the next number using the reverse pattern database and the next number relation database according to the present invention.
107, 108: Junction position of black stone and white stone in the state of placing to the second number.
111-113: The next number suggested using the reverse pattern database and the next number relationship database.

Claims (3)

Go game providing method of the Go game providing system comprising a first database for storing the information that the first player is the first landing point and a second database for storing information about the second landing that proceeded after the first landing as a tuple. To
A first step of the go game providing system searching whether a third landing point of a second player is stored in the first database;
A second step of, if the third landing point is stored in the first database, the game game providing system obtaining a serial number for the first landing point from the first database;
A third step of the go game providing system searching for a tuple having the serial number from the second database based on the serial number for the first chakjeom;
A fourth step of providing, by the go game, the searched tuple game system, the second landing point to the second player;
Go game providing method comprising a.
The method of claim 1,
If the third landing point is not stored in the first database, the Go game providing system further comprises waiting for a new landing point of the second player.
The method of claim 1,
In the fourth step, a game of Go game comprising the reading and displaying the black victory and the victory victory from the tuple.

Images