TW400506B - A method of executing black-white chess in computer - Google Patents

Abstract

This is a method of executing the black-white chess on computers that can dynamically determine a strength degree of the piece-able points on the chessboard according to the importance of the points, and can instruct the computer to play the chess according to strength degree and related reference conditions. According to the technique of the invention, as the computer is in playing against the user, it determines the most preferable settling point for itself according to the strength of the piece-able points for settling pieces and the relevant factors about the eating pieces and piece-able points' losing degree. Then, playing technique of the computer is significantly improved such that the interesting and entertainment characteristics of the chess game are enhanced.

Description

V. Description of the invention (1) [Scope of application of the invention The present invention relates to a method of playing a game of white chess in Rai Bie, a game on both sides of the game, especially *. In the advanced computer Othello game, guide the electricity; [Invented related technology] Use the computer to build one of the two sides of an Othello game and use Du Tu ^ nuclear brother and computer as a tour guide. Just like ordinary Li Bai ^ Yi Yi's technology, has long been familiar with white chess and computer;;: color swim, hidden) = remaining points on the board (not yet: the sub-brain will be: chess in the chess; The rules for placing chess pieces are toward the chessboard :; place another chess piece of the same color 2: square right soil m :: search for feasible check points (that is, valid check points); regardless of the check point, the check points must be played Falling on feasibility and straightness: whichever, Luo's pieces must be at least one of the above = already; = there must be no interval between t (the other-colored piece) t 'and the opponent's chess; j, a ^ moon dagger ^ ^, And the chess piece held by the computer is set at a feasible point together. In this way, the Othello Double L Shi ί Ϊ to the place where no pieces are placed on both sides, the game is: ,,,. The number of white and white is 多 C: \ ProgramFiles \ Patent \ p-0218tw_ptd Page 4 V. Description of the Invention (2) It is said that although the game of Othello played by the brain has also been established to determine the order of the computer side Priority list and analyze some of the main situations that will occur during the game of chess' Make a response corresponding to the player ’s falling, but I ’m not good enough in judging the dispute of the corners of the board, so the game is not difficult, and the playability and entertainment are not good. [Objective and Summary of the Invention] The main purpose of this month is to Provide a method that can dynamically determine the potential energy level of the chess points according to the importance of all the remaining chess points in the process of Yiqi, as a basis for the computer to set the ball. According to the invention, Lu Zhi Technology, in which the method for determining the potential energy level of a chess point can be implemented by a computer performing the following steps, which at least include: 1. Determine the potential energy among all remaining chess points within the range of ^ full ^ checkerboard The group with the highest level and the group with the lowest potential level; and 2 according to κ from Α as small as-the largest even squared range (initial range 2 * 2 ^ is the decision range that determines the potential energy levels of the remaining chess points)孰 Continue to determine in each of the decision points the group with the second potential = lower level, and another group with a lower potential energy level. Another object of the present invention is to provide „to Xi-Secret Recognition of Ren * * Kind of moon b is dynamic enough to determine the potential energy level and position of the chess points based on the current remaining, ν «^ # 田田 ^ ^ conditions determine the best chess of the computer

C: \ Program Files \ Patent \ p-0218tw. Ptd Page 5 5. Description of the invention (3) According to the method disclosed by the present invention, the computer selects the best move among the many feasible moves that meet the conditions of the move. In the position, the _ potential energy level of the feasible checkpoints is used as the reference condition, and the number of eaters (the number of naked moves) caused by the feasible checkpoints is the second reference condition. If the conditions of two or more feasible checkpoints are the same, A random point is selected as the computer chess position. The detailed technical content and embodiments of the present invention are described below in conjunction with the drawings: [Schematic description] Figure 1 is a flowchart of the game of the present invention. Figure 2 is the processing flow for searching for possible chess points on both sides of the game. Figure 3 shows the processing flow for the computer to select feasible moves, showing the processing flow for the computer to determine the best position of the moves among the feasible moves. Fig. 4 is a processing flow for determining the potential energy level in the remaining chess points of the present invention. Fig. 5 shows the method of determining the potential energy level according to the present invention, and determines the position of the person with the highest potential energy level in the entire chessboard range. Fig. 6 is a method for determining the potential energy level according to the present invention, and determines the position of the thickest potential energy level in the entire chessboard range. Fig. 7 shows the position of the person with the highest potential energy level in the determination range of the smallest even-numbered square range. Fig. 8 is an initial allocation table of potential energy levels of the chess points determined according to the method of the present invention, in which the values of the potential energy levels of the chess points in the entire chessboard range are disclosed. Figure 9 shows the dynamic determination of the potential energy level in the course of chess

C: \ ProgramFiles \ Patent \ p-0218tw.ptd Page 6 V. Description of the invention (4) — a kind of picture 10, another picture 11 of the system, and a picture 12 to the complete picture 7 2 The diagram is [Details of the invention] [Computer hardware of the present invention The computer hardware of the invention can be used in a central place in the process of the game visualization of the game and the game of Othello is a display unit 30 board, chess pieces] For the position of the chess player, the joystick, and the light, please refer to "The execution process, examples. This is an example of the present invention. This is an example of the present invention. Explanation] The material for real-world access is disclosed, including the interface (relative credit unit games, and other 40 yuan), and the pen or figure 1 includes black and white chess' and the recording medium includes: Chessboard interest; (CPU) and relevant information can be used to lose other functions, including: During the chess process, the potential energy level is dynamically determined. During the chess game, the potential energy level is dynamically determined. Exposing the game Functional block diagram of brain hardware. The game 'is shown in Figure 72—the computer includes: Body 10' which stores the instruction set for executing Othello, graphic data for displaying graphics or chess pieces), and game 20 The corresponding instructions are executed by executing the foregoing instructions; visualized graphical game interfaces (such as chess information); and the player's operation of the game (for example, the pointing unit 40 may be a device such as a keyboard and sliding energy). Invention of black and white 褀 game on computer

V. Explanation of the invention (5) A · Initialize the game household. B · Display the game interface element 30; (such as chessboard, chess pieces and other graphics C. Obtain the player's place, and display the list D. Determine whether the player is playing chess position 5 '· Step, if no, g # game? If yes, then perform E · Judgment Player selection :: bundle game; Order the next time to step C,' then proceed to next-step, 4; of: : F. The corresponding player's steps will also be saved, :::: change the contents of chess !, here 10, and the display volume: Gan. The relevant information is recorded in the recording medium. The relevant caution of Tianqian chess + Person], Wenchao style (for example, the chess pieces owned by the two sides of the game shake on the display unit's 30-board position); and the chess pieces of the two sides are in chess G. Judging the computer side of a county π Jr.> Go down-steps, if A: Second line chess If 'Yes', then go to U 丄. If not, go to step T. Go forward. Choose from the current feasible checkpoints-the best feasible checkpoint, and then return to step C; 下 checkpoint 1 · Judgment If the player has feasible checkpoints, go to the next step. If yes, go back to step c. If no, go to J ::: Ϊ 双The total number of square pieces, and judge the winner is that side, and the result of the judgment is displayed in the display unit 30, = from that to step A. ",, Let's go back to the previous steps E, GM, J to search whether the two sides of the game exist. filial

Η C: \ ProgramFiles \ Patent \ p-0218tw.ptd page 8 5. Description of the invention

Of the 4 g-squares of 4 possible check points, borrowing I 'is the remainder of the current chessboard, which includes: the electric system performs the steps shown in "Figure 2" to complete 1. Initialization— The handle λ ▲ variable value is used to substitute * zhi variable as false (fa 1 se); [the so-called flag variable value is false, then table _, whether a certain line is a valid line, if it is concerned); otherwise , = This line of chess points is invalid (at the current stage of chess points, of course, f is a variable value is true, it means that this line of chess points is effective change and change at any time ^-the effectiveness of the line of chess will be It will search to the left with the current game point indicated by I] — * in the game contents. [Get the player ’s use line and point in this step. For the player ’s side, It can be obtained by clicking on the position indicated on the board at 71:40 on the computer's side; click on the point.] ° 'Then 疋 in the remaining lines that have not been occupied by the pieces yet. 3 · Judgment | & If it meets the conditions of chess? If yes, then proceed to the next step called step 8 to match the chess; According to the rules of Othello's chess rules, set it as the center, and move towards :: pieces, especially on the position of the player who wants to drop (such as white chess), lower right, etc. ::: the top of the heart: the next two ~, the upper left, The white chess to be dropped on the lower left and right is searched to see if there are any pieces of the same color, and the white chess that is to be played must be jealous of the right gate dazzling with the white Qi found by the above search. The blacks between the chesses should not be separated from each other, so at this time, the white chess is a feasible check point for this chess condition.] The position is consistent with the order. 4. Set the aforementioned flag variable to true; [represents at least in

C: \ Prograra Files \ Patent \ p-〇218tw. Ptd Page 9 5 Description of the invention (7) In the search direction of the current chess point to the left, you can 7 5. Judging the current related parameters are, and conditions] = Then proceed to the next step. If not, skip to the right. In the step, if the party playing chess is electricity, [here — the chess points are made first-simulation 'is recorded in each row of f: It can be used as the reference data when the total number of chess pieces and the number of chess pieces of both sides are two. 】 7 chess pieces to decide the best computer chess

6. Change A8 on a simulated board; change the contents of the chessboard, then skip to step 7. Change the skill on the actual board. 8. Search in the other seven directions | Afterwards, the rest will continue The seven searches of 疋 are one square step earlier to determine whether there are ° 2 searches in other directions in order to advance a corresponding labeling variable. ] 0 仃 'condition' and change 9. Determine whether the flag variable is true? β step, if not, skip to step 丨 丨;, if 疋, go to the next step 10. Count and record the chess of both sides of the game 11. Count and record the game cheattainer 2 7 f, medium; and The number of chess pieces k is a temporary variable, 1 2. Return and record the corresponding parameter value. In the "picture 2", search for # Whether the two game parties = course I points. In addition to 1 to search for available chess points on both sides of the game according to the game rules of Othello, the other function is to first check each feasible game. point

