Chess greeting term recognition method and device, storage medium and program product

Abstract

The invention discloses a chess type portfolio term recognition method and device, a storage medium and a program product, and relates to the technical field of artificial intelligence, and the method comprises the steps: presetting one or more dimension conditions which should be satisfied by each portfolio term, and the priority of each portfolio term; the priorities of the portfolio terms are at least determined based on the following principles: for any two portfolio terms, if the accuracy of the portfolio terms identified according to the first sequence is not lower than the accuracy of the portfolio terms identified according to the second sequence, the portfolio terms are identified according to the second sequence; and the priority of the previous portfolio terms in the first sequence is higher than the priority of the later portfolio terms in the first sequence. According to the technical scheme of the invention, during the identification of the portfolio terms, whether the to-be-identified chess step belongs to a certain portfolio term is judged according to the condition of one or more dimensions satisfied by each portfolio term, and the influence of the identification sequence on the identification accuracy is considered in the identification process, so that the portfolio terms can be accurately identified.

Description

Technical Field

[0001] This application relates to the field of artificial intelligence technology, and in particular to a method, device, storage medium, and program product for recognizing chess move terms. Background Technology

[0002] With the development of Artificial Intelligence (AI), chess analysis tools have emerged. These tools can help humans improve their chess skills by generating game analysis commentaries. However, current tools typically describe moves using move counts and board coordinates (e.g., move 100, B7), while humans are accustomed to describing moves using move counts and technical terms (e.g., move 100, the knight's move). This difference in terminology can cause discomfort for players, thus reducing their review experience. Therefore, it is necessary to recognize technical terms for moves to generate game analysis commentaries that correspond to these terms, thereby optimizing the review experience for players. Summary of the Invention

[0003] In view of the above problems, this application provides a method, device, storage medium, and program product for recognizing chess move terms, the specific solution of which is as follows:

[0004] The first aspect of this application provides a method for recognizing chess move terms, including:

[0005] Obtain candidate move terms associated with the move to be identified from the move terminology library; the move terminology library stores move terms, conditions that move terms should meet, and the priority of each move term; wherein, the conditions that each move term should meet include one or more dimensions of conditions; the priority of move terms is determined based on at least the following principle: for any two move terms, if the accuracy of the move terms identified according to the first ranking is not less than the accuracy of the move terms identified according to the second ranking, then the move term ranked earlier in the first ranking has a higher priority than the move term ranked later.

[0006] Based on the priority of the move terms from high to low, and according to the conditions that the move terms should meet, it is determined one by one whether the move to be identified belongs to one of the candidate move terms.

[0007] In one possible implementation, the move terms in the move terminology library are divided into multiple move groups; each move group corresponds to a basic condition, which is a common condition that each move term in the move group should satisfy; the move terms in different move groups are different; the basic conditions corresponding to different move groups are different.

[0008] Correspondingly, the process of obtaining candidate move terms associated with the move to be identified from the move terminology library, and determining one by one whether the move to be identified belongs to one of the candidate move terms, includes:

[0009] Determine whether the chess move to be identified meets the basic conditions corresponding to each move group;

[0010] The move terms within the move group corresponding to the basic conditions met by the move to be identified are determined as candidate move terms.

[0011] Based on the priority of the move terms from high to low, and according to the non-basic conditions that the move terms should meet, each move to be identified is judged to determine whether it belongs to one of the candidate move terms.

[0012] In one possible implementation, the process of determining whether the move to be identified belongs to any candidate move term includes:

[0013] Obtain the move type to which any of the candidate move terms belong;

[0014] Based on the conditions that any candidate move term should meet, the judgment process corresponding to the move type determines whether the move to be identified belongs to any candidate move term.

[0015] In one possible implementation, the move type to which the move term belongs includes the following four types: take-up, hit-up, normal move, and position-related move.

[0016] In one possible implementation, the move type "capture" includes the move term "capture," and the process of determining whether the move to be identified belongs to the "capture" move term according to the judgment process corresponding to the move type "capture" includes:

[0017] Determine whether there are any pieces of opposite color adjacent to the place of the move to be identified in the four directions above, below, left, and right of the place of the move to be identified;

[0018] If there are no adjacent pieces of the opposite color, it is determined that the move to be identified does not belong to the term "capture" or "capture";

[0019] If there are adjacent pieces of different colors, calculate the change in the number of liberties of each piece containing the adjacent pieces of different colors before and after the move to be identified. If the number of liberties of a piece changes from having liberties to having no liberties, it is determined that the move to be identified belongs to the term "capture" or "take". Otherwise, it is determined that the move to be identified does not belong to the term "capture" or "take".

[0020] In one possible implementation, the move type "capture" includes both capture and double capture. The process of determining whether the move to be identified belongs to either the capture or double capture move type, according to the judgment procedure corresponding to the capture move type, includes:

[0021] Determine whether there are any pieces of opposite color adjacent to the place of the move to be identified in the four directions above, below, left, and right of the place of the move to be identified;

[0022] If there are no adjacent pieces of different colors, it is determined that the move to be identified does not belong to the term "capture" or "double capture".

[0023] If there are adjacent pieces of different colors, calculate the change in the number of liberties of each piece containing the adjacent pieces before and after the move to be identified. If only one piece's liberties change from two to one, the move to be identified is determined to belong to the "capture" move category. If two pieces' liberties change from two to one, the move to be identified is determined to belong to the "double capture" move category. If no piece's liberties change from two to one, the move to be identified is determined to belong to neither the "capture" move category nor the "double capture" move category.

[0024] In one possible implementation, for any move term, if the move type of the move term is a target move type, where the target move type is a normal move or a position-related move, the process of determining whether the move to be identified belongs to the move term is followed according to the judgment process corresponding to the target move type, including:

[0025] Determine whether the move to be identified meets the non-mirror-related conditions that any move term should satisfy;

[0026] If the move to be identified does not meet any of the non-mirror-related conditions that any move term should satisfy, then the move to be identified is determined not to belong to any of the move terms.

[0027] If the move to be identified meets all the non-mirror-related conditions that any move term should satisfy, determine whether there is a mirror direction of the move to be identified that meets all the mirror-related conditions that any move term should satisfy;

[0028] If the move to be identified has a mirror direction that meets all the mirror-related conditions that any move term should satisfy, then the move to be identified is determined to belong to any move term; if the move to be identified does not meet any of the mirror-related conditions that any move term should satisfy in any mirror direction, then the move to be identified is determined not to belong to any move term.

[0029] In one possible implementation, if the target move type is a normal move, and it is necessary to determine the position of the pieces or the relative positional relationship between the pieces, the position of the pieces or the relative positional relationship between the pieces is determined based on a Cartesian coordinate system with the placement point of the move to be identified as the origin.

[0030] When the target move type is a position-related move, if it is necessary to determine the position of the pieces or the relative positional relationship between the pieces, the position of the pieces or the relative positional relationship between the pieces is determined based on a Cartesian coordinate system with the corner of the board closest to the placement point of the move to be identified as the origin.

[0031] In one possible implementation, the terminology library contains different terms corresponding to different moves, or different terms corresponding to the same move in different situations.

[0032] In one possible implementation, the conditions that each move term should satisfy belong to a dimension that includes at least one of the following dimensions:

[0033] The relative positions of the pieces, their positions on the board, the order of moves, the moves made in previous moves, the liberties of the pieces, and whether certain pieces should appear simultaneously.

[0034] In one possible implementation, where the accuracy of move terms identified according to the first order is equal to the accuracy of move terms identified according to the second order, the priority of a move term is negatively correlated with the computational cost of the move term identification process, and / or the priority of a move term is positively correlated with the frequency of occurrence of the move term.

[0035] The second method of this application provides a chess-playing robot, comprising: a display module and a processor;

[0036] The display module is used to display the chessboard and the chess pieces on the chessboard;

[0037] The processor is used to play against the user on the chessboard, and the processor is also used to implement the chess move term recognition method of the first aspect or any implementation of the first aspect.

[0038] A third aspect of this application provides a computer program product including computer-readable instructions that, when executed on an electronic device, cause the electronic device to implement the chess move term recognition method described in the first aspect or any implementation thereof.

[0039] A fourth aspect of this application provides an electronic device, the electronic device comprising: at least one processor and a memory connected to the processor, wherein:

[0040] The memory is used to store computer programs;

[0041] The processor is used to execute the computer program so that the electronic device can implement the chess move term recognition method of the first aspect or any implementation thereof.

[0042] The fifth aspect of this application provides a computer storage medium carrying one or more computer programs, which, when executed by an electronic device, enable the electronic device to implement the chess move term recognition method described in the first aspect or any implementation thereof.

[0043] Using the above technical solution, the chess move term recognition method, device, storage medium, and program product provided in this application pre-set the conditions that each move term should meet, as well as the priority of each move term. The conditions that each move term should meet include one or more dimensions of conditions. The priority of the move term is determined based on at least the following principle: for any two move terms, if the accuracy of the move term recognized according to the first ranking is not lower than the accuracy of the move term recognized according to the second ranking, then the move term ranked earlier in the first ranking has a higher priority than the move term ranked later. During the move term recognition process, candidate move terms associated with the move to be identified are obtained from the move term database. According to the order of move term priority from high to low, based on the conditions that each move term should meet, it is sequentially determined whether the move to be identified belongs to a certain move term in the candidate move terms. The move term recognition method of this application determines whether a move to be identified belongs to a certain move term based on the pre-set conditions that each move term should meet. The pre-set conditions that each move term should meet take into account multiple dimensions, and the recognition process takes into account the impact of the recognition order on the recognition accuracy. Therefore, it can accurately identify move terms. Attached Figure Description

[0044] The above and other features, advantages, and aspects of the embodiments of this disclosure will become more apparent from the accompanying drawings and the following detailed description. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and the originals and elements are not necessarily drawn to scale.

[0045] Figure 1 A flowchart illustrating an implementation of the chess move terminology recognition method provided in this application;

[0046] Figure 2 A flowchart illustrating the implementation of obtaining candidate move terms associated with the move to be identified from the move terminology library provided in this application, and determining one by one whether the move to be identified belongs to one of the candidate move terms.

[0047] Figure 3An example of a condition with mirror properties that a certain move term provided for this application should satisfy;

[0048] Figure 4 An example of a condition with mirror properties that a certain move term provided for this application should satisfy in four mirror directions;

[0049] Figure 5 An example of determining the mirror direction using a rectangular coordinate system with the chessboard corner as the origin, as provided in this application;

[0050] Figure 6 Another example of determining the mirror direction using a rectangular coordinate system with the chessboard corner as the origin, as provided in this application;

[0051] Figure 7 A schematic diagram of the structure of the electronic device provided in this application. Detailed Implementation

[0052] The embodiments of this application are described below with reference to the accompanying drawings. The terminology used in the implementation section of this application is for explaining specific embodiments only and is not intended to limit the scope of this application.

[0053] The embodiments of this application will now be described with reference to the accompanying drawings. Those skilled in the art will recognize that, with technological advancements and the emergence of new scenarios, the technical solutions provided in the embodiments of this application are equally applicable to similar technical problems.

[0054] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such terms are interchangeable where appropriate; this is merely a way of distinguishing objects with the same attributes in the embodiments of this application. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion, so that a process, method, system, product, or apparatus that comprises a series of elements is not necessarily limited to those elements, but may include other elements not explicitly listed or inherent to those processes, methods, products, or apparatuses.

[0055] Current methods for identifying chess move terms typically determine the move term based on the piece to be identified and its surrounding pieces. This approach only considers the positional relationships between pieces within a local area, which can easily lead to identification errors, such as omission (i.e., a move term that should be identified is not identified) or misidentification (i.e., a move term that should be identified is identified as move term 2).

[0056] The proposed solution is intended to improve the accuracy of chess move terminology recognition.

[0057] The solution proposed in this application can be used to identify move terms in Go, as well as move terms in other board games (such as Chinese chess, Gomoku, etc.).

[0058] The following uses Go as an example to illustrate the process of identifying the move terms in this application.

[0059] This application pre-constructs a terminology database for all possible moves and terms involved in Go games. This terminology database also stores the conditions that move terms should meet, as well as information such as the priority of each move term.

[0060] Among them, the conditions that a move term should meet refer to the conditions that a move must meet to be determined as that move term.

[0061] Each move term must satisfy conditions comprising one or more dimensions, with each dimension containing at least one condition. The dimensions to which different move terms must satisfy conditions may be the same or different. That is, some move terms must satisfy conditions comprising only one dimension, while others must satisfy conditions comprising multiple dimensions.

[0062] For any move term, if the move term should satisfy only one dimension of N (N is greater than or equal to 1) conditions, then a move only needs to satisfy these N conditions to be determined as that move term; if the move term should satisfy conditions including M dimensions, then a move needs to satisfy all of these M dimensions to be determined as that move term, and the number of all conditions in these M dimensions is greater than or equal to M.

[0063] The conditions that each move term should meet belong to the dimensions including, but not limited to, at least one of the following dimensions:

[0064] The positional relationship between pieces, including but not limited to at least one of the following conditions: conditions related to the distance between pieces, conditions related to the orientation relationship between pieces, etc.

[0065] The position of a piece relative to the board, and the conditions for this dimension include, but are not limited to, at least one of the following: conditions related to the number of lines, conditions related to corners, etc.

[0066] The order of moves refers to the sequence or number of moves made in a game of chess. Conditions for this dimension may include, but are not limited to, conditions related to the relative positional relationship between the move points K moves backward from the move to be identified and the move point to be identified.

[0067] The conditions for the previous move in the game can include, but are not limited to, conditions related to the range of terms associated with the move preceding the move to be identified.

[0068] The liberties of a piece can be determined by conditions including, but not limited to, those related to the number of liberties a piece has.

[0069] Whether certain pieces must appear simultaneously can be determined by conditions including, but not limited to, at least one of the following: conditions related to whether the presence of pieces of the same or different color is required, conditions related to whether the presence of pieces of the same or different color is prohibited, etc.

[0070] For any move to be identified, this application determines whether it belongs to a certain move term in the move terminology database one by one. Based on this, the inventors of this application have discovered that for any two different move terms, denoted as the first move term and the second move term, it is possible that a move meets the conditions that the first move term should satisfy and the conditions that the second move term should satisfy. In this case, the order of the two move terms is different, and the move term to which the move belongs will be different. The effect of identifying a move as the first move term and identifying it as the second move term is different, and the accuracy of identifying the move as one of the move terms is higher. For example, the conditions that a first move term should satisfy include A, B, and C, while the conditions that a second move term should satisfy include A and B. If a move satisfies conditions A, B, and C, then that move satisfies both the conditions that a first move term should satisfy and the conditions that a second move term should satisfy. However, it is clear that the move satisfies the conditions that a first move term should satisfy more. But if we first determine whether the move belongs to the second move term, we will determine that the move belongs to the second move term, which is an incorrect identification. On the other hand, if we first determine whether the move belongs to the first move term, we will determine that the move belongs to the first move term, which is a correct identification. For example, the conditions that a first move term should satisfy include A, B, and C, while the conditions that a second move term should satisfy include A, B, and D. If a move simultaneously satisfies all four conditions (A, B, C, and D), then that move satisfies both the conditions for a first and second move term. However, in actual chess games, players generally classify that move as a second move term. Therefore, if the player first determines whether the move belongs to a first move term, it will be incorrectly classified as such; but if the player first determines whether the move belongs to a second move term, it will be correctly classified as such. Therefore, it is necessary to determine the priority of each move term. First, determine whether the move to be identified belongs to a higher priority move term. If it does, then it is no longer necessary to determine whether the move to be identified belongs to a lower priority move term. If the move to be identified does not belong to a higher priority move term, then it is necessary to determine whether the move to be identified belongs to a lower priority move term, and so on, until the move term to which the move to be identified belongs is determined, so as to ensure the accuracy of move term identification.

[0071] In this application, the priority of move terms is related to the accuracy of move term identification. The priority of move terms is determined based on at least the following principle: For any two move terms, if the accuracy of the move term identified according to the first ranking is not lower than the accuracy of the move term identified according to the second ranking, then the move term ranked earlier in the first ranking has a higher priority than the move term ranked later. That is, if the accuracy of the move term identified according to the first ranking is higher than the accuracy of the move term identified according to the second ranking, or if the accuracy of the move term identified according to the first ranking is equal to the accuracy of the move term identified according to the second ranking (for example, the move term identified according to different rankings is the same move term), then the move term ranked earlier in the first ranking has a higher priority than the move term ranked later.

[0072] Based on the aforementioned terminology database, a flowchart of one implementation of the chess move terminology recognition method provided in this application is as follows: Figure 1 As shown, it may include:

[0073] Step S101: Obtain candidate move terms associated with the move to be identified from the move terminology library.

[0074] The move to be identified can be the most recent move made on the board. If the most recent move was not made on the board (i.e., the move is empty), then this move is not the move to be identified. There is no need to determine the move terminology to which the move belongs; any move can be determined as a forfeit.

[0075] Optionally, all move terms in the move terminology library can be directly identified as candidate move terms associated with the move to be identified.

[0076] Optionally, for each move term in the move terminology database, a condition can be extracted from the conditions that the move term should satisfy. It can then be determined whether the move to be identified meets that condition. If it does, the move term is identified as a candidate move term associated with the move to be identified (this can be denoted as a candidate move term). Otherwise, the move term is determined not to be a candidate move term associated with the move to be identified (this can be denoted as a non-candidate move term). In other words, a candidate move term is a move term whose conditions include one condition that the move to be identified meets, and a candidate move term may belong to the move term to which the move to be identified belongs. A non-candidate move term is a move term whose conditions include conditions that the move to be identified does not meet, and a non-candidate move term is definitely a move term that the move to be identified does not belong to. When filtering candidate move terms, the priority of the move terms does not need to be considered.

[0077] As an example, when extracting a condition from the conditions that a move term should satisfy, a condition can be randomly extracted from the conditions that a move term should satisfy, or a pre-specified condition that assigns the characteristics of the move term can be extracted from the conditions that a move term should satisfy.

[0078] Step S102: According to the priority of the move terms from high to low, based on the conditions that the move terms should meet, determine one by one whether the move to be identified belongs to one of the candidate move terms.

[0079] Following the priority order of move terms from high to low, for each candidate move term read, it is determined whether the move to be identified meets all the conditions that the candidate move term should satisfy. If it does, the move to be identified is determined to belong to the candidate move term; otherwise, the move to be identified is determined not to belong to the candidate move term, and the next candidate move term is read to determine whether the move to be identified belongs to the next candidate move term, until the move term to which the move to be identified belongs is determined, or there is no next candidate move term (i.e., all candidate move terms have been judged for the move to be identified).

[0080] Once the move to be identified is determined to belong to a specific move term, or if there is no next candidate move term, the determination process for that move ends, and move term identification can be performed on the next move to be identified.

[0081] The chess move term recognition method provided in this application determines whether a move to be identified belongs to a certain move term based on the pre-set conditions that each move term should meet and the recognition order. The pre-set conditions that the move term should meet take into account multiple dimensions, and the recognition process takes into account the impact of the recognition order on the recognition accuracy. Therefore, it can accurately identify move terms and improves the accuracy of move term recognition compared to existing move term recognition methods.

[0082] In an optional embodiment, to improve the recognition efficiency of move terms, the move terms in the move terminology database can be pre-divided into different move groups according to the conditions that each move term should satisfy. Each move group corresponds to basic conditions, which are common conditions for all move terms within the corresponding move group. The basic conditions corresponding to different move groups are different (including: the basic conditions corresponding to different move groups are completely different, or, among the basic conditions corresponding to different move groups, some basic conditions are the same and some are different). The number of basic conditions corresponding to different move groups can be the same or different. The move terms within different move groups are different (including: the intersection of any two move groups is empty, that is, a move term belongs to only one move group). Each move term within a move group corresponds to non-basic conditions (also called private conditions). The non-basic conditions corresponding to each move term, as well as the common conditions corresponding to the move group to which the move term belongs, constitute the conditions that the move term should satisfy. In other words, in the move terminology database, move terms are divided into different move groups, and the conditions that each move term should satisfy are divided into basic conditions and non-basic conditions. Based on this, when acquiring candidate move terms associated with the move to be identified from the move terminology database, and determining whether the move to be identified belongs to a certain candidate move term based on the conditions that each move term should meet, we can first determine whether the move to be identified meets the basic conditions corresponding to each move group to determine which move groups the move to be identified may belong to. After determining all the move groups to which the move to be identified may belong, we can then determine whether the move to be identified belongs to a certain move term in the move group to which the move to be identified may belong, thereby improving the recognition efficiency.

[0083] In an optional embodiment, the flowchart for obtaining candidate move terms associated with the move to be identified from the move terminology library and determining whether the move to be identified belongs to one of the candidate move terms is shown below. Figure 2 As shown, it may include:

[0084] Step S201: Determine whether the move to be identified meets the basic conditions corresponding to each move group.

[0085] For each move group, determine whether the move to be identified meets all the basic conditions corresponding to that move group. If the move to be identified meets all the basic conditions corresponding to that move group, determine that the move to be identified may belong to a move term within that move group; otherwise, determine that the move to be identified does not belong to any move term within that move group.

[0086] Step S202: Determine the move terms in the move group corresponding to the basic conditions met by the move to be identified as candidate move terms.

[0087] After all candidate move terms have been determined, proceed to the next step.

[0088] Step S203: According to the priority of the move terms from high to low, based on the non-basic conditions that the move terms should meet, determine one by one whether the move to be identified belongs to one of the candidate move terms.

[0089] If the move to be identified meets all the basic conditions corresponding to D (D is a positive integer) move groups, when determining whether the move to be identified belongs to a candidate move term among the candidate move terms, it is only necessary to consider the non-basic conditions that the candidate move term should satisfy, without considering the basic conditions. Based on this, the move to be identified can be determined in descending order of priority of the move terms in the D move groups, based on the non-basic conditions that each move term should satisfy, to determine whether the move to be identified belongs to a candidate move term among the candidate move terms.

[0090] For any two move sets, the priority of move terms in one move set is not necessarily higher than that in the other move set. For example, if the first move set contains move terms 1 and 2, and the second move set contains move terms 3 and 4, then it is possible that the priority of move terms 1 and 2 is both higher than that of move term 3, or it is possible that the priority of move term 1 is higher than that of move term 3, while the priority of move term 2 is lower than that of move term 3.

[0091] In an optional embodiment, one way to determine whether a move to be identified belongs to any candidate move term is as follows:

[0092] Obtain the move type to which any candidate move term belongs.

[0093] Taking Go as an example, the move types to which move terms belong can include, but are not limited to, the following four types: capture, attack, ordinary moves, and position-related moves.

[0094] Among them, the terminology for moves that involve "taking a bite" includes: "taking a bite" and "robbing".

[0095] Terms related to moves that involve capturing or eating include: capture, double capture, etc.

[0096] There are many terms for moves that are classified as ordinary moves, including but not limited to: small flying, block, rush, stand, long, break, stick, connect, climb, etc.

[0097] The terminology for position-related moves is strongly related to position, including but not limited to: star position, small eye, high eye, outside eye, one-space low clamp, etc.

[0098] The various types of move terms mentioned above are merely illustrative examples and do not list all move terms in the field of Go.

[0099] This application can list all the move terms in the field of Go in the move terminology library, and mark the move type to which each move term belongs.

[0100] Based on the conditions that any candidate move term should meet, the judgment process corresponding to the move type to which any candidate move term belongs determines whether the move to be identified belongs to any candidate move term.

[0101] When the candidate move terms include all move terms in the move term library, it is necessary to determine whether the move to be identified belongs to any candidate move term based on all the conditions that any candidate move term should satisfy. If the move to be identified meets all the conditions that any candidate move term should satisfy, it is determined that the move to be identified belongs to any candidate move term; otherwise, it is determined that the move to be identified does not belong to any candidate move term.

[0102] When candidate move terms are extracted from the move terminology database based on the basic conditions corresponding to the move group, it is only necessary to determine whether the move to be identified meets the non-basic conditions that any candidate move term should satisfy. If the move to be identified meets all the non-basic conditions that any candidate move term should satisfy, it is determined that the move to be identified belongs to any candidate move term; otherwise, it is determined that the move to be identified does not belong to any candidate move term.

[0103] By setting different judgment processes for different move types, recognition efficiency can be further improved.

[0104] In an optional embodiment, one way to determine whether a move to be identified belongs to the "capture" move category according to the judgment process corresponding to the "capture" move type is as follows:

[0105] Determine whether there are any pieces of different colors adjacent to the place of the move to be identified in the four directions above, below, left, and right.

[0106] If there are no adjacent pieces of the opposite color (i.e., there are no pieces adjacent to the place of the piece to be identified, or the pieces are of the same color as the piece of the piece to be identified), then the piece to be identified is not considered a capture move; that is, only if there are pieces of the opposite color adjacent to the place of the piece to be identified can the piece to be identified be considered a capture move.

[0107] If there are adjacent pieces of different colors, calculate the change in the number of liberties of each piece containing the adjacent pieces of different colors before and after the move to be identified. If the number of liberties of a piece changes from having liberties (i.e., only one liberty) to having no liberties, it is determined that the move to be identified belongs to the term "capture". Otherwise, it is determined that the move to be identified does not belong to the term "capture".

[0108] A piece may be in a square containing only that piece, or the square may be composed of multiple consecutive pieces of the same color that contain that piece.

[0109] The move to be identified may have only one adjacent piece of different color, or it may have multiple adjacent pieces of different color. When the move to be identified has only one adjacent piece of different color, a piece can be uniquely identified based on the adjacent pieces of the move to be identified. When the move to be identified has multiple adjacent pieces of different color, the adjacent pieces of the move to be identified may only identify one piece (multiple adjacent pieces of different color belong to the same piece), or it may identify two or three pieces (i.e. different adjacent pieces of different color belong to different pieces).

[0110] In an optional embodiment, one implementation of determining whether a move to be identified belongs to the "capture" or "double capture" move category according to the judgment process corresponding to the "capture" move type can include:

[0111] Determine whether there are any pieces of different colors adjacent to the place of the move to be identified in the four directions above, below, left, and right.

[0112] If there are no adjacent pieces of the opposite color, the move to be identified is determined not to belong to the "capture" or "double capture" move terms; that is, only if there are pieces of the opposite color adjacent to the place of the move to be identified can the move to be identified possibly belong to the "capture" or "double capture" move terms.

[0113] If there are adjacent pieces of different colors, calculate the change in the number of liberties of each piece containing the adjacent pieces before and after the move to be identified. If only one piece's liberties change from two to one, the move to be identified is determined to be a capture move. If two pieces' liberties change from two to one, the move to be identified is determined to be a double capture move. If no piece's liberties change from two to one, the move to be identified is determined to be neither a capture move nor a double capture move.

[0114] As an example, the aforementioned capture, attack, and double attack moves share a common condition: there must be a piece of the opposite color adjacent to the move to be identified. Based on this, these three moves can be grouped into a move group, with the basic condition being: there must be a piece of the opposite color adjacent to the move to be identified. Correspondingly, the non-basic condition for a capture can be: before and after the move to be identified, in each group containing adjacent pieces of the opposite color, one group's liberties change from having liberties to having no liberties. The non-basic condition for an attack can be: before and after the move to be identified, in each group containing adjacent pieces of the opposite color, only one group's liberties change from two liberties to one liberty. The non-basic condition for a double attack can be: before and after the move to be identified, in each group containing adjacent pieces of the opposite color, two groups' liberties change from two liberties to one liberty.

[0115] In actual chess games, some moves and terms have mirror properties (also known as symmetry) that they must satisfy. This means that certain conditions for a move or term can be true in different directions, and pieces that meet these conditions in different directions exhibit point symmetry (i.e., central symmetry). For example... Figure 3 The image shown is an example of a condition that a certain move term provided in this application should satisfy to have a mirror attribute. In this example, the placement point of the move to be identified is... Figure 3 The black piece in the center of the board must meet two conditions for its move to have mirror properties: simultaneously, there must be a piece of the same color whose relative position to the placement point of the move to be identified is [1,3], and a piece of a different color whose relative position to the placement point of the move to be identified is [0,2]. For example... Figure 3As shown, any group of three pieces connected by the red line must satisfy the two mirror-attribute conditions that this move term must meet in one direction (called the mirror direction). Therefore, when determining whether a move belongs to this move term, the move must not belong to this move term if none of the mirror directions meet the conditions that the move term must meet. If at least one mirror direction meets the conditions that the move term must meet, the move is determined to belong to this move term. Assuming that all mirror-attribute conditions that a certain move term 1 must meet include condition 1 and condition 2, specifically when determining whether a move meets the mirror-attribute conditions that a certain move term 1 must meet, for each mirror direction, it is necessary to determine whether the move meets the two mirror-attribute conditions that the move term 1 must meet. For the i-th (i=1, 2, 3, ..., I; I is the number of mirror directions) mirror direction, if the move to be identified meets condition 1 and condition 2 of the mirror attribute that move term A should satisfy in the i-th mirror direction, it is determined that the move to be identified meets all the mirror attribute conditions that move term A should satisfy. If the move to be identified does not meet condition 1 of the mirror attribute that move term A should satisfy or does not meet condition 2 of the mirror attribute that move term A should satisfy in the i-th mirror direction, it is determined that the move to be identified does not meet all the mirror attribute conditions that move term A should satisfy in the i-th mirror direction. It is necessary to determine whether the move to be identified meets both mirror attribute conditions that move term A should satisfy in the next mirror direction. In other words, if the move to be identified meets condition 1 (having mirror attributes) of move term 1 in the i-th mirror direction, but does not meet condition 2 (having mirror attributes) of move term 1, and the move to be identified does not meet condition 1 (having mirror attributes) of move term 1 in the j-th (j≠i) mirror direction, but meets condition 2 (having mirror attributes) of move term 1, then this situation is also considered as the move to be identified not meeting all the conditions for having mirror attributes of move term 1.

[0116] Figure 3 In the example shown, there are 8 mirror directions, but in some cases, different mirror directions overlap; therefore, the actual number of mirror directions is less than 8. Figure 4 The image shows an example of a condition for a move term provided in this application to have a mirror attribute, which must be satisfied in one of the four mirror directions. In this example, the condition for having a mirror attribute is: moving a piece diagonally above or below an existing piece. Figure 4The white piece marked with a black circle represents the move to be identified. Any existing piece in one of its four positions (upper left diagonal, lower left diagonal, upper right diagonal, and lower right diagonal) can make the move to be identified satisfy the condition of "moving the piece diagonally above or below an existing piece," which has a mirror property. Therefore, there are four mirror directions.

[0117] The conditions that must be met include the fact that move terms with mirror attributes typically appear in the move terms of ordinary moves and position-related moves. For ease of description, ordinary moves and position-related moves are collectively referred to as target move types. Based on this, for any move term, one implementation of determining whether the move to be identified belongs to any move term according to the judgment process corresponding to the target move type can include:

[0118] Determine whether the move to be identified meets the non-mirror-related conditions that any move term should satisfy.

[0119] To further improve the recognition efficiency of move terms, this application divides the conditions that move terms should meet into mirror-related conditions (i.e. conditions with mirror attributes) and non-mirror-related conditions. Among them, mirror-related conditions refer to the conditions used when it is necessary to judge whether the move to be identified meets the conditions that move terms should meet in each mirror direction, which may require multiple judgments; the other conditions are non-mirror-related conditions, which do not need to be judged in each mirror direction, but only need to be judged once, and each non-mirror-related condition can be independent of each other.

[0120] For example, one of the conditions for a certain move term is that the piece in which the current move to be identified is located has at least two liberties. This condition is a non-mirror-related condition, meaning there is no mirror direction to determine, and it only needs to be determined once.

[0121] When identifying move terms for a move, first determine whether the move meets the non-mirror-related conditions that the move term should satisfy. If it does not meet any non-mirror-related condition, there is no need to judge other non-mirror-related conditions and mirror-related conditions.

[0122] For example, to determine whether a move belongs to the "rush" move category, there are three non-mirror image conditions that the "rush" move category must satisfy, denoted as X, Y, and Z. We can first check if the move meets condition X. If it does not meet condition X, then the move does not belong to the "rush" move category, and we no longer need to check if it meets conditions Y and Z. If the move meets condition X, then we check if it meets condition Y. If it does not meet condition Y, then the move is considered a "rush" move. If the move does not belong to the term "rush," then the determination of whether the move meets condition Z is no longer made. If the move meets condition Y, then the determination of whether the move meets condition Z continues. If the move does not meet condition Z, then the move does not belong to the term "rush," and the determination of whether the move meets all the mirror-related conditions that the term "rush" should satisfy is no longer made. If the move meets condition Z, then the determination of whether the move meets all the mirror-related conditions that the term "rush" should satisfy continues.

[0123] If the move to be identified does not meet any non-mirror-related condition that any move term should satisfy, then the move to be identified is determined not to belong to any move term.

[0124] If the move to be identified meets all the non-mirror-related conditions that any move term should satisfy, then determine whether there exists a mirror direction for the move to be identified that meets all the mirror-related conditions that any move term should satisfy. The order of judging each mirror direction is not required; you can start from any mirror direction and judge each mirror direction to see if the move to be identified meets all the mirror-related conditions that any move term should satisfy in that mirror direction.

[0125] If there exists a mirror direction, and the move to be identified meets all the mirror-related conditions that any move term should satisfy in that mirror direction, then the move to be identified belongs to that move term; if the move to be identified does not meet any of the mirror-related conditions that any move term should satisfy in any mirror direction, then the move to be identified does not belong to that move term.

[0126] If a mirror direction exists, and the move to be identified meets all the mirror-related conditions that any move term should satisfy in that mirror direction, then it is unnecessary to determine whether the move to be identified meets all the mirror-related conditions that any move term should satisfy in other mirror directions. For any mirror direction, if the move to be identified does not meet any mirror-related condition that any move term should satisfy in that mirror direction, then it is determined that the move to be identified does not belong to any move term in that mirror direction.

[0127] In an optional embodiment, when the target move type is a normal move, if it is necessary to determine the position of the pieces or the relative positional relationship between the pieces, the position of the pieces or the relative positional relationship between the pieces is determined based on a Cartesian coordinate system with the placement point of the move to be identified as the origin.

[0128] For example, when determining the position of a move that satisfies a relative positional relationship with the place of the move to be identified, the rectangular coordinate system of the origin of the place of the move to be identified should be used as the reference.

[0129] For example, regarding the terminology of common moves, after determining the position of the piece in the first mirror direction (for ease of description and distinction, denoted as the first mirror direction) that satisfies the relative positional relationship with the placement point of the piece to be identified, when determining the positions in other mirror directions (for ease of description and distinction, denoted as the second mirror direction) that satisfy the relative positional relationship with the placement point of the piece to be identified, a preset mirror mapping rule can be used to map the position in the first mirror direction that satisfies the relative positional relationship with the placement point of the piece to be identified to the position in the second mirror direction that satisfies the relative positional relationship with the placement point of the piece to be identified. Of course, the positions in each mirror direction that satisfy the relative positional relationship with the placement point of the piece to be identified can be preset and read directly when needed.

[0130] When the target move type is a common move, the conditions that the move term should meet are mostly strongly related to the placement point of the move to be identified. Using a rectangular coordinate system with the placement point of the move to be identified as the origin can more quickly determine the position that satisfies the relative positional relationship with the placement point of the move to be identified, thereby improving the recognition efficiency of the move term.

[0131] In an optional embodiment, when the target move type is a position-related move, if it is necessary to determine the position of the pieces or the relative positional relationship between the pieces, the position of the pieces or the relative positional relationship between the pieces is determined based on a Cartesian coordinate system with the nearest corner of the board to the move to be identified as the origin.

[0132] The conditions that move terms related to position should meet are often strongly related to the absolute position of the chessboard (such as the corner of the chessboard). Based on this, for position-related moves, the position of the piece or the relative positional relationship between the pieces can be determined by using a rectangular coordinate system with the chessboard corner closest to the place of the move to be identified as the origin. This can more quickly determine the position that satisfies the relative positional relationship with the place of the move to be identified, thereby improving the recognition efficiency of move terms.

[0133] like Figure 5 The image shown is an example of determining the mirror direction using a rectangular coordinate system with the chessboard corner as the origin, provided in an embodiment of this application.

[0134] by Figure 5 Taking the lower right corner of the chessboard in Figure 5 as an example, there are two chess pieces that form a "day" character grid with this chessboard corner, namely the white chess piece marked with a black circle in

[0135] and the black chess piece one step diagonally up and to the right of this white chess piece. The directions where the positions of these two chess pieces are located are mirror images of each other, that is, two mirror directions. Other chessboard corners also have similar mirror characteristics. Figure 6 As shown in

[0136] taking the lower right corner of the chessboard in Figure 6 as an example, there is only 1 chess piece that forms a "field" character grid with this chessboard corner, that is, the black chess piece marked with a white circle in Figure 6 which is also one mirror direction. Other chessboard corners also have similar mirror characteristics.

[0137] Some non-mirror-related conditions and mirror-related conditions in ordinary moves and position-related moves are exemplified below. It should be noted that the conditions listed here are not the only conditions, nor are these conditions that must be satisfied by each move term. It is determined according to the requirements of each move term itself.

[0138] The non-mirror-related conditions of ordinary moves may include but are not limited to:

[0139] 1. Conditions of the placement point of the to-be-recognized chess move relative to the chessboard position

[0140] 1) The allowed chessboard lines of the placement point of the to-be-recognized chess move, for example, only allowed on the first and second lines of the chessboard.

