Go teaching method and device, electronic equipment and storage medium

Abstract

The embodiment of the invention provides a go teaching method and device, electronic equipment and a storage medium, and the method comprises the steps: sending a to-be-learned go knowledge point to a server, and obtaining a teaching material corresponding to the go knowledge point from the server; analyzing the teaching materials of the server side to obtain at least one reference chess piece placing position of each reference moving step in the target chessboard, and repeatedly executing the matching step of each to-be-analyzed moving step in the target chessboard in sequence until the actual chess piece placing position of each to-be-analyzed moving step is not matched with the reference chess piece placing position, the single-machine question-doing analysis result of the teaching material is obtained based on the matching analysis result of each to-be-analyzed moving step in the target chessboard and the actual chessboard falling position, in addition, analysis can be executed based on the multiple single-machine question-doing analysis results of the teaching material, and the comprehensive question-doing analysis result of the teaching material is obtained. Therefore, according to the scheme, each to-be-analyzed moving step in the question answering process can be accurately and quickly analyzed, so that real-time question answering interaction is provided, and the learning experience is improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the technical field of online Go teaching, and in particular to a Go teaching method, device, electronic device and storage medium. Background Art

[0002] Go is an excellent thinking training activity. By learning Go, you can strengthen the orderliness and logic of thinking, help children concentrate, and cultivate children's ability to think independently and solve problems independently.

[0003] Existing online Go teaching technology usually adopts the method of large-class teaching. Although it can achieve large-scale and automated teaching, it is impossible to conduct real-time interaction and analysis of interaction results in Go practice, and it is difficult to improve learning efficiency. Summary of the invention

[0004] In view of this, the embodiments of the present application provide a Go teaching method, device, electronic device and storage medium to at least partially solve the above problems.

[0005] According to a first aspect of an embodiment of the present application, a Go teaching method is provided, which is applied to a client, comprising: sending a Go knowledge point to be learned to a server, and obtaining teaching materials corresponding to the Go knowledge point from the server; parsing the teaching materials on the server to obtain at least one reference drop position for each reference move in a target chessboard; sequentially obtaining an actual drop position of a move to be analyzed in the target chessboard, wherein each move to be analyzed in the target chessboard is obtained by executing a problem-solving program of the target chessboard; executing a move to be analyzed matching step, comprising: obtaining a reference drop position from the target chessboard; obtaining a reference drop position for each reference move in ... Among the reference moving steps, a target moving step corresponding to the moving step to be analyzed is determined, and the actual position of the moving step to be analyzed is matched with each reference position of the target moving step. If the actual position matches any reference position, the step of sequentially obtaining the actual position of a moving step to be analyzed in the target chessboard is returned until the actual position does not match each reference position. Based on the matching analysis results and the actual position of each moving step to be analyzed in the target chessboard, the single-machine problem-solving analysis results of the teaching material are obtained.

[0006] According to the second aspect of the embodiment of the present application, a Go teaching method is provided, which is applied to a server, and includes: obtaining multiple stand-alone problem-solving analysis results corresponding to teaching materials for multiple clients, wherein the stand-alone problem-solving analysis result corresponding to the teaching material for each client is obtained by executing the Go teaching method described in the first aspect above; analyzing each stand-alone problem-solving analysis result to obtain a comprehensive problem-solving analysis result of the teaching material.

[0007] According to a third aspect of the embodiment of the present application, a Go teaching device is provided, which is applied to a client, and includes: a material acquisition module, which is used to send Go knowledge points to be learned to a server, and obtain teaching materials corresponding to the Go knowledge points from the server; a first parsing module, which is used to parse the teaching materials on the server, and obtain at least one reference drop position for each reference move step in a target chessboard; a first acquisition module, which is used to sequentially obtain the actual drop position of a move step to be analyzed in the target chessboard, wherein each move step to be analyzed on the target chessboard is obtained by executing a problem-solving program of the target chessboard; a first execution module, which is used to execute the matching of the move step to be analyzed. The matching step comprises: determining a target moving step corresponding to the moving step to be analyzed from each reference moving step of the target chessboard, matching the actual position of the moving step to be analyzed with each reference position of the target moving step, and if the actual position matches any reference position, returning to the step of sequentially obtaining the actual position of the moving step to be analyzed in the target chessboard until the actual position does not match each reference position; a first analysis module is used to obtain the single-machine problem-solving analysis result of the teaching material based on the matching analysis result and the actual position of each moving step to be analyzed in the target chessboard.

