提交 957ffa11 编写于 作者: D dev@dev.com

准备文字

上级 1d32ca88
......@@ -149,7 +149,7 @@ std::vector<chess_node> build_tree(const chess_node & root, const int side,const
curr_i += (ts - curr_i);
}
//printf ("\nDepth = %d\n",tree.rbegin()->depth);
printf ("Depth = %d \n",tree.rbegin()->depth);
return tree;
}
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册