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