[0008] According to the fourth aspect of the embodiment of the present application, a Go teaching device is provided, which is applied to a server, and includes: a second acquisition module, used to obtain multiple stand-alone problem-solving analysis results corresponding to teaching materials of multiple clients, wherein the stand-alone problem-solving analysis result of each client corresponding to the teaching material is obtained by executing the Go teaching method described in the first aspect above or by the Go teaching device described in the third aspect; a second analysis module, used to analyze each stand-alone problem-solving analysis result to obtain a comprehensive problem-solving analysis result of the teaching material.

[0009] According to the fifth aspect of the embodiment of the present application, an electronic device is provided, comprising: a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface communicate with each other through the communication bus; the memory is used to store at least one executable instruction, and the executable instruction enables the processor to perform an operation corresponding to any one of the Go teaching methods described above.

[0010] According to a sixth aspect of an embodiment of the present application, there is provided a computer storage medium on which a computer program is stored, and when the program is executed by a processor, any of the above-mentioned Go teaching methods is implemented.

[0011] According to the Go teaching solution provided in each embodiment of the present application, the client can obtain the reference positions of each reference moving step in the target chessboard by parsing the teaching materials of the server, and can quickly obtain the matching results of each moving step to be analyzed by comparing the actual moving position of each moving step to be analyzed with the reference moving position, thereby realizing real-time teaching interaction in a single-machine Go teaching scenario and improving the Go teaching effect.

[0012] According to the Go teaching solution provided in each embodiment of the present application, by obtaining the analysis results of each single-machine problem solving of each client corresponding to the same teaching material, the moves that are prone to errors in the teaching material can be comprehensively analyzed to improve the objectivity and accuracy of the problem solving results of the teaching material, which is conducive to improving the effect of online Go teaching. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the embodiments of the present application. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0014] Figure 1 is a flow chart of a Go teaching method according to an embodiment of the present application;

[0015] FIG. 2A to FIG. 2B For implementation Figure 1 The application example diagram of the Go teaching method shown;

[0016] Figure 3 is a flow chart of another Go teaching method according to an embodiment of the present application;

[0017] Figure 4 is a schematic diagram of a Go teaching device according to an embodiment of the present application;

[0018] Figure 5 is a schematic diagram of another Go teaching device according to an embodiment of the present application;

[0019] Figure 6 It is a schematic diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0020] Go Teaching Methods

[0021] The embodiment of the present application provides a Go teaching method, which can be applied to online Go teaching, etc. The embodiment of the present application is not limited to this. Through this method, efficient real-time interaction and personalized feedback can be achieved on the student side during the online Go teaching process.

[0022] Figure 1 1 is a flow chart of a Go teaching method according to an embodiment of the present application. The Go teaching method according to the present embodiment is applied to a client. In some embodiments, the client may be, for example, an electronic device such as a smart phone, a smart tablet, or a laptop computer.

[0023] like Figure 1 As shown, the Go teaching method of this embodiment includes the following steps:

[0024] Step 101: Send the Go knowledge points to be learned to the server, and obtain teaching materials corresponding to the Go knowledge points from the server.

[0025] In some embodiments, the client may be a student terminal and the server may be a teaching terminal. Multiple clients may establish a long link with the same server, establish a message communication mechanism through the long link, send Go knowledge points to be learned to the server, and the server conducts online Go teaching based on the Go knowledge points to be learned by the client. After the Go teaching on the server is finished, the client may obtain the teaching materials corresponding to the Go knowledge points sent by the server based on the long link.

[0026] In some embodiments, the teaching material may include Go exercises associated with Go knowledge points and answer information corresponding to the Go exercises. The Go exercises include a target chessboard, and the answer information includes at least one chess piece move sequence corresponding to the target chessboard and an answer result corresponding to the chess piece move sequence, such as correct and wrong; the types of Go exercises may include multiple-choice questions, judgment questions, automatic response questions, and diagram questions.

