diff --git a/src/ai/evaluate.cpp b/src/ai/evaluate.cpp
index 689fedbe..bbf2ff3b 100644
--- a/src/ai/evaluate.cpp
+++ b/src/ai/evaluate.cpp
@@ -25,9 +25,9 @@ value_t Evaluation::getValue(StateInfo *st, Position *position, Node *node)
     // 初始评估值为0，对先手有利则增大，对后手有利则减小
     value_t value = VALUE_ZERO;
 
-    int nPiecesInHandDiff = std::numeric_limits<int>::max();
-    int nPiecesOnBoardDiff = std::numeric_limits<int>::max();
-    int nPiecesNeedRemove = 0;
+    int nPiecesInHandDiff;
+    int nPiecesOnBoardDiff;
+    int nPiecesNeedRemove;
 
 #ifdef DEBUG_AB_TREE
     node->phase = position->phase;
diff --git a/src/ai/movegen.cpp b/src/ai/movegen.cpp
index 05507705..cc9f892e 100644
--- a/src/ai/movegen.cpp
+++ b/src/ai/movegen.cpp
@@ -62,8 +62,8 @@ void StateInfo::generateChildren(const Stack<move_t, MOVE_COUNT> &moves,
 
 int StateInfo::generateMoves(Stack<move_t, MOVE_COUNT> &moves)
 {
-    square_t square = SQ_0;
-    player_t opponent = PLAYER_NOBODY;
+    square_t square;
+    player_t opponent;
 
     moves.clear();
 
diff --git a/src/ai/search.cpp b/src/ai/search.cpp
index 68730c27..e36f15fa 100644
--- a/src/ai/search.cpp
+++ b/src/ai/search.cpp
@@ -675,7 +675,7 @@ value_t AIAlgorithm::search(depth_t depth, value_t alpha, value_t beta, Node *no
     value_t value;
 
     // 临时增加的深度，克服水平线效应用
-    depth_t epsilon = 0;
+    depth_t epsilon;
 
 #ifdef BEST_MOVE_ENABLE
     // 子节点的最优着法