发布时间 : 2024/5/16 12:58:14 星期四 文章东北大学人工智能大作业更新完毕开始阅读9df9e750e418964bcf84b9d528ea81c758f52e68

for(vari=0;i

board[p[0]][p[1]] = R.hum;

var v = max(board, deep-1, best < alpha ? best : alpha, beta); board[p[0]][p[1]] = R.empty; if(v < best ) { best = v; }

if(v < beta) { //AB剪枝 ABcut ++; break; } }

return best ; }

var max = function(board, deep, alpha, beta) { var v = evaluate(board); total ++;

if(deep <= 0 || win(board)) {

return v; }

var best = MIN;

var points = gen(board, deep);

for(vari=0;i

board[p[0]][p[1]] = R.com;

var v = min(board, deep-1, alpha, best > beta ? best : beta); board[p[0]][p[1]] = R.empty; if(v > best) { best = v; }

if(v > alpha) { //AB 剪枝 ABcut ++; break; } }

return best; }