[0027] Step 102: parse the teaching material to obtain at least one reference chess piece placement position for each reference move step in the target chessboard.

[0028] In some embodiments, after receiving the teaching material from the server, the client can parse the teaching material to obtain the target chessboard and the chess piece move sequence of the target chessboard, and based on the chess piece move sequence of the target chessboard, obtain each reference chess piece position for each reference moving step in the target chessboard.

[0029] In some embodiments, the execution order of each reference moving step in a chess piece move sequence and each reference position of each reference moving step can be identified, and each reference position can be used as a storage node. According to the execution order of the reference moving step of each reference position, the node level of each storage node is determined to construct a tree storage structure of the chess piece move sequence.

[0030] In some embodiments, at least one reference position of each reference move in the target chessboard can be determined based on the constructed tree storage structure. As an example, taking the Go exercises corresponding to the teaching material as the picture arrangement problem, the coding information of the teaching material is as follows:

[0031] sgf="(;CA[UTF-8]AB[aa][bb]AW[cc][dd]SZ

[19] ;B[kj];W[ob](;B[ge];W[ed];B[ec])(;B[fd];W[fe]))

[0032] In the above teaching materials, the client can parse the teaching materials, obtain the target chessboard and the chess move sequence of the target chessboard, and render the target chessboard in the client interface for visual display. Among them, according to "CA[UTF-8]", it can be determined that the encoding method of the target chessboard is UTF-8 encoding; according to "SZ

[19] ", it can be determined that the chessboard size of the target chessboard is 19*19; according to the encoding information of "AB[aa][bb]AW[cc][dd]", the position of each black piece and the position of each white piece in the target chessboard can be determined (refer to Figure 2A ).

[0033] According to the coded information of "B[kj]; W[ob](; B[ge]; W[ed]; B[ec])(; B[fd]; W[fe])" (i.e., the chess piece move sequence of the target chessboard), a tree storage structure of the target chessboard can be constructed. For example, the "root node" of the target chessboard can be constructed first, and each reference position in the chess piece move sequence can be used as a storage node. According to the execution order of the reference move steps of each reference position, the node level of each storage node can be determined, and the following can be obtained: Figure 2B The tree storage structure shown.

[0034] In this embodiment, each node level in the tree storage structure corresponds to the execution order of each reference move step of the target chessboard. For example, the "first level node layer" in the tree storage structure may correspond to the first reference move step of the target chessboard, the "second level node layer" may correspond to the second reference move step of the target chessboard, and so on.

[0035] Step 103: sequentially obtain the actual placement position of a moving step to be analyzed in the target chessboard.

[0036] In this embodiment, each move to be analyzed of the target chessboard is obtained by executing the problem-solving program of the target chessboard.

[0037] In some embodiments, the problem-solving program of the target chessboard may include a human-computer game program.

[0038] Specifically, the client can perform semi-automatic human-computer chess operations based on the reference positions of each reference moving step obtained by parsing step 101. Among them, each reference moving step of the target chessboard includes multiple automatic moving steps and multiple non-automatic moving steps that are executed alternately, and each node level in the tree storage structure includes each automatic execution node level corresponding to each automatic moving step and each non-automatic execution node level corresponding to each non-automatic moving step. Here, the automatic moving step can be understood as a move operation automatically executed by the client, and the non-automatic moving step can be understood as a move operation performed manually. Each node level in the tree storage structure includes both the node level of each automatic moving step and the node level of each non-automatic moving step.

[0039] For example, in Figure 2B In the example shown, if each move of the black piece is determined to be a non-automatic move step and each move of the white piece is determined to be an automatic move step, then the first-level node layer, the third-level node layer, and the fifth-level node layer corresponding to the black piece (B) are non-automatic execution node layers, and the second-level node layer and the fourth-level node layer corresponding to the white piece (W) are automatic execution node layers.

[0040] In some embodiments, the client can execute the human-computer chess program for the target chessboard in the following manner: according to the execution process of the target chessboard, determine the target node level corresponding to the current move step of the target chessboard from each node level of the tree storage structure; if the target node level is an automatic execution node level, retrieve the reference drop position of any storage node of the target node level, and determine any reference drop position as the actual drop position of the current move step to automatically execute the current move step; or if the target node level is a non-automatic execution node level, retrieve the reference drop position of each storage node of the target node level, and in response to the drop confirmation request of the current move step, collect the actual drop position of the current move step.

