No self-introduction
Loading
Profile
Follow
codes (1)
N-Queens problem, eight Queens problem, Backtracki
no vote
Eight queens problem is a classic instance of backtracking algorithms, the first with an international chess
master raised the question is: "In the 8 * 8 chessboard how to place eight queens so that it does not attack
each other," he says at least 87 groups put the law . By backtracking the answer is 92 kinds.
Backtracking use the stack as the infrastructure, the basic idea is to try to go the next step, another step
back condition is not satisfied then choose their way. Therefore, the basic framework of the algorithm is:
chng 2016-08-23
chng 0 0
1
No more~
Follows0
Fans0