V. Description of the invention (8) After the game is completed, the whole chess and the moon are spelled, and the two sides are determined to be in a certain two; The chess is recorded first, so that the record in the search can be changed quickly and correspondingly :; At the beginning of the Othello game, remember the media ln ^ valley. For example, at the beginning of the order of the parameters of phonetics, &. ± 4 media will have a number of parameters representing different meanings, such as. Represents the current A ", and Whether to determine whether the parameter to which the current date is based is 10,000 is to search for "parameter B" of the two parties in the game. Also = In the process of having feasible checkpoints, for different: two (player or computer) will have different corresponding events to play, 棋 Ϊ Ϊ :: ί: During the checkpoint process, all The computer can; = = Pre-record, the content of the record is as follows: the f record data at the feasible checkpoints can be used in conjunction with the potential energy level of the feasible checkpoints in the execution of the aforementioned "number! Chart" number, as the computer decision field, ^ comer data So & ', take the reference of the good move check point 枓, so when executing the "Figure 2" ...-the check point is a feasible check point (that is, in line with the checkerboard, will:: pseudo board Change the game, and record the reference data on the simulation board to determine the best point to play; At first glance, the process of finding a feasible game point for the player, then the remaining game points are effective. Only if ^ = there is 40 yuan left to move the cursor on the board to reach a certain line of points, whether H uses a round to check whether the line matches the conditions of the line, if it is, then it will predict: it will depend on this — feasible chess Click on the result after setting the sub, and set the flag variable to 屺 2 here — which is determined in After this feasible checker is set, the only person who can play: f game you have C: \ Program Files \ Patent \ p-〇218tw. Ptd page 11 5. Description of the invention (9) Corresponding changes; Conversely, if g: the player who plays the condition) 1 will not respond to the checkpoint (. The Luozi decision made is about any of the steps in "Figure 1: checkpoint" which also includes "♦: used for Determining the best of a computer is. ”All the steps include H1. Initialize a simulated chessboard, include an initial allocation table for the level, .Peng—Xingqi point potential # group; ; Search ί = 判断 All remaining moves (not yet ") are judged and recorded before the previous moves do not occupy the players Η3. Backup the content of the game before playing, choose the method selection-the best f and according to the best move 4 · Judging the best move point here, 'a If yes, then proceed to the next +, 疋 Will I lose corners? ΙΠ; and step, if no', skip to step H5 · Determine if all Feasibility is, then proceed to the next step, the sentence will lose the corner? If it is H6. Chess ::: Return to step H3; H7. At the selected best move point, the move is the best move point; and according to the technology disclosed in the present invention, the initial allocation table is executed by the computer "Figure 4" of the potential energy level) It includes the following steps: (see the information; click on the relevant _ MC C: \ Prograra Files \ Patent \ p-〇218tw. Ptd Description of the Invention (10) 1 · Determine the group with the highest potential energy level and the group with the lowest potential energy level among all the checkpoints in the entire chessboard range; 2 · From the smallest to the largest even square range (initially Except for “Range 2”) In order to determine the potential energy levels of the remaining moves, continue to determine a group with a lower potential energy level and another relatively higher potential energy level in each of the determined points. And 3. Record the initial allocation table of the potential energy level values of all the checkpoints to the potential energy special level of a checkpoint. The so-called decision range is based on a single chess point as the minimum unit of the calculation range, and the center of the decision board is the center point of the decision range. Within each decision range, a better method disclosed in accordance with the present invention is disclosed. , Only one group with a lower potential energy level and another group with a higher potential energy level = higher are determined. # Regarding the roots mentioned in the chess, the player with the lowest rank with the whole chess set will be able to wait regardless of the cooperation on the points below. The steps shown in the "drop in 1 Figure 4" example : According to the game rules of Othello, when the game is over, the total number of pieces on the game board is the win; therefore, once the move is set, the player who will never lose the higher point will play the same way. After the game, you may lose potential moves. The level of potential energy is the lowest, as in "the range of the fifth chart. For example, the coordinates at the coordinates A1, A8, and H1 (referred to as corner points) belong to the play with the highest potential energy level. When opponents play chess from any position, they cannot eat the pieces.