[0041] As an example, in Figure 2B In the example shown, if the target node level corresponding to the current moving step of the target chessboard is the second-level node level (i.e., the automatic execution node level), the reference drop position "W[ob]" of the storage node corresponding to the second-level node level is retrieved as the actual drop position of the current moving step, and the automatic drop operation of the current moving step is performed accordingly; if the target node level corresponding to the current moving step of the target chessboard is the first-level node level (i.e., the non-automatic execution node level), the reference drop position (i.e., B[kj]) of the storage node corresponding to the first node level is retrieved, and in response to the drop confirmation request of the current moving step, the actual drop position of the current moving step is collected.

[0042] In some embodiments, each move to be analyzed in the target chessboard can be determined by real-time analysis, which includes: during the execution of the problem-solving program of the target chessboard, the current move of the target chessboard is analyzed in real time. If the current move is a non-automatic move, the current move is determined as the move to be analyzed.

[0043] In some embodiments, each move to be analyzed in the target chessboard can be determined by a post-analysis method, which includes: after the problem-solving program of the target chessboard is completed, analyzing each actual move in the target chessboard, and determining each actual move that is a non-automatic move as each move to be analyzed in the target chessboard.

[0044] In some embodiments, when the target chessboard completes the move operation, the position of the moving step to be analyzed corresponding to the move operation on the screen is obtained, and the actual move position of the moving step to be analyzed on the target chessboard is determined according to the position of the moving step to be analyzed on the screen and the size of the target chessboard.

[0045] Step 104: Determine a target moving step corresponding to the moving step to be analyzed from each reference moving step of the target chessboard, and match the actual position of the moving step to be analyzed with each reference position of the target moving step.

[0046] In some embodiments, each target node corresponding to the moving step to be analyzed may be determined from each storage node of the tree storage structure, and the actual drop position of the moving step to be analyzed may be matched with the reference drop position stored in each target node.

[0047] In some embodiments, the previous reference moving step of the moving step to be analyzed can be determined as the previous moving step, a storage node hit by the previous moving step in the tree storage structure can be determined as the previous node, and each child node under the previous node can be determined as each target node of the moving step to be analyzed.

[0048] Exemplarily, assuming that the storage node (predecessor node) hit by the predecessor moving step of the moving step to be analyzed is "W[ob]", then each child node "B[ge]" and "B[fd]" under the storage node "W[ob]" is the target node of the moving step to be analyzed.

[0049] The actual drop position of the moving step to be analyzed can be matched with each target node to obtain a matching result of the moving step to be analyzed.

[0050] Step 105, determine whether the actual drop position of the moving step to be analyzed matches the reference drop position, if so, return to step 103, if not, execute step 106.

[0051] In this embodiment, when the actual placement position of the moving step to be analyzed matches the reference placement position of any target node, it is possible to further query whether the target node hit by the moving step to be analyzed has a child node. If the target node hit by the moving step to be analyzed has a child node, return to step 102 to obtain the actual placement position of the next moving step to be analyzed in the target chessboard; if the target node hit by the moving step to be analyzed has no child node, execute step 105.

[0052] In this embodiment, if the actual drop position of the moving step to be analyzed does not match the reference drop position of each target node, step 106 is directly executed.

[0053] Step 106: Based on the matching analysis results and actual placement positions of each move to be analyzed in the target chessboard, the stand-alone problem-solving analysis results of the teaching material are obtained.

[0054] In some embodiments, the matching analysis results of each move to be analyzed in each target chessboard can be identified to obtain a single-step problem-solving analysis result of each move to be analyzed. For example, if the actual position of the move to be analyzed matches any reference position, a single-step problem-solving analysis result of "correct move (e.g., C[0])" is obtained for the move to be analyzed; if the actual position of the move to be analyzed does not match any reference position, a single-step problem-solving analysis result of "incorrect move (e.g., C[1])" is obtained for the move to be analyzed.

