本文整理汇总了C++中board::move方法的典型用法代码示例。如果您正苦于以下问题:C++ board::move方法的具体用法?C++ board::move怎么用?C++ board::move使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类board
的用法示例。
在下文中一共展示了board::move方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: min_node
board min_node(board ¤t, vector <string> &traverse_log, const int depth, const bool prune, const node from, const bool save_log) const {
assert(depth >= 0 && depth <= cutoff);
//cout << get_node_name(current) << endl;
int v = MAX_INT;
/*if (depth == cutoff) {
v = current.eval(who);
}*/
board best = current;
if ((current.who != current.whom && depth == cutoff) || !current.has_legal_move() || (!current.is_root && abs(current.eval(who)) == WINNING)) {
best.val = current.eval(who);
if (save_log) {
traverse_log.push_back(log_string(current, depth, best.val, prune));
}
return best;
}
if (save_log) {
traverse_log.push_back(log_string(current, depth, v, prune));
}
for (auto e: current.candidate) {
board next = current.move(e);
next.history.push_back(e);
int delta_depth = current.whom != current.who;
if (depth == cutoff && delta_depth) {
best.val = current.eval(who);
return best;
}
if (next.whom == next.who) { //Still player's turn
next = min_node(next, traverse_log, depth + delta_depth, prune, MIN_NODE, save_log);
} else {
next = max_node(next, traverse_log, depth + delta_depth, prune, MIN_NODE, save_log);
}
if (next.val < v) {
v = next.val;
best = next;
}
if (prune) {
if (best.val <= current.alpha) {
if (save_log) {
traverse_log.push_back(log_string(current, depth, v, prune));
}
return best;
}
current.beta = min(current.beta, best.val);
}
if (save_log) {
traverse_log.push_back(log_string(current, depth, v, prune));
}
//cout << get_node_name(current) << endl;
}
return best;
}