[0141] 2) The prohibited chessboard lines of the placement point of the to-be-recognized chess move, for example, not allowed to appear on the third and fourth lines of the chessboard.

[0142] 3) The placement point of the to-be-recognized chess move is prohibited from appearing at the chessboard corner points.

[0143] 2. Requirements for other non-directional chess pieces

[0144] 1) There are no same-color chess pieces other than the placement point of the to-be-recognized chess move within a square or circular range centered on the placement point of the to-be-recognized chess move.

[0145] 2) There are no different-color chess pieces other than the placement point of the to-be-recognized chess move within a square or circular range centered on the placement point of the to-be-recognized chess move.

[0146] 3. Conditions related to chronological order

[0147] 1) The range of the move term of the previous move. For example, in a certain case of "block", the move term of the previous move must be "charge".

[0148] The mirror-related conditions for normal moves may include, but are not limited to:

[0149] 1. Chess Piece Configuration Requirements

[0150] 1) Using the placement point of the move to be identified as the center of the relative position relationship (i.e., using the rectangular coordinate system with the placement point of the move to be identified as the origin as the reference system), it is required that there are pieces of the same color and different colors (pieces refer to pieces other than the placement point of the move to be identified).

[0151] 2) The placement point of the move to be identified is the center of the relative position relationship, and the same color and different color pieces are prohibited.

