对 value 相同的进行随机排序

NineChess/src/config.h

@@ -9,7 +9,7 @@
 #endif
 
 #ifndef DEBUG
-//#define AB_RANDOM_SORT_CHILDREN
+#define AB_RANDOM_SORT_CHILDREN
 #endif
 
 #ifdef DEBUG

NineChess/src/ninechessai_ab.cpp

@@ -36,6 +36,14 @@ struct NineChessAi_ab::Node *NineChessAi_ab::addNode(Node *parent, int value, in
     newNode->parent = parent;
     newNode->value = value;
     newNode->move = move;
+       
+    nodeCount++;
+    newNode->id = nodeCount;
+
+    unsigned int time0 = (unsigned)time(0);
+    srand(time0 * (unsigned int)nodeCount);
+    newNode->rand = rand();
+
 #ifdef DEBUG_AB_TREE
     newNode->player = player;
     newNode->root = rootNode;
@@ -173,19 +181,20 @@ void NineChessAi_ab::buildChildren(Node *node)
 void NineChessAi_ab::sortChildren(Node *node)
 {
     // 这个函数对效率的影响很大，排序好的话，剪枝较早，节省时间，但不能在此函数耗费太多时间
-#ifdef AB_RANDOM_SORT_CHILDREN
-    // 这里我用一个随机排序，使AI不至于每次走招相同
-    srand((unsigned)time(0));
-    for (auto i : node->children) {
-        i->value = rand();
-    }
-#endif /* AB_RANDOM_SORT_CHILDREN */
 
-    // 排序
-    if (chessTemp.whosTurn() == NineChess::PLAYER1)
-        node->children.sort([](Node *n1, Node *n2) { return n1->value > n2->value; });
-    else
-        node->children.sort([](Node *n1, Node *n2) { return n1->value < n2->value; });
+#ifdef AB_RANDOM_SORT_CHILDREN
+    if (chessTemp.whosTurn() == NineChess::PLAYER1) {
+        node->children.sort([](Node* n1, Node* n2) {return n1->value > n2->value? true : (n1->value == n2->value ? (n1->rand > n2->rand) : false); });
+    } else {
+        node->children.sort([](Node* n1, Node* n2) { return n1->value < n2->value? true : (n1->value == n2->value ? (n1->rand < n2->rand) : false) ;});
+    }
+#else
+    if (chessTemp.whosTurn() == NineChess::PLAYER1) {
+        node->children.sort([](Node* n1, Node* n2) {return n1->value > n2->value;});
+    } else {
+        node->children.sort([](Node* n1, Node* n2) { return n1->value < n2->value;});
+    }
+#endif
 }
 
 void NineChessAi_ab::deleteTree(Node *node)
@@ -467,16 +476,12 @@ int NineChessAi_ab::alphaBetaPruning(int depth, int alpha, int beta, Node *node)
 #ifdef DEBUG_AB_TREE
     node->depth = depth;
     node->root = rootNode;
-    node->id = nodeCount;
     // node->player = chessContext->turn;
     // 初始化
     node->isLeaf = false;
     node->isTimeout = false;
 #endif
 
-    // 遍历总次数增加
-    nodeCount++;
-
     // 搜索到叶子节点（决胜局面）
     if (chessContext->stage == NineChess::GAME_OVER) {
         node->value = evaluate(node);

NineChess/src/ninechessai_ab.h

@@ -40,12 +40,13 @@ public:
         int value;                     // 节点的值
         list<struct Node*> children;  // 子节点列表
         struct Node* parent;           // 父节点
+        size_t id;                      // 结点编号
+        int rand;                       // 随机数，对于 value 一致的结点随机排序用
 #ifdef DEBUG_AB_TREE
         string cmd;
         enum NineChess::Player player;  // 此招是谁下的
         int depth;
         bool evaluated;                 // 是否评估过局面
-        size_t id;                      // 结点编号
         int alpha;
         int beta;
         int minMax;