Description: Title: Queen s eight questions.
Queen s eight questions refer to how to solve the 8* 8 chess board placed on the eight conflict-free Queen s pawn. Since at chess, the Queen of the mobile means are横竖cross, so at any one location s level, vertical and inclined 45 degrees can not have other pieces exist. A complete conflict-free distribution of the eight Queen s pawn to become queen eight questions a solution. Design ideas: I use a retrospective method to solve the eight Queen s question, that is, successive test method. This method is through the function putchess () recursive calls of their own to achieve. After running the program, the main function call putchess () function at the first line of the first column of the chessboard placed on a pawn down and his party start recursion. Every step of the recursion, the first question put Detect location appears there is no conflict, if there is no conflict, it is down a pawn, and into the next line recursive, otherwise detect the locatio
File list (Check if you may need any files):
BaHuangHou
..........\大作业4.cpp
..........\大作业4.exe
..........\大作业4.txt
Download