文件名称:EightQueen_vb
- 所属分类：
- 棋牌游戏
- 资源属性：
- [Windows] [Visual C] [Basic/ASP] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 31kb
- 下载次数：
- 0次
- 提 供 者：
- y***
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
(This is Visual Basic 6 version)
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel,
and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850.
Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach.
Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed descr iption of the development of a depth-first backtracking algorithm.
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel,
and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850.
Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach.
Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed descr iption of the development of a depth-first backtracking algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Form1.frm
Form1.frx
Project1.exe
Project1.vbp
Project1.vbw
8queen.bmp
Form1.frx
Project1.exe
Project1.vbp
Project1.vbw
8queen.bmp