[0055] The single-machine problem analysis results of the teaching material can be obtained based on the actual placement positions of each move to be analyzed in the target chessboard and the single-step problem analysis results.

[0056] In some embodiments, when each move to be analyzed in the target chessboard is determined by real-time analysis, the game teaching program of the target chessboard can be ended when the current move to be analyzed is judged to be "incorrect move". Therefore, the stand-alone problem-solving analysis results of the teaching material include the actual placement position of each executed move to be analyzed and its single-step problem-solving analysis results.

[0057] In some embodiments, when each move to be analyzed in the target chessboard is determined by post-analysis, the matching step of the move to be analyzed can be terminated when the current move to be analyzed is judged to be "incorrect move", and the matching analysis is no longer performed for each subsequent move to be analyzed. Therefore, the single-machine problem analysis results of the teaching material include the actual placement positions of all the moves to be analyzed and the single-step problem analysis results of each move to be analyzed for which matching analysis has been performed.

[0058] In some embodiments, the client may send the stand-alone question analysis results of the teaching material to the server.

[0059] In an embodiment of the present application, by parsing the teaching materials on the server side and constructing a corresponding tree storage structure, each reference position of each reference move in the target chessboard can be quickly and efficiently retrieved and identified to improve the execution efficiency of the human-computer problem-solving program, and rapid matching analysis of each move to be analyzed in the target chessboard can be achieved to provide real-time game teaching interaction, which can enhance the interactivity and learning experience in the Go teaching process and improve the learning effect.

[0060] Go Teaching Methods

[0061] Figure 3 This is a processing flow of a Go teaching method according to another embodiment of the present application. The Go teaching method according to this embodiment can be applied to a server. Through the method according to this embodiment, the teaching end (server) can analyze the results according to the feedback information of the student end (client) during the online Go teaching process, including the following steps:

[0062] Step 401: Obtain analysis results of multiple stand-alone questions corresponding to teaching materials from multiple clients.

[0063] In this embodiment, the analysis results of each single machine are obtained by executing the above Figure 1 The Go teaching method embodiment shown is obtained.

[0064] In some embodiments, the server can be a teaching end, and the server can obtain the actual placement position of each move step of at least one client in answering the teaching materials sent by the server when the human-computer problem-solving program ends, and obtain the single-step problem-solving analysis result of the last move step to be analyzed in each game result.

[0065] Step 402: Analyze the analysis results of each single-machine question-solving to obtain the comprehensive analysis results of the teaching material.

[0066] Analyze the single-step problem-solving analysis result of the last moving step to be analyzed in each problem-solving analysis result, perform statistical analysis on all single-step problem-solving analysis results, and obtain a comprehensive problem-solving analysis result of the target chessboard.

[0067] In some embodiments, the comprehensive problem-solving result of the target chessboard is obtained by analyzing the single-step problem-solving analysis result of the last move to be analyzed in each game result.

[0068] Specifically, due to Figure 1In the Go teaching method, when the actual position of the move to be analyzed does not match the position of each reference path, the matching step of the move to be analyzed is ended. Therefore, in the single-machine problem analysis result obtained, there may only be a single-step problem analysis result of "incorrect move" in the last move to be analyzed. Based on this, the server only needs to identify the single-step problem analysis result of the last move to be analyzed in each problem analysis result, and can count the wrong moves in the teaching material. Not only can the comprehensive problem analysis results of the teaching material be obtained efficiently, but also the system computing power of the server to perform analysis processing can be reduced, reducing the running load of the server and improving the processing efficiency.

[0069] Go teaching device

[0070] Corresponding to the above-mentioned Go teaching method embodiment, Figure 4 A schematic diagram of a Go teaching device according to an embodiment of the present application is shown. Figure 4 As shown, the Go teaching device 400 includes:

[0071] The material acquisition module 401 is used to send the Go knowledge points to be learned to the server, and obtain the teaching materials corresponding to the Go knowledge points from the server;

[0072] A first parsing module 402 is used to parse the teaching material to obtain at least one reference position of each reference moving step in the target chessboard;

[0073] The first acquisition module 403 is used to sequentially acquire the actual position of a move to be analyzed in the target chessboard, wherein each move to be analyzed in the target chessboard is obtained by executing the problem-solving program of the target chessboard;

