人工智能作业题解答（Artificial intelligence work answers）.doc

人工智能作业题解答（Artificial intelligence work answers） The third chapter is graph search and problem solving 1. What are state diagrams and graphs or graphs? What is the relationship between graph search and problem solving? Solution: according to the logical relation between the edges of the same node, the graph can be divided into two categories: state graph and graph. State diagram is a directed graph to describe the problem. The basic way to find a target or path in a statechart is to search. 2. Summarize the methods and Strategies of chart search. Solution: graph search methods are: tree search, line search. Its strategy is: blind search, tree and non backtracking line type is exhaustive, and the line of backtracking is a random collision. Heuristic search uses heuristic information to guide the search. 3. What is the solution of the problem? What is the optimal solution? Solution: the method or practice that can solve the problem becomes the solution of this problem. Among them, the best solution is the optimal solution. 4 what is a tree or a tree? What is a solvable node? What is the solution tree? Trees and trees: the arc in a tree indicates that the branches are in with ties, or branches without curves. This tree has relation or relationship with it, so it is called tree or tree. Solvable nodes: the solution tree is actually a subtree formed by a solvable node. The root of this subtree is the initial node, and the leaf is the termination node, and the subtree must be the tree. Tree decomposition: the nodes satisfying the following conditions are solvable nodes. The termination node is a solvable node; one is solvable with the node if and only if its child nodes are all solvable; one or the node is solvable, as long as its child node has at least one solvable solution. 5, with three keys switch, lined up, the initial state is off, open and close, asked whether the connection after three times open, open, open or off, off, off state Each time you press a switch, you