[0152] 3) The placement point of the move to be identified is the center of the relative position relationship. It is forbidden to have pieces of the same color and different colors at the same time.

[0153] 4) Configure the allowed board paths for pieces, for example, only allow them to appear on the first and second lines of the board.

[0154] 5) Configure pieces that are prohibited on certain board positions, such as not allowing them to appear on the third or fourth line of the board.

[0155] 6) Certain same-color or different-color pieces on the current board are not allowed to be captured.

[0156] 7) Certain same-color and different-color pieces on the current board must be in a state of being captured.

[0157] 8) The nearest piece of the same color to the move to be identified must be at a specific distance and be a piece of the same color.

[0158] 2. Conditions for the placement of the piece to be identified relative to its position on the chessboard.

[0159] 1) The positional relationship between the place of the piece, some positions on the board (called displacement points, i.e., points after displacement under the condition that the place of the piece to be identified is the center of the relative positional relationship), and the edge of the board. For example, the place of the piece to be identified is closer to the edge of the board than the displacement point, and the nearest edge projection points of the two are the same.

[0160] 3. Conditions related to time sequence

[0161] 1) Specify the relative position of the move S moves backward from the move to be identified to the current move.

[0162] The mirror-related conditions for position-related moves may include, but are not limited to:

[0163] 1. Chess Piece Configuration Requirements

