算法设计:著名的n后问题:在nXn的棋盘上放彼此不受攻击的n个皇后,按国际象棋的规则,任何2个皇后不在同一行或同一列或同一斜线上.

本算法才用回朔法来解决.-algorithm design : n after the famous question : In nXn put on the chessboard of each other against attack n empress, according to the international rules of chess, any two Queen's not the same line, or in the same series or slash on the same. the algorithm used the method to solve the Schomburg.