Welcome![Sign In][Sign Up]
Location:
Search - 8 queen code in backtracking algorithm

Search list

[Data structs8-queens

Description: 数据结构算法:回溯法编程寻找八皇后问题的所有解,使用语言C/C-algorithm data structure : backtracking programming for the Queen's eight all solutions, the use of language C/C
Platform: | Size: 6144 | Author: 王卫国 | Hits:

[.netQueue

Description: 八皇后问题是一个古老而著名的问题,是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出:在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击,即任意两个皇后都不能处于同一行、同一列或同一斜线上,问有多少种摆法。-8 Queen s problem is an ancient and well-known problems, backtracking algorithm is a typical example. 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, asking how many kinds of pendulum method.
Platform: | Size: 9216 | Author: 何再兴 | Hits:

CodeBus www.codebus.net