Introduction - If you have any usage issues, please Google them yourself
n n trip out of the international chess board, the maximum n Queen's cloth. If two at the same Queen's visit, the same series on the same diagonal, as they attack each other. N Queen's problem is found n the Queen not to attack each other's layout. N n trip out on the chessboard, and secondary diagonal each 2n-1.
Packet : 13898375n后问题.rar filelist
n后问题.cpp