Description: Visual C++ to solve questions Queen' s eight, in a 8 × 8 chess set, there' s eight, each accounting for one' s cell request will not be mutual between Queen' s " attack" phenomenon, that should not have two at the Queen' s the same line, the same row or the same diagonal. Asked how many different ways.
File list (Check if you may need any files):
Eight_Queen
...........\CQueen.cpp
...........\CQueen.h
...........\Debug
...........\Eight_Queen.aps
...........\Eight_Queen.clw
...........\Eight_Queen.cpp
...........\Eight_Queen.dsp
...........\Eight_Queen.dsw
...........\Eight_Queen.h
...........\Eight_Queen.ncb
...........\Eight_Queen.opt
...........\Eight_Queen.plg
...........\Eight_Queen.rc
...........\Eight_QueenDoc.cpp
...........\Eight_QueenDoc.h
...........\Eight_QueenView.cpp
...........\Eight_QueenView.h
...........\MainFrm.cpp
...........\MainFrm.h
...........\ReadMe.txt
...........\res
...........\...\Eight_Queen.rc2
...........\resource.h
...........\StdAfx.cpp
...........\StdAfx.h
Download