在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对

重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、

“最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。

整个程序使用了动画技术，界面设计美观友好，使用方便。-In the field of artificial intelligence, implicit graph search is a basic method of solving problems, this program through the use of a variety of graph search strategy, Jiugong rearrangement problem solving, demonstrate the " breadth-first search" , " depth-first search " ,"　bounded depth-first search " ,"　best-first search " and"　local preferred search " Figure five basic search strategy. The program uses animation techniques, interface design, beautiful and friendly, easy to use.