搜索资源列表
n_queen
- java和c++都有，算法为回溯。n后问题 注：i-j=k-l 或 i+j=k+l 说明2个皇后在对角线上-java and c++ there, the algorithm is a retrospective
Queen
- 八皇后 进一步加深编程，进一步难度为N皇后问题-Eight Queens program to further deepen and further difficulty for the N queens problem
NQueen
- n-皇后问题的迭代回溯解法，里面是完整的程序。可以运行。本人亲写。-n-queens problem iterative back solution, which is a complete program. Can run. I am pro-write.
NQueens
- 用回溯法求解N皇后问题，大家可以参考借鉴一下-With backtracking to solve N Queens problem, we can refer to learn about
NQueens
- 算法系列-N皇后问题的解决，用java语言来编写-Algorithms Series-N queens problem solve, to write java language
NqueensProblem
- 软件架构实例：使用分别使用管道-过滤器风格、调用/返回风格、回溯法和黑板风格四种架构风格实现N皇后问题；-Software architecture instance: use use the pipeline- filter style, call/return style N queens problem, backtracking and blackboard style four architectural styles
Queen
- 算法分析与设计 用回溯法实现n皇后问题(java源码)-Algorithm Analysis and Design N-queens Problem Using Backtracking
src
- N_Queen 经典N皇后问题N可以是任意值，输出一系列解是每一行上的皇后的列号-N_Queen classical problem can change value of N and output a series solution
Queen
- 采用拉斯维加斯算法和回溯法相结合，解决N皇后问题-Las Vegas using algorithms and backtracking Combination, N Queens problem solving
NQueens
- leetcode上最快的N皇后解法 我自己的代码-the best solution