文件名称:delphibahuanghou
介绍说明－－下载内容均来自于网络，请自行研究使用
八皇后问题是一个古老而著名的问题，是回溯算法的典
型例题。该问题是十九世纪著名的数学家高斯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.
型例题。该问题是十九世纪著名的数学家高斯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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
基于delphi的_八皇后_问题动态实现.pdf