提交 0102c2a1 编写于 作者: D dev@dev.com

建议8GB内存 x64编译器 i7 处理器运行

上级 a8dcde3a
......@@ -90,7 +90,7 @@ std::vector<chess_node> build_tree(const chess_node & root, const int side,const
tree[0].depth = 0;
size_t curr_i = 0;
size_t max_nodes = 1024*1024*4;
size_t max_nodes = 1024*1024*16;
while (tree.size()<=max_nodes && curr_i<tree.size())
{
const size_t ts = tree.size();
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册