Introduction - If you have any usage issues, please Google them yourself
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.