搜索资源列表
mpiqueen
- 基于MPI的N皇后问题，且剔除镜像解和旋转解-Of MPI-based N-queens problem and the solution removed the mirror solution and the rotation
1098Nqueens
- C语言算法设计 经典问题 N皇后问题 回溯算法-C language algorithm designed N queens problem backtracking algorithm
N-Queens
- mpri solution for nqueens problem
final_project
- This is a solver for the N-Queens problem.
NQueens
- résolution de probleme de n queens
The-queen
- 实现N个皇后问题，输出所有的排列情况，利用TXT实现输入输出-Realization of N-queens problem, the output of all of the arrangement, the use of input and output TXT achieve
suanfa
- 算法设计课程全部代码，包括0-1背包问题，回溯方法解n皇后问题，最大字段和，归并排序等算法，并全部包含人机交互过程-Algorithm design courses all the code, including the 0-1 knapsack problem, backtracking method to solve n-queens problem, the maximum field and, merge sort algorithms, and all include human-co
Nhuanghou
- N皇后问题，输入N就可以展示出每一种情况以及情况总数-N queens problem, enter N can demonstrate in each case as well as the total number of cases
N皇后
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。(The eight queen problem, an old and famous problem, is a typical case of backtracking algorithms. It is put forward the internationa