找人帮忙翻译，别用金山啊~~~！

是不是翻译成英文啊？麻烦你说清楚好吧？ Artificial intelligence issues, broadly, can be seen as a problem solving, Therefore artificial intelligence problem solving is the core issue, usually through a possible answer to the search for a space to the solution. The problem solving process, people are facing the reality most often the algorithm is no certainty, usually need search algorithm to solve this problem. Purpose and achieve the objective method, known as a group, is the search explore these methods can do what process. Problem solving in general need to consider two basic questions : First, it is appropriate to use the state space, This was followed by tests of the state space target state whether there. Search algorithm is based on knowledge of the problem solving techniques, artificial intelligence is the basic problem-solving strategies. Search algorithm is from the artificial intelligence theory in the state space; According to this representation, different problem solving process can be integrated into one of the problems the state to find a space from the initial state to the target state road course. With map search algorithm and application of the theory of development, people are gradually coming to understand that many of the search method known Although each has its advantages, but they have one common weakness that complexity is exponential. This has led to the "search" method of solving the nature of the discussions. These existing problems, but also by the people's attention and, through the study of these issues, promote the search continued development of the theory. This is the search through the use of various methods to solve the same problem, so as to the algorithm visualization, and for purposes of comparison, to enhance the understanding of the algorithm. Search blindly use of BFS and depth-first search also heuristic search of A * to solve the problem of digital 8 , in contrast to the findings of the merits of the various search. And find a solution to the problem of the optimal algorithm. Search algorithm is the use of high-performance computer to a purpose of an exhaustive part or all of the possible, thus obtained the solutions of the problems one way. Search process is actually based on the initial conditions and the expansion rules to answer a tree structure and find a target state over the node Cheng. All from the search algorithm to achieve the ultimate point of view, can be divided into two parts : have control structure and systems, All of the algorithm optimization and improvement are mainly controlled by modifying their structure to completion. Furthermore, this paper using object-oriented development tools Delphi 6.0 completed the eight digital problem solving process. In the process of realization of the optimization algorithm. OPEN CLOSED table and the table are orderly, search nodes in the table. Search out the same time to insert the node position, after the search can be directly inserted, no longer on the scale sequencing. It also supports more than two valuation functions, and automatic completion of the intermediate results, such as the required steps, expansion of the number of intermediate nodes for the prompt information.