[0164] 1) The position of the move to be identified relative to the nearest corner of the board.

[0165] 2) Using the nearest corner of the board where the move to be identified is to be taken as the center of the relative position relationship (i.e., using the rectangular coordinate system with the nearest corner of the board where the move to be identified is to be taken as the origin as the reference system), it is required that there are pieces of the same color and different colors.

[0166] 3) The nearest corner of the board to the move to be identified is the center of the relative position relationship, and the same color and different color pieces are prohibited.

[0167] 4) The nearest corner of the board to the move to be identified is the center of the relative position relationship. It is forbidden to have pieces of the same color and different colors at the same time.

[0168] In actual chess games, the same move may be described with different terms in different situations. For example, the move "stick" may be called "second-line stick" when it is on the second line of the board, and "tiger's mouth stick" when it is in the tiger's mouth position. Based on this, in the embodiments of this application, different move terms in the move terminology library correspond to different moves, or different move terms correspond to the same move in different situations.

[0169] When prioritizing move terms, the order of different move terms corresponding to the same move may be consecutive or non-consecutive. For example, "Second Path Sticky" and "Tiger Mouth Sticky" may be ranked 13th and 14th respectively among all move terms, or one may be ranked 12th and the other 25th, etc.

[0170] Based on this, this application can distinguish different situations of the same move, further improving the accuracy of move terminology identification.

