题目说明：

在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。



题目要求：

（１）依次输出各种成功的放置方法。

（２）最好能画出棋盘的图形形式，并动态的演示试探过程。

（３）程序能方便的移植到其它规格的棋盘上。

-Title Descr iption: In an N × N chess board in place N queens, so that the N-Queen can not eat each other to be each other. Subject of the request: (1) turn out to place a variety of successful methods. (2) best able to draw a graphical form of the board, and the dynamic process of the demonstration test. (3) The procedure can be easily ported to other specifications of the board.