搜索资源列表
BFS 求解 N 皇后问题(252370)
- BFS算法实现N皇后问题,12个皇后是速度还行,超过了就有点慢。(BFS algorithm to achieve N queen problem, 12 queens is the speed is OK, more than a little slow.)
N-Queue_DFS
- BFS法求解N皇后问题,输出全部解决方案。(BFS method for solving N queens problem and output all solutions.)