V. Description of the invention αι) Relative to the corner point with the highest potential energy level "Before the corner point occupies the chess piece, the adjacent one = the two with the lowest potential energy level, as shown in" Figure 6 "; Potential energy levels β7, β8, G1, G2, G7, with Η2 = points? , Α7 ,,, The corner point with the highest potential energy level compared to the wide reward Ri®. And §, is the so-called potential energy dress, 帛 5 picture ". Click on the lowest line of this grade, please refer to" Figure 7 ", which is A $ ^ & Within the chess-like range (except the initial range 2 * 2):… in terms of the smallest decision concept, then the potential energy level decision point within the minimum decision range should be C3 'C6' F3, and the rest ^ potential energy The player with the highest rank, so, according to the above potential energy = puppet, is it relatively low? In the chart: the area occupied by the subs is one by one, and the starting position of the potential energy level that is not shown in the eighth picture of the game is initially assigned to the class. F is obtained as the smaller word (the number "" _ _ _ " "Figure 8", the larger the number (the number " 7Τ in the figure: the higher the potential energy level, the lower the horsepower). The more the potential energy level-the conditions listed in the initial allocation table of potential energy levels are determined , The conditions of which are the potential value of the potential month b, still according to 1. In each decision range determined between the potential energy in the entire chessboard 箄 Bi County ancient soil office fine potential this # -level value, is 2. Fang / and Between the lowest potential energy levels. One, there are only two different potential energy levels within the relative ^ / range, the value is relatively south, and the other is relatively low. 3. In any two adjacent decision ranges, Which has a smaller decision range