[0171] To further improve the efficiency of move term recognition, in an optional embodiment, when the accuracy of move terms recognized according to the first sort is equal to the accuracy of move terms recognized according to the second sort, the priority of move terms can be determined based on at least one of the computational cost of the move term recognition process and the frequency of occurrence of move terms. The lower the computational cost of the move term recognition process, the higher the priority of the move term; the higher the frequency of occurrence of the move term, the higher the priority of the move term.

[0172] In other words, the priority of move terms is negatively correlated with the computational cost of the move term recognition process, and / or the priority of move terms is positively correlated with the frequency of their occurrence.

[0173] Corresponding to the method embodiments, this application also provides a chess-playing robot, which includes a display module and a processor;

[0174] The display module is used to display the chessboard and the chess pieces on it.

[0175] The processor can be used to play against a user on a chessboard, and it can also be used to identify the move term to which the move to be identified belongs based on the chess move term recognition method described above.

[0176] Optionally, when the processor receives a user-triggered post-game analysis command for a target game, it can also perform a post-game analysis of the target game based on the aforementioned post-game analysis method to determine key moves. These key moves may include good moves, bad moves, etc.

[0177] Optionally, the processor can also be used to identify move terms by determining the key moves as the moves to be identified.

[0178] The chess-playing robot provided in this application determines whether a move belongs to a certain move term based on pre-set conditions and recognition order for each move term. The pre-set conditions for move terms consider multiple dimensions, and the recognition process takes into account the impact of the recognition order on accuracy. Therefore, it can improve the accuracy of move term recognition. Furthermore, it can improve the accuracy of game analysis.

