搜索资源列表
nquenehuisufa
- n皇后的回溯法遍历问题的实验报告，包括算法描述，源码-nquenewenti
eightQUeen
- 自编的8皇后问题的C++编写程序，含递归调用-8 queens problem C++ programming, including recursive calls
N-Queen
- 八皇后问题。N皇后。对角线同行同列不能放棋子-Eight queens problem
queen
- 解决皇后问题，更轻松地解决皇后问题，这是我的荣幸-solve the queen question，and to solve the queen question relaxly，its my plesure
solutions-eight-queens-problem
- 八皇后问题要求在一个８X８的棋盘上放上８个皇后，使得每一个皇后既攻击不到另外七个皇后，也不被另外七个皇后所攻击-Eight queens problem requirements put eight queens on a 8x8 board, making a queen both attack less than seven other Queen or seven Queen' s attack
1
- 八皇后问题是求出在一个n×n的棋盘上，放置n个不能互相捕捉的国际象棋“皇后”的所有布局（皇后可以沿着纵横和两条斜线4个方向相互捕捉）的问题。是一种比较常见的练习C语言递归或者栈使用的程序问题。-Eight queens problem is to find an nn chessboard, place of n are not mutually capture chess " queen" of all the layout (Queens and two along the
recall
- 熟悉和掌握回溯搜索的定义和算法过程，并利用回溯算法求解N皇后问题，理解求解流程和搜索顺序。-Familiar with and master the definition and algorithm of back in the search process, and make use of backtracking algorithm to solve the N queens problem, understand the solving process and the search ord