organ
/
Sanmill
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

search: 调整部分语句位置 

对性能优化极为轻微
This commit is contained in:
CalciteM Team 2019-07-20 21:19:01 +08:00
parent 922206b3ab
commit 2aaa3d276b
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
NineChess/src/config.h
View File

@ -3,7 +3,7 @@
//#define DEBUG_MODE
#define RANDOM_MOVE
//#define RANDOM_MOVE
#define DEAL_WITH_HORIZON_EFFECT

10
NineChess/src/ninechessai_ab.cpp
View File

@ -219,13 +219,13 @@ void NineChessAi_ab::generateLegalMoves(Node *node, int bestMove)
for (int i = 0; i < MOVE_PRIORITY_TABLE_SIZE; i++) {
pos = movePriorityTable[i];
if (!chessTemp.board_[pos]) {
if (node == rootNode && chessTemp.context.stage == NineChess::GAME_NOTSTARTED) {
if (chessTemp.context.stage != NineChess::GAME_NOTSTARTED || node != rootNode) {
addNode(node, 0, pos, bestMove, chessTemp.context.turn);
} else {
// 若为先手，则抢占星位
if (NineChess::isStartPoint(pos)) {
addNode(node, INF_VALUE, pos, bestMove, chessTemp.context.turn);
}
} else {
addNode(node, 0, pos, bestMove, chessTemp.context.turn);
}
}
}
@ -660,7 +660,7 @@ int NineChessAi_ab::alphaBetaPruning(int depth, int alpha, int beta, Node *node)
int probeVal = probeHash(hash, depth, alpha, beta, bestMove, type);
if (node != rootNode && probeVal != INT32_MIN) {
if (probeVal != INT32_MIN && node != rootNode) {
hashHitCount++;
node->isHash = true;
node->value = probeVal;
@ -746,7 +746,7 @@ int NineChessAi_ab::alphaBetaPruning(int depth, int alpha, int beta, Node *node)
}
// 生成子节点树，即生成每个合理的着法
generateLegalMoves(node, bestMove); // (43%)
generateLegalMoves(node, bestMove);
// 根据演算模型执行 MiniMax 检索，对先手，搜索 Max, 对后手，搜索 Min