n皇后问题的三种算法——比较它们的效率

[{"title":"（ 6 个子文件 7KB ） n皇后问题的三种算法——比较它们的效率","children":[{"title":"n皇后问题","children":[{"title":"n皇后问题.dsw <span style='color:#111;'> 526B </span>","children":null,"spread":false},{"title":"a.cpp <span style='color:#111;'> 3.75KB </span>","children":null,"spread":false},{"title":"n皇后问题.opt <span style='color:#111;'> 47.50KB </span>","children":null,"spread":false},{"title":"n皇后问题.dsp <span style='color:#111;'> 4.21KB </span>","children":null,"spread":false},{"title":"n皇后问题.ncb <span style='color:#111;'> 49.00KB </span>","children":null,"spread":false},{"title":"n皇后问题.plg <span style='color:#111;'> 1005B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]