如何用蒙特卡洛树搜索(MCTS)制作智能五子棋【含源码】_01
2024年1月26日发(作者:)
出现了bug,所有得分均为负分。
for(int row_i=0; row_i= 0 && col_j+WINLENGTH-1 < rows) { while(firstColor == chessmans[row_i-distance[2]][col_j+distance[2]]) { distance[2]++; } } //向右下判断(包含左上) if(row_i+WINLENGTH-1 < rows && col_j+WINLENGTH-1 < rows) { while(firstColor == chessmans[row_i+distance[3]][col_j+distance[3]]) { distance[3]++; } } for(int distance_num=0; distance_num<4;distance_num++) { if(WINLENGTH == distance[distance_num]) { if(firstColor == BLACK) { return BLACKWIN; }else { return WHITEWIN; } } } totalExistChessman++; }
} } if(rows*rows == totalExistChessman) { return ALLFILLED; } return NOTWIN; }
}MCTS_ckage bwjiang;import an;public class MCTS_01 {
public static final int BUDGET = 1000000; public static final int BLACKWIN = 1; public static final int WHITEWIN = 2; public static final int NOTWIN = 0; public static final int ALLFILLED = -1; public static final int BLACK = 1;
发布者:admin,转转请注明出处:http://www.yc00.com/news/1706231368a1447508.html
评论列表(0条)