[0179] This application also provides an electronic device in its embodiments. (See reference...) Figure 7 The diagram illustrates a structural schematic of an electronic device suitable for implementing embodiments of this application. The electronic device in these embodiments may be a terminal device, which can be a chess-playing robot, or an electronic device with chess-playing functionality, game replay analysis functionality, and other functions. Figure 7 The electronic device shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of this application.

[0180] like Figure 7 As shown, the electronic device may include a processing unit (e.g., a central processing unit, a graphics processing unit, etc.) 701, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 702 or a program loaded from a storage device 708 into a random access memory (RAM) 703. When the electronic device is powered on, the RAM 703 also stores various programs and data required for the operation of the electronic device. The processing unit 701, ROM 702, and RAM 703 are interconnected via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0181] Typically, the following devices can be connected to I / O interface 705: input devices 706 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 707 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 708 including, for example, memory cards, hard drives, etc.; and communication devices 709. Communication device 709 allows electronic devices to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 7 Electronic devices with various devices are shown, but it should be understood that it is not required to implement or have all of the devices shown. More or fewer devices may be implemented or have alternatively.

[0182] This application also provides a computer program product including computer-readable instructions, which, when executed on an electronic device, cause the electronic device to implement any of the chess move terminology recognition methods provided in this application.

[0183] This application also provides a computer-readable storage medium that carries one or more computer programs. When the one or more computer programs are executed by an electronic device, the electronic device can implement any of the chess move term recognition methods provided in this application.

