数据结构与算法国家级双语教学示范课程配套教材彭军向毅Chap3stack课件教学.pptVIP

Backtracking is widely used in applications such as computer game, decision analysis, expert system, and other Artificial Intelligence system. The most important technique in backtracking is to record the “foot steps” (脚步)and other choices at “crossway” while advancing. When reaching a dead corner, you can go back along the “foot steps” to the nearest “crossway” and probe another way. You can try repeatedly and strenuously in this fashion until you get your destination or get the result that your destination is unreachable. * Stack is an ideal structure to implement recording and backtracking “foot steps” and “branch ways” as its LIFO feature. But how to distinguish “foot step” and “branch way” should be taken into consideration. The question now is what to put into the stack. If we only needed to locate the node that contains the goal, we would just put the branch point nodes into the stack. However, when we are finished we want to print out the path that leads to our goal. Therefore, we must also put the nodes in the valid path into the stack. Because we are putting two things into the stack, we need to be able to tell them apart. We do that with a flag. If the node is in the path, we push a path token. If we are storing a backtracking point, then we set the flag to a backtracking token. * The computer solution to the problem requires that we place a queen on the board and then analyze all of the attack positions to see if there is a queen that could capture the new queen. If there is, then we try another position. * Generalizing the solution, we see that we place a queen in a position in a row and then examine all positions in the next row to see if a queen can be placed there. If we can’t place a queen in the next row, then we backtrack to the last positioned queen and try to position her in the next column. If there is no room in the next column, then we fall back again. Given that there is a solution this trial and error method works well. * More effi