搜索资源列表
simulated_annealing
- Population-based Simulated Annealing Implementation for n-Queens (UNIX/ C)-Population-based Simulated Annealing Implementation for n-Queens (UNIX/C)
LPTc
- 8皇后问题，N皇后问题，随机算法，提高速度-this is a randomized solution of N Queens. with random algrithism, we can improve the speed of finding solution
8queen
- 参考网上资料写的一个能在linux下编译通过的8皇后问题，可以显示出每一步的过程，和所有的结果。-Written in a reference to on-line information.It can be compiled under linux, adopted by 8 Queens problem, It can show every step of the process, and all the results.
queen
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出： 在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上. -Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the famous mathemati
eightQueen
- c语言下棋盘的8皇后问题。在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-c language board 8-queens problem.
four-queen-c
- 东北大学 人工智能 四皇后问题 C语言 数据结构 实验报告-Northeastern University Artificial Intelligence queens problem C language data structure of experimental reports
16-queens
- 16(N)皇后问题，用回溯法和位运算结合编程，在效率上有很大的改进-16 (N) queens problem using backtracking and bitwise combination of programming, a great improvement on the efficiency
Backtracking-algorithm
- 回溯算法的介绍，解决怎样实现皇后问题。属于c++数据结构问题-Backtracking algorithm introduced queens problem solve how to achieve
nqueen
- 本人今年新写的n皇后问题，希望对大家有帮助。-The n-queens problem I am new to write, we want to help.
Eight_queens
- 编写一个程序解八皇后问题。八皇后问题是：设法在国际象棋的棋盘上放置八个皇后，使得其中任何一个皇后所处的“行”、“列”以及“对角线”上都不能有其它的皇后-Write a program solution to the eight queens problem. Eight queens problem: trying to place eight Queens on a chess board, makes any Queen which " line" , " colum
Eight-queens-problem
- 八皇后问题求解！用OPEN表和CLOSED表实现！人工智能实验！-Eight queens problem solving! OPEN and CLOSED table with table to achieve! AI experiment!
Eight-Queen
- 历史遗留下的八皇后问题，简单的递归算法实现。-Historical legacy of the eight queens problem, a simple recursive algorithm.