建议在64位G++编译器编译。

chesspi/chesspi_ai.cpp

@@ -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*8;
 	while (tree.size()<=max_nodes && curr_i<tree.size())
 	{
 		const size_t ts = tree.size();
@@ -113,17 +113,8 @@ std::vector<chess_node> build_tree(const chess_node & root, const int side,const
 						expand_node(tree[i],curr_side);
 
 				const size_t sz = next_status.size();
-				//有无结束
-				bool ppz = false;
-//				for (size_t j=0;j<sz && !ppz;++j)
-//				{
-//					if (next_status[j].jump_cost[0]==table_cost[0] || next_status[j].jump_cost[1]==table_cost[0])
-//						ppz = true;
-//				}
 				for (size_t j=0;j<sz;++j)
 				{
-					if (ppz && next_status[j].jump_cost[0]<table_cost[0] &&  next_status[j].jump_cost[1]<table_cost[0] )
-						continue;
 					std::string ha = node2hash(next_status[j].coords,next_status[j].alive);
 					bool needI = false;
 #pragma omp critical