[0184] It is understood that before using the technical solutions disclosed in the various embodiments of this disclosure, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in this disclosure in an appropriate manner in accordance with relevant laws and regulations, and user authorization should be obtained.

[0185] It should be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. In addition, in the device embodiment drawings provided in this application, the connection relationship between modules indicates that they have a communication connection, which can be implemented as one or more communication buses or signal lines.

[0186] Through the above description of the embodiments, those skilled in the art can clearly understand that this application can be implemented by means of software plus necessary general-purpose hardware, or it can be implemented by special-purpose hardware including application-specific integrated circuits, special-purpose CPUs, special-purpose memory, special-purpose components, etc. Generally, any function performed by a computer program can be easily implemented by corresponding hardware, and the specific hardware structure used to implement the same function can also be diverse, such as analog circuits, digital circuits, or special-purpose circuits. However, for this application, software program implementation is more often a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium, such as a computer floppy disk, USB flash drive, mobile hard disk, ROM, RAM, magnetic disk, or optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, training equipment, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0187] In the above embodiments, the functionality can be implemented entirely or partially through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented entirely or partially as a computer program product. Those skilled in the art can use different methods to implement the described functions for each specific solution, but such implementation should not be considered beyond the scope of this application.

[0188] The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, training device, or data center to another website, computer, training device, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that a computer can store or a data storage device such as a training device or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state drives (SSDs)).

[0189] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other.

