KR20150129265A - Method and server for providing artificial intelligence for baduk service - Google Patents

Method and server for providing artificial intelligence for baduk service Download PDF

Info

Publication number
KR20150129265A
KR20150129265A KR1020140055863A KR20140055863A KR20150129265A KR 20150129265 A KR20150129265 A KR 20150129265A KR 1020140055863 A KR1020140055863 A KR 1020140055863A KR 20140055863 A KR20140055863 A KR 20140055863A KR 20150129265 A KR20150129265 A KR 20150129265A
Authority
KR
South Korea
Prior art keywords
representative
computer
key
sequence coordinate
sequence
Prior art date
Application number
KR1020140055863A
Other languages
Korean (ko)
Inventor
정기철
홍광진
김진욱
강재원
Original Assignee
숭실대학교산학협력단
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 숭실대학교산학협력단 filed Critical 숭실대학교산학협력단
Priority to KR1020140055863A priority Critical patent/KR20150129265A/en
Publication of KR20150129265A publication Critical patent/KR20150129265A/en

Links

Images

Classifications

    • AHUMAN NECESSITIES
    • A63SPORTS; GAMES; AMUSEMENTS
    • A63FCARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F3/00Board games; Raffle games
    • A63F3/02Chess; Similar board games

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

A method and server for providing a service for gover service are provided. A server for providing a Go game service between a user and a computer according to the present invention comprises a representative key store storing unit for generating and storing representative key information for each spot using previously stored key data, And a point of interest selection unit for comparing the star representative notes to extract a representative note related to the spot information and selecting a starting point of the computer based on the extracted representative note, Generating a plurality of second notional sequence coordinates generated by transforming the first notional sequence coordinate values according to a preset reference, generating a first notional sequence coordinate value for at least one point in a predetermined region based on a specific point, Value is selected as the representative key.

Description

METHOD AND SERVER FOR PROVIDING ARTIFICIAL INTELLIGENCE FOR BADUK SERVICE [0002]

More particularly, the present invention relates to a method and server for providing artificial intelligence services for a game player, and more particularly, to a game server for analyzing gob data and providing a number corresponding to the game location, A method and a server for providing an artificial intelligence service.

As the technology develops, various board games including Baduk are gradually being converted from a traditional version and an egg to a large country through a computer or the Internet, and various kinds of games Go program has been widely developed and is actively being used by offline computer and online computer.

In addition, we have developed an artificial intelligence computer program, starting from a board game with little possibility of change, such as chess or organs, to an infinite number of possibilities of change, It became possible to become a great nation.

On the other hand, one of the good ways to increase the skill of the go is to play with a person with similar stamina or with a higher stamina, and with a lot of actual strength, but there are many constraints and difficulties .

Accordingly, there is provided a game service with a computer using a computer go program which allows the player to freely advance the game at any time without being conscious of the opponent.

However, the conventional service with the computer using the computer go program is focused on merely dividing the game by calculating the next number of positions corresponding to the current position when the user stones the current stone, There is a limitation in that the user can not provide the next number considering the educational effect by assuming the desired power.

In addition, if the user intentionally strikes a wrong spot at the beginning of the game, the player will have an erroneous countermeasures in response to the number, and eventually the progress direction of the game progresses according to the user's wrong intention.

SUMMARY OF THE INVENTION The present invention has been made to solve the problems of the prior art described above, and it is an object of the present invention to provide a virtual matchup with a big player having a power set by a user or a specific big player at the time of a match between a person and a computer.

Also, the user wants to present the statistical information based on the notional data while marking the current stone and displaying the next number corresponding to the corresponding spot.

Also, it is intended to provide a way to prevent the direction of the big country from proceeding according to the wrong intention of the user.

In order to achieve the above object, a server for providing a service between a user and a computer according to an exemplary embodiment of the present invention includes a representative key database for generating and storing representative key data for each location using previously stored key data, A storage unit for storing the current location information of the user and a current location information of the user and a representative point information of each point of the ground to extract a representative point information related to the point information, Wherein the representative key storage unit generates a first key sequence coordinate value for one or more key points contained in a predetermined area based on a specific key point of the key word data, One of a plurality of second non-known sequence coordinate values generated by converting according to the set reference, Characterized by selecting a table notation.

In one aspect of the present invention, the representative key storage unit considers the number of cases in which the first key sequence coordinate is changed by changing the direction of the checkered board, and the checkered board rotates 90 degrees, 180 degrees, 270 degrees And is symmetrically transformed with respect to the X-axis or the Y-axis, and rotated by 90 °, 180 °, or 270 ° so that the direction is changed.