1H C: \ Program Files \ Patent \ p-〇218tw. Ptd Page 14 V. Description of the invention (12) _ • The potential value of the special edge is weaker than the value of the larger decision range and less weight value; (that is, 4 * 4 Any one of the determination range of potential range ^ Potential energy and others: but the lowest potential energy level value of the entire chessboard " 7 " Divided by two =, the potential energy level of each feasible chess point is not the beginning.) It may change as the game progresses. Therefore, the present invention has the following features: • Development of the game, • At any time, the dynamic potential energy level of the initial potential energy level HI and the order points of the chess position are made into a dynamic knife match table. The potential energy of points is equal, and specifically, based on the dynamic adjustment of the initial allocation table of the remaining levels, it is quite possible to increase the current remaining points of the game by the potential energy of the two points and so on. Example # "The level of the potential moon dagger. The line with the highest potential energy level in the board = 9 maps", once the whole olive) occupied, then black and ;; of a-* (such as black, both It ca n’t be eaten anymore, so the right side is black at A2 and B1. The invention will dynamically increase the corner points that will be lost again.) By the same token, Bian's Chess Player 2 is equivalent to a non-dynamic adjustment. / His examples of the same situation are also the same and another situation For example, when "the first point is occupied by the player, then this country" does not. When a certain corner of the board becomes very low, but if the entire edge to which the $ point belongs, its potential energy is equal, because If a chess piece occupies a corner that is lost in the situation shown in "Figure 10", then the computer-playing chess point B1 is also equivalent to a non-ranking point, which is the same as the decision range. The potential energy of the chess point B1 is equal to the door, the same reason, other examples of the same situation

