八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。

高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。

对于八皇后问题的实现，如果结合动态的图形演示，则可以使算法的描述更形象、更生动，使教学能产生良好的效果。-8 Queen s problem is an old and well-known problem is a typical example of backtracking algorithms. The problem is that the nineteenth century, the famous mathematician Gauss in 1850: Under the 8X8 grid on the display of the chess Queen eight, making it unable to attack each other, that is, any two can not be Queen s in the same line, the same row or the same slash on how many kinds of facing law.



   　Gaussian 76 program that. In Berlin in 1854 different chess magazines published author of 40 different types of solution, then using graph theory was the method to solve the 92 kinds of results.



   　8 Queen s problem for the realization, if the combination of dynamic graphics presentation, you can make the image descr iption algorithm, more vivid, so that teaching can have a very positive impact.