Description: For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
File list (Check if you may need any files):
Download