In one aspect of the present invention, the representative-

Wherein the first key sequence coordinate is converted into the second key sequence coordinate by the number matched to the grid and the second key sequence coordinate value is combined with a specific value Wherein the index matched to the checkered board is selected from the group consisting of each of the horizontal and vertical lines of the checkered board, the horizontal axis and the vertical axis, the diagonal line connecting the corners of the checkered board, And is matched to each of the areas defined by the horizontal axis and the vertical axis and the diagonal line.

According to an aspect of the present invention, the current point of departure information may include a first sequence coordinate value for one or more points included in the predetermined area on the basis of the position of the user's rock on the current board, The movable position coordinates including the first sequence coordinate value and the direction of the checkerboard are rotated 90 degrees, 180 degrees, and 270 degrees for every possible position of the computer's stones, and are symmetrically transformed with respect to the X axis or Y axis 90 degrees, 180 degrees, and 270 degrees, thereby considering the number of cases in which the respective possible position coordinates are changed, and based on the index matched to the checkered board, Each of the plurality of possible position coordinates is converted into a second sequence coordinate value obtained by combining coordinate-converted second sequence coordinates of the type of the representative note and the second sequence coordinate value 2 < / RTI > sequence coordinate value.

Further, in one aspect of the present invention, the starting point selection unit may reflect the game setting conditions set by the user as weights in the extracted representative note, sort the results in a descending order, The location of the computer is extracted.

Further, in one aspect of the present invention, the game setting condition includes at least one of a game player's level, a player name, a victory game, and a home difference, and when the specific level is selected as the level of the game player, When a predetermined pro-knight is selected as the player name, the second sequence is selected as the starting point of the computer by selecting the number of hands most selected by the opponents of the selected level in a situation where the round is the same as the second sequence coordinate, And the number of hands selected by the selected pro article is selected as the starting point of the computer in a situation where a stones are formed in the same position as the coordinates.

According to an aspect of the present invention, the server further includes a coordinate conversion unit for converting the first sequence coordinate into a second sequence coordinate, wherein the coordinate conversion unit converts the coordinate value of the extracted computer position, 1 < / RTI > sequence coordinate value.

In order to achieve the above object, a server for providing a Baduk service between a user and a computer according to an embodiment of the present invention includes: (a) generating and storing a representative note for each location using previously stored non- And (b) comparing the current point of departure information of the user with the representative point-by-point information to extract the representative point information related to the point information, and selecting the point of origin of the computer based on the extracted point information Wherein the step (a) comprises the steps of: generating a first time series coordinate value for at least one base point included in a preset region based on a specific base point of the notable data; One of a plurality of second greencard sequence coordinate values generated by conversion according to a set reference is selected as the representative note .

In one aspect of the present invention, the current point of departure information includes a first sequence coordinate value for one or more points included in the predetermined area on the basis of a position where the first player appears on the checkered board, The possible position coordinates including the first sequence coordinate value and the direction of the checkerboard are rotated by 90, 180, and 270 degrees for every position where two players can stones, and are symmetrically transformed with respect to the X axis or Y axis 90 degrees, 180 degrees, and 270 degrees, thereby considering the number of cases in which the respective possible position coordinates are changed, and based on the index matched to the checkered board, A second sequence having a specific value among the results obtained by combining the second sequence coordinate values obtained by coordinate transformation of the type of the representative note and the second sequence coordinate values, It characterized in that it comprises one or more of the notation of data of a coordinate value.

In another aspect of the present invention, there is provided a method for providing a service for a ball game, the method comprising the steps of: (c) transmitting coordinates of a starting point of the selected computer to a terminal of the user, And displaying the stones of the computer on the ground.

According to one embodiment of the present invention, by providing a virtual matchup with a big player or a certain big player having a power set by a user at the time of a match between a person and a computer, an educational effect And can provide pleasure.

In addition, the user can present the stones and display the next number corresponding to the points of interest, and together with the statistical information based on the notarized data, it is possible to improve the user's stamina and help the analysis of the match.

In addition, it is possible that the player can progress according to the level of the user by preventing the direction of the big country from proceeding according to the wrong intention of the user.

It should be understood that the effects of the present invention are not limited to the above effects and include all effects that can be deduced from the detailed description of the present invention or the composition of the invention described in the claims.

