论文部分内容阅读
The efifciency of Depth-First-Search depends a lot on is there a pruning process in the search algorithm. Usualy, if there is no pruning in the Depth-First-Search algorithm, the efifciency wil be worse than the one with pruning process. This paper mainly addresses on comparison of the two search algorithms, Depth-First-Search and Backtracking Depth-First-Search. At the mean time, the comparison of Breadth-First-Search and Backtracking DFS search are processed. Three Sudoku Solvers using Depth-First-Search, Breadth-First-Search and backtracking Depth-First-Search written in Python are used as experiment tools to ilustrate the comparison in this paper via solving different levels of Sudoku Puzzles.