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

打印遍历过的结点个数和占总结点个数比例

This commit is contained in:
CalciteM 2019-06-30 13:35:46 +08:00
parent f5573e9f06
commit bdf7d45a62
2 changed files with 16 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
NineChess/src/ninechessai_ab.cpp
View File

@ -12,7 +12,8 @@
NineChessAi_ab::NineChessAi_ab() :
rootNode(nullptr),
requiredQuit(false),
nodeCount(0)
nodeCount(0),
evaluatedNodeCount(0)
{
buildRoot();
}
@ -41,9 +42,12 @@ void NineChessAi_ab::addNode(Node *parent, int value, int move)
newNode->root = rootNode;
newNode->stage = chessTemp.context.stage;
newNode->action = chessTemp.context.action;
newNode->evaluated = false;
newNode->nPiecesInHandDiff = INT_MAX;
newNode->nPiecesOnBoardDiff = INT_MAX;
newNode->nPiecesNeedRemove = INT_MAX;
newNode->alpha = -INF_VALUE;
newNode->beta = INF_VALUE;
newNode->result = 0;
#endif
int c, p;
@ -229,6 +233,8 @@ int NineChessAi_ab::evaluate(Node *node)
int nPiecesOnBoardDiff = INT_MAX;
int nPiecesNeedRemove = 0;
evaluatedNodeCount++;
#if 0
int loc_value = 0;
@ -270,6 +276,7 @@ int NineChessAi_ab::evaluate(Node *node)
#ifdef DEBUG_AB_TREE
node->stage = chessContext->stage;
node->action = chessContext->action;
node->evaluated = true;
#endif
switch (chessContext->stage) {
@ -634,8 +641,9 @@ const char *NineChessAi_ab::bestMove()
for (auto child : rootNode->children) {
if (child->value == rootNode->value) {
qDebug() << "count: " << nodeCount;
qDebug() << "Evaluated: " << evaluatedNodeCount << "/" << nodeCount << " = " << evaluatedNodeCount * 100 / nodeCount << "%";
nodeCount = 0;
evaluatedNodeCount = 0;
return move2string(child->move);
}
}

8
NineChess/src/ninechessai_ab.h
View File

@ -44,7 +44,8 @@ public:
string cmd;
enum NineChess::Player player; // 此招是谁下的
int depth;
size_t id; // 结点编号
bool evaluated; // 是否评估过局面
size_t id; // 结点编号
int alpha;
int beta;
int minMax;
@ -121,9 +122,12 @@ private:
// 根节点
Node *rootNode;
// 遍历过的节点个数;
// 结点个数;
size_t nodeCount;
// 评估过的结点个数
size_t evaluatedNodeCount;
// 局面数据栈
stack<NineChess::ChessContext> dataStack;