Accuracies, run times, and statistics for genetic algorithms with various mutation rates solving the N-queens problem.
S KanwalMaxinder
S RameshAvinash
A HuangLauren
2013
<p>In the nqueensnomut, nqueensconstmut, and nqueenssigmoid tabs, the end heuristic (number of queens attacking each other on the board, with 0 m) found by that genetic algorithm is displayed along with the time the algorithm took to converge to that solution (in generations). In the stats tabs, t-tests are run to compare the accuracies and convergence generations among the different mutation rate genetic algorithms.<br>Key: mut rate: mutation rate, converg: convergence (generations), end h (end heuristic) nomut: no mutation, constmut, constant mutation.</p>