文件名称:EightQueen_bcb6
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:287.03kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
(This is Borland C++Builder 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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Unit1.dfm
Project1.cpp
Unit1.cpp
Unit1.ddp
Unit1.h
Project1.obj
Unit1.obj
Project1.res
Project1.exe
Project1.bpr
Project1.cpp
Unit1.cpp
Unit1.ddp
Unit1.h
Project1.obj
Unit1.obj
Project1.res
Project1.exe
Project1.bpr
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.