queens

For the incomplete methods, we kept the representation of the queens by a table and the method of ca

For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.

标签： the representation incomplete methods

上传时间： 2015-05-05

上传用户：1159797854
Using Genetic Algorithm to solve the 8 queens problem.

Using Genetic Algorithm to solve the 8 queens problem.

标签： Algorithm Genetic problem queens

上传时间： 2014-11-28

上传用户：yd19890720
有关一个N皇后的问题。用户只要改变开始宏定义是的 queens的值就可以验证皇后的具体分布情况；如 8 皇后则会输出具体的92中放置方法；

有关一个N皇后的问题。用户只要改变开始宏定义是的 queens的值就可以验证皇后的具体分布情况；如 8 皇后则会输出具体的92中放置方法；

标签： queens 用户改变宏定义

上传时间： 2014-01-04

上传用户：xuan‘nian
所谓八皇后问题（Eight queens Problem）

所谓八皇后问题（Eight queens Problem），是在8*8格的棋盘上，放置8个皇后。要求每行每列放一个皇后,而且每一条对角线和每一条反对角线上最多只能有一个皇后，这是一个典型并行算法，C语言实现。

标签： Problem queens Eight

上传时间： 2016-07-27

上传用户：libinxny
This progamram desrible how put N queens on the board have size N*N Using algorithm back tracking

This progamram desrible how put N queens on the board have size N*N Using algorithm back tracking

标签： progamram algorithm desrible tracking

上传时间： 2017-05-04

上传用户：ynwbosss
n queens problem which can print the chess board pattern

n queens problem which can print the chess board pattern

标签： problem pattern queens board

上传时间： 2013-12-18

上传用户：BOBOniu
This program finds the locations of placing n queens in a n*n chessboard so that none attack any oth

This program finds the locations of placing n queens in a n*n chessboard so that none attack any other

标签： chessboard locations program placing

上传时间： 2014-11-17

上传用户：ma1301115706
N-queens made in SST

N-queens made in SST

标签： N-queens made SST in

上传时间： 2013-12-24

上传用户：yepeng139
C PROGRAM FOR 8 queens PROBLEM USING BACKTRACKING

C PROGRAM FOR 8 queens PROBLEM USING BACKTRACKING

标签： BACKTRACKING PROGRAM PROBLEM queens

上传时间： 2017-08-07

上传用户：zuozuo1215
Solution to the "8 queens Problem" (8 Damen Problem) known from Chess

Solution to the "8 queens Problem" (8 Damen Problem) known from Chess

标签： Problem Solution queens Damen

上传时间： 2017-08-12

上传用户：894898248

queens

For the incomplete methods, we kept the representation of the queens by a table and the method of ca

Using Genetic Algorithm to solve the 8 queens problem.

有关一个N皇后的问题。用户只要改变开始宏定义是的 queens的值就可以验证皇后的具体分布情况；如 8 皇后则会输出具体的92中放置方法；

所谓八皇后问题（Eight queens Problem）

This progamram desrible how put N queens on the board have size N*N Using algorithm back tracking

n queens problem which can print the chess board pattern

This program finds the locations of placing n queens in a n*n chessboard so that none attack any oth

N-queens made in SST

C PROGRAM FOR 8 queens PROBLEM USING BACKTRACKING

Solution to the "8 queens Problem" (8 Damen Problem) known from Chess