1H

C: \ Program Files \ Patent \ p-〇2i8tw. Ptd page 15 _ 5. Description of the invention (13) The same dynamic adjustment is also available. There is also a situation as shown in "Figure 11"-in the sideline position 'if there are any two adjacent white chesses (shown in the color on the board), there is only one interval between checkers, The potential energy level of the face (D1 or H5) held by the performer also belongs to the same decision model. The chess point is in the aforementioned step H3, and the computer is higher according to the present invention. The method of judging good chess points is by judging; after the technology determines a comparison, choose the best one which is the best one ~ = Several pieces of data include: The value of the level in the initial allocation table of the potential energy level; the potential energy of the remaining rows of chess points 2. Determine the higher potential energy level (is there only one? If yes, then take this — _), if not, Then proceed to the next step. 丨 The move is determined by the number of moves. 3. Among those with higher potential energy levels, ―the number of possible moves with the most number of moves is determined, and the number of ^ numbers‖ is the most? Take the same number of possible moves, then proceed to the next 2 points. If there are more than 4, choose one of them randomly. Then, after determining the best possible move, move to a broken move. point. It is possible to lose corners if the move is lost. If the move is judged at this feasible check point, and re-determined according to the above conditions = ^ Yes, then giving up all feasible check points of this feasible check will cause loss ~ Best feasible Chess points, if it is the factor 'and maintain the first best feasible point, then ignore whether the loss of the corners will lead to the realization of lost corners, the choice of points. As for the judgement,

C: \ Prograra Files \ Patent \ p-〇2l8tw. Ptd

You can check whether there are corners in the simulated chess points that change accordingly. [Embodiment] The feasible chess for searching players in the game is "7th to" 1st turn-to-point sharing ". The 1st determined potential energy and other chess are all selected from the corner point, and the energy level in the table is initially passed. The first level will be the first one, "Player 2", "Computer One or Three" (5), and the descendant level is higher. The "1st subpoint" is "The first speech, and its potential energy is small. The situation of the implementation will be explained dynamically. Now take "the 1st game of jiqiyi as an example to explain as follows. The white player plays first, and the computer plays the black player, then the player plays the next one." White is playing on the square in the picture. According to the search results, we can see that the black picture is represented by the X symbol.) In the "1st" chess game, it can be found that Black is in a positionable position, which is completely selected from The potential energy level is initial, and from the result of "Figure 15", the periphery of White 'has fully reflected the potential energy of Figure 6' and 'Figure 17'. It can be seen that the potential energy level is currently the highest among all feasible points. Figure "to" Figure 21 ", we can see that Luo Zi ’s priority netting level is veryAccording to the potential energy, the meaning of § "Figure 21" H7 should not be settled here. However, the present invention is based on the fact that the potential energy of the chess points is dynamically changed. The feasible chess points will not lead to the loss of corner points, so the ground will rise, and it is second only to the corner points. Figure to example. If F4 is set, this is a feasible map of 3 "to the distribution table in the check point to see the black idea. Selected by Black. For the initial separation of sides and levels, the potential is based on the potential energy level. If the winner is in "Figure 29", the actual position of Black is F 7, and in the selection process, its potential energy level and the other are feasible. Checkpoint F2 is the same, but

