Location:
Search - 8 queen delphi
Search list
Description: 八皇后问题是一个古老而著名的问题，是回溯算法的典
型例题。该问题是十九世纪著名的数学家高斯1850 年提出：
在8X8 格的国际象棋上摆放八个皇后，使其不能互相攻击，
即任意两个皇后都不能处于同一行、同一列或同一斜线上，
问有多少种摆法。-eight Queen's problem is an ancient and famous, is backtracking algorithm typical examples. The question is the famous 19th century mathematician Gauss 1850 : 8 X8 in the lattice placed on the international chess 8 Queen's, making it unable to attack each other. arbitrary or two at Queen's are not the same line, the same series or in the same slash and asked how many pendulum method.
Platform: |
Size: 145408 |
Author: xiaowu |
Hits:
Description: n皇后问题求解(8<=n<=1000)
a) 皇后个数的设定
在指定文本框内输入皇后个数即可,注意: 皇后个数在8和1000 之间(包括8和1000)
b) 求解
点击<Solve>按钮即可进行求解.
c) 求解过程显示
在标有Total Collision的静态文本框中将输出当前棋盘上的皇后总冲突数.
当冲突数降到0时,求解完毕.
d) 求解结果显示
程序可以图形化显示8<=n<=50的皇后求解结果.
e) 退出程序,点击<Exit>即可退出程序.-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.
Platform: |
Size: 128000 |
Author: jiangtao |
Hits: