搜索资源列表
bahuanghou44444
- 八皇后问题的拓展,n皇后问题的深度优先算法,可以把结果以文件形式输出。N<=20-eight of the Queen's expansion, n depth of the Queen's priority algorithm, the results can be output in the form of a document. N
queue
- 八皇后问题,可以推广到N皇后,在学校的实验课上做的,用回溯法-The eight queens problem can be generalized to the N-Queens in the experimental class of the school, with backtracking
idbqsreadizationthe
- 运用递归算法实现了八皇后问题,基本思路借鉴于四皇后的实现,(Using a recursive algorithm to achieve the eight queens problem, the realization of the basic ideas for reference in the queen,)