[0074] The first execution module 404 is used to execute the step of matching the moving step to be analyzed, including: determining a target moving step corresponding to the moving step to be analyzed from each reference moving step of the target chessboard, matching the actual position of the moving step to be analyzed with each reference position of the target moving step, and if the actual position matches any of the reference positions, returning to the step of sequentially obtaining the actual position of the moving step to be analyzed in the target chessboard, until the actual position does not match any of the reference positions;

[0075] The first analysis module 405 is used to obtain the single-machine problem-solving analysis results of the teaching material based on the matching analysis results and the actual placement positions of each moving step to be analyzed in the target chessboard.

[0076] It should be noted that the Go teaching device of this embodiment is used to implement the corresponding Go teaching method in the aforementioned method embodiment, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0077] Go teaching device

[0078] Corresponding to the above-mentioned Go teaching method embodiment, Figure 5 A schematic diagram of a Go teaching device according to another embodiment of the present application is shown. Figure 5 As shown, the Go teaching device 500 comprises:

[0079] A second acquisition module 501 is used to acquire a plurality of single-machine problem solving analysis results corresponding to the teaching materials of a plurality of clients, wherein the single-machine problem solving analysis result corresponding to the teaching materials of each client is obtained by executing the Go teaching method according to any one of claims 1 to 5;

[0080] The second analysis module 502 is used to analyze the last moving step in each single-machine problem solving analysis result to obtain a comprehensive problem solving analysis result of the teaching material.

[0081] It should be noted that the Go teaching device of this embodiment is used to implement the corresponding Go teaching method in the aforementioned method embodiment, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0082] Electronic devices

[0083] Figure 6 A schematic diagram of the structure of an electronic device according to an embodiment of the present application is shown. The specific embodiment of the present application does not limit the specific implementation of the electronic device.

[0084] like Figure 6 As shown, the electronic device may include: a processor (processor) 602 , a communication interface (Communications Interface) 604 , a memory (memory) 606 , and a communication bus 608 .

[0085] in:

[0086] The processor 602 , the communication interface 604 , and the memory 606 communicate with each other via a communication bus 608 .

[0087] The communication interface 604 is used to communicate with other electronic devices or servers.

[0088] The processor 602 is used to execute the program 610, and specifically can execute the relevant steps in the above-mentioned Go teaching method embodiment.

[0089] Specifically, the program 610 may include program codes, which include computer operation instructions.

[0090] The processor 602 may be a central processing unit (CPU), or an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application. The one or more processors included in the smart device may be processors of the same type, such as one or more CPUs; or processors of different types, such as one or more CPUs and one or more ASICs.

[0091] The memory 606 is used to store the program 610. The memory 606 may include a high-speed RAM memory, and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory.

[0092] The program 610 may be specifically configured to enable the processor 602 to perform the following operations:

[0093] In an optional implementation, the program 610 is also used to enable the processor 602 to implement each step in the program 610. The specific implementation can refer to the corresponding steps and corresponding descriptions of the device in the above-mentioned Go teaching method embodiment, which will not be repeated here. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the above-described device and module can refer to the corresponding process description in the above-mentioned method embodiment, which will not be repeated here.

[0094] An embodiment of the present application also provides a computer program product, including computer instructions, which instruct a computing device to execute operations corresponding to any one of the Go teaching methods in the above-mentioned multiple method embodiments.

[0095] It should be pointed out that, according to the needs of implementation, the various components / steps described in the embodiments of the present application can be split into more components / steps, or two or more components / steps or partial operations of components / steps can be combined into new components / steps to achieve the purpose of the embodiments of the present application.

[0096] The above-mentioned method according to the embodiment of the present application can be implemented in hardware, firmware, or implemented as software or computer code that can be stored in a recording medium (such as CD ROM, RAM, floppy disk, hard disk or magneto-optical disk), or implemented as a computer code originally stored in a remote recording medium or a non-temporary machine-readable medium downloaded through a network and stored in a local recording medium, so that the method described herein can be stored in such software processing on a recording medium using a general-purpose computer, a special-purpose processor or programmable or special-purpose hardware (such as ASIC or FPGA). It can be understood that a computer, a processor, a microprocessor controller or programmable hardware includes a storage component (e.g., RAM, ROM, flash memory, etc.) that can store or receive software or computer code, and when the software or computer code is accessed and executed by a computer, a processor or hardware, the go teaching method described herein is implemented. In addition, when a general-purpose computer accesses a code for implementing the go teaching method shown here, the execution of the code converts the general-purpose computer into a special-purpose computer for executing the go teaching method shown here.