FIG. 1 is a block diagram of a system for providing service for a bar service according to an embodiment of the present invention. Referring to FIG.
2 is a block diagram illustrating a configuration of a service server according to an embodiment of the present invention.
FIG. 3A and FIG. 3B are flowcharts illustrating a process of providing a Go service in accordance with an embodiment of the present invention.
4A to 4C are views illustrating a method of selecting a representative note according to an embodiment of the present invention.
FIG. 5 is a view showing a screen for playing a baduk game according to an embodiment of the present invention.
FIG. 6 is a view showing a screen for playing the Baduk game according to another embodiment of the present invention.
FIG. 7 is a view illustrating a screen for playing a baduk game according to another embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described with reference to the accompanying drawings. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein.

In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "indirectly connected" .

Also, when an element is referred to as "comprising ", it means that it can include other elements, not excluding other elements unless specifically stated otherwise.

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

FIG. 1 is a block diagram illustrating a system for providing artificial intelligence services for a game server according to an embodiment of the present invention. Referring to FIG.

The system 100 for providing service for go service according to an exemplary embodiment of the present invention may include a user terminal 110 and a service server 120.

The user terminal 110 may access the site of a Go banking service provided by the service server 120 (hereinafter referred to as a "Go banking site"), (Artificial intelligence), and when the application is accepted, the computer (hereinafter referred to as "virtual game player") and the game can proceed.

