Description: n Queens Problem Solving (8 <= n <= 1000) a) Queen number of settings in the designated text box to enter the Queen s Number, Note: Queen s number in between 8 and 1000 (including 8 and 1000) b) Solving <Solve> Click button to solve. c) the solution process displayed in the Total Collision marked the static text box will output the current Queen s chessboard the total number of conflicts. When the conflict reduced the number of 0:00, finished solving. d) The results showed that the procedure can solve the graphical display 8 <= n <= 50 to solve the results of the Queen. e) withdraw from the program, click <Exit> to withdraw from the program.
- [01-8queens] - n Queens problem, rar format, operating
- [boyi] - a C# program to the flag of the word gam
- [ImageLab] - Integrated Development of image processi
- [usbhost] - 2.6 kernel usb transplant information on
- [tsp-ga] - Based on genetic algorithm to solve the
- [gao610898180_3] - n queen problem C++ to achieve (with tes
- [nquee] - Genetic Algorithms and retrospective com
- [nhuanghouwenti] - n queen problem solving, there are speci
- [Graph] - pixel grid will be shown, the es
- [GreedySelector] - Graphical interface, greedy algorithms,
File list (Check if you may need any files):
Download