用C/C++实现的著名“八皇后”算法~八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出:在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种方法-With C/C++ implementation of the famous " Eight Queens"　algorithm ~ eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss in 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many ways