At this time, the user terminal 110 can select a virtual player through the site of the Go game. As a selection information for a virtual player, a plurality of level lists (for example, an amateur is 1 to 18 and 1 to 7, An interface including one or more of the first to seventh stages of the pros and a plurality of the pro-article lists (such as Chohun Hyeon, Lee Changho, Lee Sedol, etc.) can be displayed on the screen.

The user can select a level equal to his level when selecting a virtual player, or select a level higher than his or her level, or by selecting a specific pro article, It is possible to proceed with the game in accordance with the number of virtual players.

In addition, when displaying the number of counterparts of the virtual opponent, the user terminal 110 may receive the information according to the statistical analysis from the service server 120 and display it on the screen together.

Also, the user terminal 110 may include a mobile communication terminal including a smart phone, a mobile phone, a tablet computer, a PDA, a PMP, and a TV connected to a notebook computer, a desktop computer, and a set top box.

On the other hand, the service server 120 can provide a site for a go badger service, and can provide a service for the user terminal 110 connected to the go badger site to apply for and compete with the computer through the site.

At this time, the service server 120 may provide the game terminal 110 with an interface including at least one of a plurality of level lists and a plurality of lists of professional articles as selection information for a virtual player, which is a computer.

In addition, the service server 120 can provide the game terminal 110 with commentary information on the currently playing game as well as the current game situation.

Here, the explanatory information may include information on the present state of the great country, statistical analysis information on a comparative country similar to the current large country market, statistical analysis information on the number of correspondence of a virtual player, and the like.

In addition, the service server 120 may use the notation data, which is big-data, when extracting the next number of virtual players corresponding to the current base point of the user.

In this case, the Gobo data can be stored alternately for black stones and white stones, and can be stored alternately for the unique number of the gigoba (gibo), the generation date of the gibo, the generation time of the gibo, the identifier and level (grade) (Eg, draw, win, white win), win type (eg, scorecard, time win, winner), house difference, opponent method (eg, (For example, minutes), the number of checkers, the type of game (for example, rating game, goodwill), black usage time (for example, minute Unit), a bag usage time (for example, in minutes), and the like.

The service server 120 can select and store the representative note using the notation data.

As will be described later, the 'representative symbol' indicates a direction in which the board changes direction (for example, the direction of the board is rotated by 90 °, 180 °, 270 °, or a specific axis ), The number of all cases in which the corresponding coordinate value can be changed is taken into consideration, and when the notional data selected as the representative coordinate is considered It can mean.

When the user's stone lands at a specific position on the checker board, the service server 120 generates coordinates of the corresponding point location and converts the user's point coordinates into the representative point type coordinates for comparison with the representative point information.

Thereafter, the service server 120 searches all the notation data having the same coordinates as the point coordinates of the user converted into the representative note, extracts the first order candidate group, and determines the level of the player, the specific big name (big name) A second candidate group in which scores are given to respective pieces of notation data according to a cushion, a cushion, and a difference in house, and sorted in descending order can be extracted.

Thereafter, the service server 120 extracts the notation data of the top candidate from the second candidate group, selects a position where the virtual player will be moved, and places a stone of the virtual player at the corresponding position.

Here, the service server 120 can select the next number using the specific method of the specific article by using the notation data of a specific person, such as a professional article, and use the notation data of the big players having a certain level of skill to calculate the next number You can choose.

2 is a block diagram illustrating a configuration of a service server according to an embodiment of the present invention.

The service server 120 according to an exemplary embodiment of the present invention may include a representative note storing unit 121, a coordinate generating unit 122, a coordinate converting unit 123, and a landing location selecting unit 124.

The representative note storage unit 121 acquires coordinates of at least one base point existing in a preset area (for example, 9X9) based on the base point of the notified data, Thereby generating an aligned first non-known sequence coordinate.

The representative notation storage unit 121 expands the first-in first-out sequence coordinate value into a plurality of coordinate values in consideration of the number of all cases in which the first-in first-out sequence coordinate value can be changed when the direction of the checkered board is changed can do.

For example, if the direction of the checkerboard is rotated 90, 180, and 270 degrees or rotated symmetrically about 90 degrees, 180 degrees, and 270 degrees after symmetrical conversion to a specific axis (for example, Y axis) The key sequence sequence can be extended to a total of eight coordinates.

Then, the representative note storage unit 121 converts each of the eight first-order alphabet sequence coordinates extended to the eight first alphabet sequence coordinates using the index matched to the checkered board, and generates a value generated by a combination of the second non- (For example, a minimum value) among the plurality of pieces of information can be selected as representative pieces representing the number of all the cases.

For reference, the index may be matched to each of the horizontal and vertical lines of the board, the horizontal axis and the vertical axis, the diagonal line connecting the corners of the board, the horizontal axis and the vertical axis, and the diagonals.

On the other hand, when the user's stones hit the checkered board, the coordinate generating unit 122 obtains the coordinates of at least one base point existing in a preset area (for example, 8X8) And generate first sequence coordinates aligned in the order of the first sequence.

For example, the predetermined area (for example, 8X8) may be the same size as the area set when the representative key storage unit 121 generates the first Ki-sequence coordinate.

In addition, the coordinate generating unit 122 may generate the coordinates of the newly visited stone, and then store the notation data according to the corresponding point in the notional DB (not shown). In addition to the notation data about the user's starting point, It is also possible to store the notional data about the starting point of the virtual opponent.

On the other hand, the coordinate transformation unit 123 searches for a possible flooring position (a position where there is no stone depressed on the checkerboard) at which a stone of a virtual player can land on the checkered board, It is possible to generate the movable position coordinates including the coordinates and the first sequence coordinates.

After that, when the direction of the checkered board is changed as described above, the coordinate conversion unit 123 calculates each of the possible position coordinates in consideration of the number (8) of all cases in which each possible position coordinate can be changed It can be expanded to a plurality of (eight) coordinates.

Thereafter, the coordinate transforming unit 123 may convert each of the eighth possible positionable position coordinates into the second sequence coordinate, which is a coordinate of the representative notation type, by using the index matched to the checkered board.

Thereafter, the coordinate transforming unit 123 combines the respective second sequence coordinate values and determines the second sequence coordinate having a specific value (for example, a minimum value) among the combined result values as representative coordinates of each possible position .

For example, if the second sequence coordinate is (a4, p5, c1), the combined result of the second sequence coordinate value may be 451 extracted only from the second sequence coordinates a4, p5, c1 .

The coordinate transformation unit 123 can also convert the coordinates of the expected position of the virtual game player determined by the game location selection unit 124, which will be described later, into the form of the first sequence coordinate.

That is, since the first sequence coordinate is converted into the representative notation (for example, a4, p5, and c1), the second sequence coordinate is converted into the representative notation in order to be displayed on the screen of the actual user terminal 110 (For example, ik, in, kk), which is a coordinate before the first sequence coordinate.

On the other hand, the fiducial location selection unit 124 compares the second sequence coordinates, which represent each possible fiducial location, with the notation data, and assigns a score according to the number of matches.

For example, when all possible locations of virtual player stones retrieved after the user's stone's landing are all 30, the number (8) of all cases that can be expanded as the direction of the checkered board is changed, Considering the total number of 240.

The fiducial position selection unit 124 determines the second sequence coordinates (30 in total) representative of each possible fiducial position by the above-described method, compares the second sequence coordinate, which represents each fiducial position, with the notation data, The number of matches can be counted.

As a result, the first fountainable position-38, the second fountainable position-29, the third fartable position-75, ... , And the thirtieth groundable position -14, the landing position selection unit 124 may mount a stone of the virtual player at the third possible landing position where the highest matching number is shown.

At this time, the starting point selection unit 124 may assign weights based on the player's level, a specific player (player name), a winner, a winning system, a home difference, and the like, The coordinates of the flooring possible position located at the uppermost position after the alignment can be selected as the position where the stone of the virtual player will land.

For example, when the level '4' in the match setup condition is selected, the match point selection unit 124 selects the highest number of players selected in the same condition as the current user's stones, The position of the stone) can be selected as the optimum position where the stone of the virtual player will land.

When a specific person (for example, Lee Chang-ho) is selected in the match setting condition, the point-of-interest position selection section 124 selects the most prolific article in the same condition as the current user's stones (The position of the stone) can be selected as the optimum position where the stone of the virtual player will land.

This is for predicting which correspondence number is to be set by people of a certain level (grade) or a specific professional article under the same condition as the situation where the present user is stoned, through the notation data, It is possible to obtain the same effect as playing a game against the enemy.

FIG. 3A and FIG. 3B are flowcharts illustrating a process of providing a Go service in accordance with an embodiment of the present invention.

3A and 3B can be performed by the service server 120. Hereinafter, a description will be given of the flow charts of FIGS. 3A and 3B mainly made up of the service server 120. FIG.

First, the service server 120 selects and stores representative notifications for each location using the notation data of the not-shown DB (not shown) (S301).

At this time, the service server 120 generates the first notional sequence coordinates for each point of the noticed data, and considers the number of all cases in which the first notified sequence coordinate value can be changed when the direction of the checkered board is changed And then selects and stores the notional data in the case of having a specific value among the values generated by the combination of the second notional sequence coordinate values as the representative notarized information for each of the locations after converting the first notional sequence values into the second notional sequence coordinates, .

Thereafter, when the user's stones hit the specific position of the checkered board, the service server 120 generates the first sequence coordinates based on the corresponding point location (S302).

At this time, the service server 120 may use a region (for example, 9X9) having the same size as a predetermined region used for generating the first Gibson sequence coordinate as a predetermined region for generating the first sequence coordinate.

Thereafter, the service server 120 retrieves all of the available locations where the stones of the virtual player may land on the board (S303).

Here, the possible fiduciary position to be searched may include all positions where there is no stone depressed on the checkerboard.

After step S303, the service server 120 generates slotable position coordinates including the coordinates of the position and the first sequence coordinates, for the first dotable position among the n dotable positions found in step S303 (S304).

For example, if the first sequence coordinate is (a, b, c) and the coordinate of the first possible position is f, then the possible position coordinates generated in S304 will be (a, b, c, f) .

For convenience of explanation, each coordinate is represented by a, b, c, and f, and each coordinate can be expressed in two-dimensional coordinates according to an index matched to the checkerboard.

After step S304, the service server 120 determines whether or not the first possible position coordinates can be changed when the direction of the checkered board is changed, by considering the number of all cases (eight) (S305).

After step S305, the service server 120 converts the eight coordinates into a second sequence coordinate, which is a coordinate of the representative notation type, and obtains a specific value (for example, a minimum value) among the combination results of the second sequence coordinate values The second sequence coordinate is determined as representative coordinates of the first possible position (S306).

After step S306, the service server 120 repeats steps S304 to S306 from the second possible position to the n-th possible landing position to determine the representative coordinates of each possible position of the ground (S307).

After step S307, the service server 120 compares the second sequence coordinates, which represent each possible position, with the notation data and extracts all the notation data having the same coordinates (S308).

At this time, the service server 120 can assign a score according to the same number of coordinates.

After step S308, the service server 120 assigns weights to the notation data extracted at S308 based on the level of the opponent, the player name, the winner, the victory method, the difference in the house, etc. and sorts them in descending order according to the score, The notional data, that is, the notional data of the k-th flooring possible position is extracted (S309).

After step S309, the service server 120 selects the k landing possible position extracted in step S309 as a position where the virtual player will land on the spot (S310).

After S310, the service server 120 provides the coordinates of the k-landing possible position determined in S310 to the user terminal 110 (S311).

4A to 4C are views illustrating a method of selecting a representative note according to an embodiment of the present invention.

The notional data according to an embodiment of the present invention can indicate the position of each hand by using an index displayed on the checkered board and the checkered board.

As shown in FIG. 4A, the index includes a center 410 of the checkerboard, vertical lines 421 and 422, horizontal and vertical axes 431 and 432, diagonal lines 441 and 442 connecting the corners of the checkerboard ), And may be matched to each of the regions 450 separated by the horizontal axis, the vertical axis, and the diagonal line.

In FIG. 4A, as an example of the index, a combination of alphabet and alphabet + number is used. However, any index that can represent a sequence of numbers, Korean consonants, Greek letters, and combinations thereof can be used as an index of the present invention.

Figs. 4B and 4C show the number of all cases in which the first sequence coordinate (or the first non-sequence coordinate) can be changed when the direction of the checkered board is changed.

FIG. 4B shows a case in which the checkerboard is rotated 90 degrees, 180 degrees and 270 degrees, FIG. 4C shows a case in which the checkerboards are rotated symmetrically about a specific axis (for example, .

As shown in FIGS. 4B and 4C, one first sequence coordinate (or first KI sequence sequencer) can be extended to eight coordinates (notation data).

The representative note storage unit 121 can select one of the extended note data as 'representative note', and the representative note selection method is as follows.

For example, when there are the first-in-first-out sequence coordinates laid out in the order of (ik, in, kk) in FIG. 4A, the second notional sequence coordinates generated using the index matching the checkerboard are (a4, p5, c1) , And the combination of the second notional sequence coordinate values (extraction of only numbers) is 451.

In the same manner, the representative note storage unit 121 extracts numbers from a combination of the second known gene sequence coordinate values for the remaining seven coordinates out of the eight extended coordinates as shown in FIG. 4B, The notional data of the second notional sequence coordinate can be selected as the representative note.

In this way, for the sequence coordinates generated on the basis of a specific base point, the representative notation data for the number of all cases in which the coordinate value can be changed when the direction of the checkerboard is different, that is, Thereby reducing the storage capacity of the notable data and reducing the number of times the data is compared.

FIG. 5 is a view showing a screen for playing a baduk game according to an embodiment of the present invention.

5 is a game screen 500 displayed on the user terminal 110 connected to the game site provided by the service server 120. The game area 510 is displayed on the left side of the screen and the comment area 520 is displayed on the right side of the screen. Respectively.

The large region 510 includes tapes for displaying detailed information such as a region 511 for a game corresponding to the level of a computer, that is, a virtual opponent, a large region 512 with a pro article, a model view 513, And the comment field 520 may include information such as game name, level (grade / number), total score, winning percentage, relative total, number of progress turns, progress time, , And a competitive game analysis information 522 that displays statistical analysis information on a competitor similar to a current competitor who is currently in a competitor's league at the time of a competitor's progress.

FIG. 5 shows a case where the tab of the area 511 for the competitive game according to the level is selected in the competitive region 510, and the service server 120 can display the interface 530 for selecting the match setting condition.

If the 4th level is selected, the service server 120 may display 540 the number of the most popular players selected by the players having the 4th level ability as the number of the virtual competitors in the same situation as the present user's base have.

At this time, statistical analysis information on the corresponding number (for example, a message such as "the number of persons selected from the total number of the 4th ranked foreign nationals ", etc.) may be displayed together.

FIG. 6 is a view illustrating a screen for playing a baduk game according to another embodiment of the present invention.

6 is a game screen 500 displayed on the user terminal 110 connected to the server site of the Go game provided by the service server 120. In the game area 510 shown in FIG. 5, ) Tab is selected.

As shown in FIG. 6, the service server 120 may display an interface 610 for selecting a specific pro article.

If a specific pro article is selected on the interface 610, the service server 120 selects 620 the number of virtual prospectors selected by the pro-article in the same situation as the present user, .

FIG. 7 is a view illustrating a screen for playing a baduk game according to another embodiment of the present invention.

7 is a game screen 500 displayed on the user terminal 110 connected to the server site of the Go game provided by the service server 120. In the game screen 500 shown in FIG. 5, the tab view 513 tab is selected .

When the model view 513 tab is selected, the service server 120 can display the influences and the number of the stones placed on the checkerboard as shown in FIGS. 7 (a) and 7 (b).

7 (a) and 7 (b), an interface 710 for selecting influence or collection is displayed. Through the interface, the viewer can check the influence of the stone placed on the checkerboard Information can be confirmed.

It will be understood by those skilled in the art that the foregoing description of the present invention is for illustrative purposes only and that those of ordinary skill in the art can readily understand that various changes and modifications may be made without departing from the spirit or essential characteristics of the present invention. will be.

It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive.

For example, each component described as a single entity may be distributed and implemented, and components described as being distributed may also be implemented in a combined form.

The scope of the present invention is defined by the appended claims, and all changes or modifications derived from the meaning and scope of the claims and their equivalents should be construed as being included within the scope of the present invention.

100: Go bad system
110: User terminal
120: service server
121:
122: Coordinate generator
123:
124:

Claims (10)

1. A server for providing a governing service between a user and a computer,
A representative key storage unit for generating and storing representative key data for each location using previously stored key data; And
A base station position selection unit which compares the current base station user's base station information with the representative base station information to extract representative information related to the base station information and selects a base station location of the computer based on the extracted base station information,
, ≪ / RTI &
The representative key storage unit generates a first key sequence coordinate value for one or more key points included in a predetermined area based on a specific key point of the key word data and converts the first key sequence coordinate value according to a preset reference And selects one of the plurality of generated second greedy sequence coordinate values as the representative key.
The method according to claim 1,
The representative-
The grid board is rotated at 90 degrees, 180 degrees, and 270 degrees, and the number of cases where the first greedy sequence coordinates are changed by changing the direction of the checkered board is considered, 90 °, 180 °, and 270 ° so that the direction changes.
3. The method of claim 2,
The representative-
Wherein the first key sequence coordinate is converted into the second key sequence coordinate by the number matched to the grid and the second key sequence coordinate value is combined with a specific value And the second key sequence coordinate value having the second key sequence coordinate value as the representative key,
The index matched to the checkerboard is,
Wherein the server is matched to each of the horizontal and vertical lines, the horizontal axis and the vertical axis, the diagonal line connecting the corners of the checkerboard, the horizontal axis and the vertical axis, and the diagonals.
The method according to claim 1,
The current location information may include,
A first sequence coordinate value for one or more ground points included in the predetermined area based on a position of the user's stones on the current grid,
Wherein the controller is further configured to determine, at each of the positions where the computer is capable of staking,
The direction of the checkerboard is rotated by 90 °, 180 °, and 270 °, and the coordinates are changed symmetrically with respect to the X-axis or the Y-axis and then rotated by 90 °, 180 °, and 270 °, And a second sequence coordinate obtained by coordinate-transforming each of the plurality of possible position coordinates with respect to the number of the cases in the form of the representative note based on the index matched to the checkered board,
And notation data of a second sequence coordinate value having a specific value among the results obtained by combining the second sequence coordinate values.
5. The method of claim 4,
Wherein,
The computer-readable storage medium storing a computer-readable program for causing a computer to execute a computer-readable storage medium storing a computer-readable program for causing a computer to function as: The server.
6. The method of claim 5,
The match setup condition includes at least one of a level of a player, a player name, a victory method, and a home difference,
Wherein,
When a specific level is selected as the level of the opponent, in a situation where the ball is struck in the same manner as the second sequence coordinate, the player selects the most number of hands selected by the opponents of the selected level as the starting point of the computer,
Wherein when a specific pro article is selected as the player name, the server selects a number of hands most selected by the selected pro knight as a starting point of the computer in a situation where the round is the same as the second sequence coordinate. .
6. The method of claim 5,
A coordinate conversion unit for converting the first sequence coordinate into a second sequence coordinate,
Further comprising:
Wherein the coordinate conversion unit comprises:
And converts the coordinate value of the extracted computer location of the computer into the form of the first sequence coordinate value.
1. A server for providing a governing service between a user and a computer,
(a) generating and storing a representative note for each point using previously stored note data; And
(b) comparing the current location information of the user with the representative key information of each location, extracting the representative key information related to the location information, and selecting the location of the computer based on the extracted key information
, ≪ / RTI &
Wherein the step (a) comprises: generating a first non-consecutive sequence coordinate value for one or more points in a predetermined area based on a specific point of the non-correspondence data, converting the first non- And selecting one of the plurality of second greedy sequence coordinate values generated by the first greedy sequence coordinate value as the representative greeting.
9. The method of claim 8,
The current location information may include,
A first sequence coordinate value for one or more ground points contained in the predetermined area based on a position where the first player has struck the current grid,
A movable position coordinate including the first sequence coordinate value for every possible position of a stone of a second player in the checkered board,
The direction of the checkerboard is rotated by 90 °, 180 °, and 270 °, and the coordinates are changed symmetrically with respect to the X-axis or the Y-axis and then rotated by 90 °, 180 °, and 270 °, And a second sequence coordinate obtained by coordinate-transforming each of the plurality of possible position coordinates with respect to the number of the cases in the form of the representative note based on the index matched to the checkered board,
And the second sequence coordinate value having a specific value among the results obtained by combining the second sequence coordinate values.
9. The method of claim 8,
(c) transmitting the coordinate of the starting point of the selected computer to the terminal of the user
Further comprising:
Wherein the user terminal displays a landmark of the computer on the coordinates of the computer location of the computer.
KR1020140055863A 2014-05-09 2014-05-09 Method and server for providing artificial intelligence for baduk service KR20150129265A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020140055863A KR20150129265A (en) 2014-05-09 2014-05-09 Method and server for providing artificial intelligence for baduk service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020140055863A KR20150129265A (en) 2014-05-09 2014-05-09 Method and server for providing artificial intelligence for baduk service

Publications (1)

Publication Number Publication Date
KR20150129265A true KR20150129265A (en) 2015-11-19

Family

ID=54843421

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020140055863A KR20150129265A (en) 2014-05-09 2014-05-09 Method and server for providing artificial intelligence for baduk service

Country Status (1)

Country Link
KR (1) KR20150129265A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017142492A1 (en) * 2016-02-20 2017-08-24 Kilic Umit A strategy game
KR20210008757A (en) 2019-07-15 2021-01-25 엔에이치엔 주식회사 Method and device for baduk game service based on deep-learning
KR20210008752A (en) 2019-07-15 2021-01-25 엔에이치엔 주식회사 Method and device that providing deep-running-based baduk game service
KR20210008759A (en) 2019-07-15 2021-01-25 엔에이치엔 주식회사 Method and device for providing deep-running-based baduk game service
KR20210009588A (en) 2019-07-17 2021-01-27 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof
KR20210009586A (en) 2019-07-17 2021-01-27 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof
KR20210016749A (en) 2019-08-05 2021-02-17 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof
KR20210016750A (en) 2019-08-05 2021-02-17 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017142492A1 (en) * 2016-02-20 2017-08-24 Kilic Umit A strategy game
KR20210008757A (en) 2019-07-15 2021-01-25 엔에이치엔 주식회사 Method and device for baduk game service based on deep-learning
KR20210008752A (en) 2019-07-15 2021-01-25 엔에이치엔 주식회사 Method and device that providing deep-running-based baduk game service
KR20210008759A (en) 2019-07-15 2021-01-25 엔에이치엔 주식회사 Method and device for providing deep-running-based baduk game service
KR20210009588A (en) 2019-07-17 2021-01-27 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof
KR20210009586A (en) 2019-07-17 2021-01-27 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof
KR20210016749A (en) 2019-08-05 2021-02-17 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof
KR20210016750A (en) 2019-08-05 2021-02-17 엔에이치엔 주식회사 Deep-learning based baduk game service method and apparatus thereof

Similar Documents

Publication Publication Date Title
KR20150129265A (en) Method and server for providing artificial intelligence for baduk service
KR101518653B1 (en) Game device, recording medium, game management device and game system
US20110049807A1 (en) Methods and apparatus for an interactive word game of skill
US9795869B2 (en) Geometrical shape apparatus
JP2001314656A (en) Game apparatus and game system
JP6547036B1 (en) Game program, method, and information processing apparatus
US10220299B2 (en) Training systems and methods
JP6547037B1 (en) Game program, method, and information processing apparatus
KR20130121767A (en) Number puzzle game and program
KR20170049096A (en) A board game set of development of cognitive ability for children and game method thereof
KR101585875B1 (en) Method and server for providing baduk broadcasting service
KR20080006065A (en) On-line sudoku game system and method
US20140265128A1 (en) Method of playing a word card game using alphabet cards
Bukhori et al. Using Genetic Algorithm to Solve Puzzle Games: A Review
US20120112410A1 (en) Method and apparatus for playing a game
KR102607045B1 (en) Board game tools for arithmetic game using octagon-shaped arithmetic symbol
McLeod Religion, Politics and Sport in Western Europe, c. 1870–1939
US10325216B2 (en) System and method that facilitates a decision making process
KR102494173B1 (en) Method for puzzle game using symmetry puzzle and apparatus for performing the method
US20220401822A1 (en) Plot Compass For Creating Gameboards and Moving Pieces
CN102772889A (en) Game card imitating survival adventure game and operation method thereof
JP3125143U (en) Card game equipment
Malizia et al. TAPASPlay: a Tangible Game-Based Learning Approach to Foster Computational Thinking Skills
KR20240010159A (en) The fall prevention and hold variable type indoor rock climbing device
CN104318811A (en) Method and apparatus combining gobang with English word spelling

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E601 Decision to refuse application