V. Description of the invention (15) is due to the fact that the check point F 7 is available. · When the game is played, Black rarely determines the potential energy in the adjacent corner allocation table in the adjacent corner allocation table to avoid selection as It is indeed high in "Figure 5-9, so once it is feasible, it is a priority choice. From" No. 60, it can be seen that every move in accordance with the present invention is determined in the final "in the" 7th result, of which the basis is 4 5 to 1 9 Winning brain's ability to respond to the game [Effect of the invention] According to the game of the present invention, the number of potential energy levels and the degree of loss will be dynamically played, thereby increasing the playability and entertainment of the computer game. Of the pieces "6th position of the most specialized move of the 5th position", so there are 6 moves in the checkpoints "so in the 7th figure" It is easy to cause the technology of the invention of the result of the "multi-corner points to be a picture of potential energy", and it can also prove that the technology of improving the game is to adjust the chess points in the computer and other related factors. effect. Son ', while in F2, the only choice is F7. In the case of =, we find that this is the result of choosing according to the initial principle of potential energy level, because the child is very easy to lose the corner point, ^ 〇, because the corner point's potential energy level is the corner point, the corner point will be the fourth In the corner competition of "graph", the pieces can be lost or gained, which is also the principle of winning the highest level. It can be seen that the technology invented by the computer of this pair of chess pieces with the total number of chess pieces will improve the playability and entertainment. And the player's (both sides of the game) the level of the disease, and based on what can be achieved by the moves and moves to determine a computer's best moves' in order to improve the Othello game C: \ ProgramFiles \ Patent \ p- 0218tw_ptd Page 18 V. Description of the invention (16) [Illustration of graphical symbols 10 20 30 40 Computer-accessible recording medium Central processing unit (CPU) Display unit input unit

C: \ ProgramFiles \ Patent \ p-0218tw.ptd page 19

Claims (1)

Six 4 7 8 Initial allocation table for patent application scope. For example, if the second method of the scope of patent application is applied, where the potential energy level d is "the check point lost by the party performing the reversi. The questioner is never after playing chess, such as the third scope of patent application Method, in which the potential energy level is the highest brain to perform the Othello, such as the second item in the scope of patent application; 3: corner points of the chessboard. Method, in which the potential energy level is the highest: =; Previously, it was adjacent to it; the highest level was unsuccessful, where the decision range = f lines of Ottoman with the highest level and the lowest potential level: the second one is between the potential energy, as described in item 2 Said in the computer: Act, any one of the decision range "_ Qi 2 square J group-is equivalent within the range of the decision;: = = souther, the other-is the potential energy level is relatively angled ', accounting for n As described in item 2 of the scope of patent application, any two adjacent decision ranges in electricity ~ law :: ϊ: Ren-potential energy level is weaker than the decision range; In the method, the step 3 also includes the following steps: order ',,, and white 5 Weekly, the potential energy level is initially divided into potential energy levels; a C: \ Program Files \ Patent \ p-0218tw.ptd of the remaining chess points in the knife table. Sixth, the scope of patent application b. Judge the higher potential energy level. Is there only one possible checker? If yes, then take the one with the higher potential energy level to determine the move-the check point of the line, if not, proceed to the next step; c · determine the number of predators among the people with higher potential energy levels, which one is the most? Take the feasible checker with the highest number of moves to determine the move's move. If there are more than two feasible checkers with the same number of moves, proceed to the next step; and d. Randomly select any of the feasible checkers as Determine the move point of the line. 10. The method for performing reversi on a computer as described in item 9 of the scope of the patent application, wherein the dynamic adjustment of the potential energy level of the remaining line points refers to increasing the potential energy of the remaining line points currently corresponding to the corner point grade. 1 1. The method of performing reversi on a computer as described in item 9 of the scope of the patent application, wherein the dynamic adjustment of the potential energy level of the remaining chess points refers to the presence of any two When there is an interval between adjacent opponents' chess pieces, the potential energy level of the chess point located at that interval will be increased to the higher of the same decision range. C: \ Prograra Files \ Patent \ p-0218tw.ptd page 22