Skip to content

Commit

Permalink
fixed math
Browse files Browse the repository at this point in the history
Signed-off-by: kaisawind <wind.kaisa@gmail.com>
  • Loading branch information
kaisawind committed Jun 14, 2020
1 parent 6be1238 commit 09b570b
Showing 1 changed file with 5 additions and 1 deletion.
6 changes: 5 additions & 1 deletion source/_posts/2020-06-11-backtracking.md
Expand Up @@ -32,7 +32,11 @@ while c != nil {
(任两个皇后都不能处于同一条横行、纵行或斜线上。该问题可以推广为nxn的棋盘上放置n个皇后问题)

穷举法:
根据组合公式$C^{n*n}_n={n*n \choose n}$,则8×8共有$C^{64}_8=\frac{64!}{(64-8)!8!}=4426165368$
根据组合公式:

$$C^{n \times n}_n={n \times n \choose n}$$

,则8×8共有$C^{64}_8=\frac{64!}{(64-8)!8!}=4426165368$

真实解:
92个不同的解,去除旋转和对称,只有12个解
Expand Down

0 comments on commit 09b570b

Please sign in to comment.