说明：  C语言实现的八皇后问题求解。 会下国际象棋的人都很清楚：皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将8个皇后放在棋盘上（有8*8个方格），使它们谁也不能被吃掉！这就是著名的八皇后问题。
(C language of the eight Queen's problem to solve. Will be under the international chess are very clear : the Queen's horizontal, the vertical, the slash is not limited steps to eat the other piece. How to eight on the chessboard of Queen (8* 8 box), so that they who should not be eaten! This is the Queen's famous eight issues.)