八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出： 在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上. -Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the famous mathemati

编写一个程序解八皇后问题。八皇后问题是：设法在国际象棋的棋盘上放置八个皇后，使得其中任何一个皇后所处的“行”、“列”以及“对角线”上都不能有其它的皇后-Write a program solution to the eight queens problem. Eight queens problem: trying to place eight Queens on a chess board, makes any Queen which " line" , " colum

八皇后问题求解！用OPEN表和CLOSED表实现！人工智能实验！-Eight queens problem solving! OPEN and CLOSED table with table to achieve! AI experiment!

历史遗留下的八皇后问题，简单的递归算法实现。-Historical legacy of the eight queens problem, a simple recursive algorithm.