[0097] Those of ordinary skill in the art will appreciate that the units and method steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the embodiments of the present application.

[0098] The above implementation methods are only used to illustrate the embodiments of the present application, and are not limitations on the embodiments of the present application. Ordinary technicians in the relevant technical field can make various changes and modifications without departing from the spirit and scope of the embodiments of the present application. Therefore, all equivalent technical solutions also belong to the scope of the embodiments of the present application. The scope of patent protection of the embodiments of the present application should be limited by the claims.

Claims

1. A Go teaching method, characterized in that: Applied to a client, the method comprises: Sending the Go knowledge points to be learned to the server, and obtaining teaching materials corresponding to the Go knowledge points from the server; Parsing the teaching material to obtain at least one reference chess piece drop position for each reference move step in the target chessboard; Sequentially obtaining the actual position of a move to be analyzed in the target chessboard, wherein each move to be analyzed in the target chessboard is obtained by executing the problem-solving program of the target chessboard; The step of performing matching of the moving step to be analyzed includes: determining a target moving step corresponding to the moving step to be analyzed from each reference moving step of the target chessboard, matching the actual position of the moving step to be analyzed with each reference position of the target moving step, and if the actual position matches any of the reference positions, returning to the step of sequentially obtaining the actual position of the moving step to be analyzed in the target chessboard until the actual position does not match any of the reference positions; Based on the matching analysis results and actual placement positions of each moving step to be analyzed in the target chessboard, the analysis results of the teaching material are obtained.

2. The method according to claim 1, characterized in that The step of parsing the teaching material to obtain at least one reference chess piece drop position for each reference moving step in the target chessboard includes: Parsing the teaching material on the server to obtain the target chessboard and the chess piece move sequence on the target chessboard; Based on the chess piece movement sequence of the target chessboard, each reference chess piece drop position of each reference moving step in the target chessboard is obtained.

3. The method according to claim 2, characterized in that The step of obtaining each reference chess piece position of each reference moving step on the target chess piece board based on the chess piece moving sequence on the target chess piece board comprises: Identify the execution order of each reference moving step in the chess piece move sequence and each reference drop position of each reference moving step; Each reference chess piece drop position is taken as a storage node, and the node level of each storage node is determined according to the execution order of the reference movement steps of each reference chess piece drop position, so as to construct a tree storage structure of the chess piece move sequence.

4. The method according to claim 3, characterized in that The problem-solving program of the target chessboard includes a human-computer chess program, each reference move step of the target chessboard includes a plurality of automatic moves and a plurality of non-automatic moves that are executed alternately, and each node level in the tree storage structure includes each automatic execution node level corresponding to each automatic move step and each non-automatic execution node level corresponding to each non-automatic move step; And wherein, the human-computer chess program of the target chessboard is executed in the following manner: According to the execution process of the target chessboard, determining a target node level corresponding to a current moving step of the target chessboard from each node level of the tree storage structure; If the target node level is an automatic execution node level, retrieve a reference drop position of any storage node of the target node level, and determine the any reference drop position as the actual drop position of the current moving step to automatically execute the current moving step; or If the target node level is a non-automatic execution node level, the reference drop position of each storage node of the target node level is retrieved, and in response to the drop confirmation request of the current moving step, the actual drop position of the current moving step is collected.

5. The method according to claim 4, characterized in that The moves to be analyzed on the target chessboard are obtained in the following manner: During the execution of the problem-solving program of the target chessboard, the current moving step of the target chessboard is analyzed in real time, and if the current moving step is a non-automatic moving step, the current moving step is determined as a moving step to be analyzed; or After the execution of the problem-solving program of the target chessboard is completed, each actual moving step in the target chessboard is analyzed, and each actual moving step that is a non-automatic moving step is determined as each moving step to be analyzed of the target chessboard.

