推 newlin:猛 謝了~~^^ 10/07 23:36
不負責任解法，不保證正確，對了算幸運，錯了別找我
每個皇后在一個column中最多可以attack三個square(raw一個，兩個對角線各一個)
所以要考慮的state數是n*(n-3)*(n-6)*...，令他等於S
則S^3 = n^3 * (n-3)^3 * (n-6)^3 * ...
>= n * (n-1) * (n-2) * ... = n!
最後就是 S >= (n!)^1/3
以上
--
Looking for the place where a heart feels at ease.
Then, aim at the new future.
While it doesn't know, scene changes someday,
and very warm wind will blow in place.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.112.251.204