[0190] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for identifying a chess move term, characterized by, The method comprises the following steps: obtaining candidate move terms associated with the to-be-identified chess step from a move term library, wherein the move term library stores move terms, conditions to be met by the move terms, and priorities of the move terms, wherein each condition to be met by the move terms comprises one or more dimensional conditions, and the priorities of the move terms are determined based on at least the following principle: for any two move terms, if the accuracy of the move term identified according to a first order is not lower than the accuracy of the move term identified according to a second order, then the priority of the move term ranked higher in the first order is higher than the priority of the move term ranked lower in the first order; judging whether the to-be-identified chess step belongs to one of the candidate move terms according to the priorities of the move terms from high to low, and based on the conditions to be met by the move terms.

2. The method of claim 1, wherein, The move terms in the move term library are divided into multiple move groups, each move group corresponds to a basic condition, and the basic condition is a common condition to be met by the move terms in the move group, the move terms in different move groups are different, and the basic conditions corresponding to different move groups are different. Correspondingly, the process of obtaining candidate move terms associated with the to-be-identified chess step from the move term library and judging whether the to-be-identified chess step belongs to one of the candidate move terms comprises: judging whether the to-be-identified chess step meets the basic conditions corresponding to each move group; determining the move terms in the move group corresponding to the basic condition met by the to-be-identified chess step as the candidate move terms; judging whether the to-be-identified chess step belongs to one of the candidate move terms according to the priorities of the move terms from high to low, and based on the non-basic conditions to be met by the move terms.

3. The method according to claim 1 or 2, characterized in that, The process of judging whether the to-be-identified chess step belongs to any candidate move term comprises: obtaining the move type to which the any candidate move term belongs; judging whether the to-be-identified chess step belongs to the any candidate move term based on the conditions to be met by the any candidate move term and through the judgment process corresponding to the move type.

4. The method of claim 3, wherein, The move type to which the move term belongs comprises the following four types: eating, eating, ordinary move, and position-related move.

5. The method of claim 4, wherein, The move terms of the eating type include eating, and the process of judging whether the to-be-identified chess step belongs to the move term of the eating type according to the judgment process corresponding to the eating type comprises: judging whether there is a different color piece at the adjacent point of the landing point of the to-be-identified chess step in the up, down, left, and right directions of the landing point of the to-be-identified chess step; if there is no adjacent different color piece, it is determined that the to-be-identified chess step does not belong to the move term of the eating type; if there is an adjacent different color piece, the number of changes of the qi of each chess piece where the adjacent different color piece is located before and after the landing of the to-be-identified chess step is calculated, if the number of qi of one chess piece changes from qi to no qi, it is determined that the to-be-identified chess step belongs to the move term of the eating type, otherwise, it is determined that the to-be-identified chess step does not belong to the move term of the eating type.

6. The method of claim 4, wherein, The move type is a hitting and eating move. The move type hitting and eating and double hitting and eating are determined according to the judgment flow corresponding to the move type hitting and eating. The judgment flow comprises: Judging whether there is a different color piece at the adjacent point of the landing point of the to-be-identified chess step in the up, down, left and right directions of the landing point of the to-be-identified chess step; If there is no adjacent different color piece, it is determined that the to-be-identified chess step does not belong to the move type hitting and eating or the move type double hitting and eating; If there is an adjacent different color piece, the number of qi of each chess piece where the adjacent different color piece is located is calculated before and after the landing of the to-be-identified chess step. If only one chess piece changes from two qi to one qi, it is determined that the to-be-identified chess step belongs to the move type hitting and eating. If two chess pieces change from two qi to one qi, it is determined that the to-be-identified chess step belongs to the move type double hitting and eating. If no chess piece changes from two qi to one qi, it is determined that the to-be-identified chess step does not belong to the move type hitting and eating or the move type double hitting and eating.

7. The method of claim 4, wherein, For any move term, if the move type of the any move term is the target move type, the target move type is the ordinary move or the position-related move, and the judgment flow corresponding to the target move type is used to determine whether the to-be-identified chess step belongs to the any move term, which comprises: Judging whether the to-be-identified chess step meets each non-mirror-related condition that the any move term should meet; If the to-be-identified chess step does not meet any non-mirror-related condition that the any move term should meet, it is determined that the to-be-identified chess step does not belong to the any move term; If the to-be-identified chess step meets all the non-mirror-related conditions that the any move term should meet, it is judged whether the to-be-identified chess step meets each mirror-related condition that the any move term should meet in one mirror direction; If the to-be-identified chess step meets each mirror-related condition that the any move term should meet in one mirror direction, it is determined that the to-be-identified chess step belongs to the any move term. If the to-be-identified chess step does not meet any mirror-related condition that the any move term should meet in each mirror direction, it is determined that the to-be-identified chess step does not belong to the any move term.

8. The method of claim 7, wherein, if the target move type is the ordinary move, and the position of a chess piece or the relative position relationship between chess pieces needs to be determined, the position of the chess piece or the relative position relationship between the chess pieces is determined based on a rectangular coordinate system with the landing point of the to-be-identified chess step as the origin; if the target move type is the position-related move, and the position of a chess piece or the relative position relationship between chess pieces needs to be determined, the position of the chess piece or the relative position relationship between the chess pieces is determined based on a rectangular coordinate system with the chessboard corner closest to the landing point of the to-be-identified chess step as the origin.

9. The method of claim 1, wherein, In the move term library, different move terms correspond to different moves, or different move terms correspond to the same move under different conditions.

10. The method of claim 1, wherein, The conditions that each move term should meet include at least one of the following dimensions: The positional relationship between the chess pieces, the position of the chess pieces relative to the chessboard, the order of the hand, the move of the previous chess step, the qi of the chess pieces, and whether certain chess pieces should appear simultaneously.

11. The method of claim 1, wherein, In the case where the accuracy of the move term identified according to the first sorting is equal to the accuracy of the move term identified according to the second sorting, the priority of the move term is negatively correlated with the computing power consumption of the identification process of the move term, and / or the priority of the move term is positively correlated with the frequency of occurrence of the move term.

12. A computer program product, characterised in that, The computer readable instructions, when executed on an electronic device, cause the electronic device to implement the chess move term identification method according to any one of claims 1 to 11.

13. An electronic device, comprising: The electronic device includes at least one processor and a memory connected to the processor, wherein: The memory is used to store a computer program; The processor is used to execute the computer program to enable the electronic device to implement the chess move term identification method according to any one of claims 1 to 11.

14. A computer storage medium, characterized in that The storage medium carries one or more computer programs, which, when executed by an electronic device, can enable the electronic device to implement the chess move term identification method according to any one of claims 1 to 11.

15. A chess playing robot, characterized in that, It includes: It includes a display module and a processor; The display module is used to display the chessboard and the chess pieces on the chessboard; The processor is used to play against the user based on the chessboard, and the processor is also used to implement the chess move term identification method according to any one of claims 1 to 11.

Images