6. The method according to any one of claims 2 to 5, characterized in that The step of performing the matching of the moving steps to be analyzed comprises: Determine each target node corresponding to the moving step to be analyzed from each storage node of the tree storage structure; The actual drop position of the moving step to be analyzed is matched with the reference drop position stored in each target node; wherein, If the actual chess piece drop position matches any reference chess piece drop position, query whether the target node hit by the moving step to be analyzed has a child node, wherein if so, return to the step of sequentially obtaining the actual chess piece drop position of each moving step to be analyzed in the target chessboard; if not, execute the step of obtaining the single-machine problem-solving analysis result of the teaching material based on the matching analysis result and the actual chess piece drop position of each moving step to be analyzed in the target chessboard; or If the actual chess piece placement position does not match any of the reference chess piece placement positions, the step of obtaining the single-machine problem-solving analysis result of the teaching material based on the matching analysis result of each to-be-analyzed moving step in the target chessboard and the actual chess piece placement position is performed.

7. The method according to claim 1, characterized in that The step of obtaining the single-machine analysis result of the teaching material based on the matching analysis result and the actual position of each move to be analyzed in the target chessboard includes: Identify the matching analysis results of each move to be analyzed in each of the target chessboards, and obtain the single-step problem-solving analysis results of each move to be analyzed; According to the actual placement positions of each moving step to be analyzed in the target chessboard and the single-step problem analysis results, the single-machine problem analysis results of the teaching material are obtained.

8. A Go teaching method, characterized in that: Applied to the server, the method includes: Acquire multiple stand-alone problem solving analysis results corresponding to the teaching materials of multiple clients, wherein the stand-alone problem solving analysis result corresponding to the teaching materials of each client is obtained by executing the Go teaching method according to any one of claims 1 to 7; Analyze the analysis results of each single-machine question-solving to obtain the comprehensive analysis results of the teaching material.

9. The method according to claim 8, characterized in that The analysis of each single-machine question analysis result to obtain a comprehensive question analysis result of the teaching material includes: Analyze the single-step problem-solving analysis result of the last moving step to be analyzed in each problem-solving analysis result to obtain a comprehensive problem-solving analysis result of the target teaching material.

10. A Go teaching device, characterized in that: Applied to the client, including: A material acquisition module, used to send the Go knowledge points to be learned to the server, and obtain teaching materials corresponding to the Go knowledge points from the server; A first parsing module is used to parse the teaching material on the server side to obtain at least one reference chess piece placement position for each reference moving step in the target chessboard; A first acquisition module is used to sequentially acquire the actual position of a move to be analyzed in the target chessboard, wherein each move to be analyzed in the target chessboard is obtained by executing the problem-solving program of the target chessboard; The first execution module is used to execute the step of matching the moving step to be analyzed, including: determining a target moving step corresponding to the moving step to be analyzed from each reference moving step of the target chessboard, matching the actual position of the moving step to be analyzed with each reference position of the target moving step, and if the actual position matches any reference position, returning to the step of sequentially obtaining the actual position of the moving step to be analyzed in the target chessboard, until the actual position does not match any reference position; The first analysis module is used to obtain the single-machine problem-solving analysis results of the teaching material based on the matching analysis results and actual placement positions of each moving step to be analyzed in the target chessboard.

11. A Go teaching device, characterized in that: Applied to the server, including: A second acquisition module is used to acquire a plurality of stand-alone problem solving analysis results corresponding to the teaching materials of a plurality of clients, wherein the stand-alone problem solving analysis result corresponding to the teaching materials of each client is obtained by executing the Go teaching method according to any one of claims 1 to 7, or by the Go teaching device according to claim 10; The second analysis module is used to analyze the analysis results of each single-machine question-solving to obtain the comprehensive analysis results of the teaching material.

12. An electronic device comprising: A processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface communicate with each other via the communication bus; The memory is used to store at least one executable instruction, and the executable instruction enables the processor to perform an operation corresponding to the Go teaching method as described in any one of claims 1-7 or 8-9.

13. A computer storage medium having a computer program stored thereon, wherein when the program is executed by a processor, the Go teaching method as described in any one of claims 1-7 or 8-9 is implemented.

Images