自己用c++编写的计算数独的程序。使用枚举法，深度优先搜索得出结果。不能判断是否有多解。适合初级程序员参考。-Their written using c++ calculate the number of separate procedures. Enumeration method used, the outcome of depth-first search. Can not determine whether the multiple solutions. Junior programme

Breath First Search and Depth First Search

推箱子的搜索算法 采用深度优先的A*算法 算法具有拓展性-The Sokoban of depth-first search algorithm using A* algorithm algorithm scalability

八数码问题的解决,包括三种路径的查找最优解，例如：深度优先查找，广度优先查找。-Eight digital problem solving, including three kinds of paths to find an optimal solution, for example: depth-first search, breadth-first search.