| Line 30... |
Line 30... |
int maxi(int x,int y){
|
int maxi(int x,int y){
|
return (x>=y)?x:y;
|
return (x>=y)?x:y;
|
}
|
}
|
int mod2(int x){
|
int mod2(int x){
|
#pragma bitsize x 5
|
#pragma bitsize x 5
|
int ans[16]={0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1};
|
int y;
|
return ans[x];
|
#pragma bitsize y 5
|
|
////int ans[32]={0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1};
|
|
//int ans[32]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};
|
|
//return ans[x+16];
|
|
y=x & 1;
|
}
|
}
|
int mod5(int x){
|
int mod5(int x){
|
#pragma bitsize x 5
|
#pragma bitsize x 5
|
int ans[16]={0,1,2,3,4,0,1,2,3,4,0,1,2,3,4,0};
|
int ans[16]={0,1,2,3,4,0,1,2,3,4,0,1,2,3,4,0};
|
return ans[x];
|
return ans[x];
|
| Line 56... |
Line 60... |
#pragma internal_blockram utility
|
#pragma internal_blockram utility
|
PIECE turn[5]={b->turn};
|
PIECE turn[5]={b->turn};
|
int branch=player->branch;
|
int branch=player->branch;
|
|
|
board_copy(b, &b_next[0][0]);
|
board_copy(b, &b_next[0][0]);
|
ai_threats(b_next,0,0,moves_next/*,index*/);
|
//ai_threats(b_next,0,0,moves_next/*,index*/);
|
utility[0][0]=moves_next[0][0].utility;
|
//utility[0][0]=moves_next[0][0].utility;
|
turn[0]=b->turn;
|
//turn[0]=b->turn;
|
for(i=0;i<branch;i++){
|
//for(i=0;i<branch;i++){
|
moves->data[i].x=moves_next[0][0].data[i].x;
|
//moves->data[i].x=moves_next[0][0].data[i].x;
|
moves->data[i].y=moves_next[0][0].data[i].y;
|
//moves->data[i].y=moves_next[0][0].data[i].y;
|
//moves->data[i].weight=moves_next[1][i].utility;
|
////moves->data[i].weight=moves_next[1][i].utility;
|
}
|
//}
|
|
|
///* Search only the top moves beyond the minimum */
|
///* Search only the top moves beyond the minimum */
|
////aimoves_sort(moves);
|
////aimoves_sort(moves);
|
//if (moves->len > player->branch) {
|
//if (moves->len > player->branch) {
|
// //for (i = player->branch; i < moves->len; i++)
|
// //for (i = player->branch; i < moves->len; i++)
|
| Line 77... |
Line 81... |
// moves->len = player->branch;
|
// moves->len = player->branch;
|
//}
|
//}
|
|
|
/* No moves left -- its a draw */
|
/* No moves left -- its a draw */
|
|
|
if (moves_next[0][0].len < 1) //"(%s)", bcoords_to_string(aim->x, aim->y));
|
//if (moves_next[0][0].len < 1) //"(%s)", bcoords_to_string(aim->x, aim->y));
|
|
|
return AIW_DRAW;
|
// return AIW_DRAW;
|
//board_copy(b, &b_next[0][0]);
|
//board_copy(b, &b_next[0][0]);
|
|
|
/* Search each move available in depth first order */
|
/* Search each move available in depth first order */
|
for(j=0;j<depth;j++){
|
for(j=-1;j<depth;j++){
|
int k,branches=1;
|
int k,branches=1;
|
for(k=0;k<j+1;k++) branches*=branch;
|
for(k=0;k<j+1;k++) branches*=branch;
|
//int branches=(player->branch)^j;
|
//int branches=(player->branch)^j;
|
//printf("branches %d\n",branches);
|
//printf("branches %d\n",branches);
|
//int current_j=j % 2;
|
//int current_j=j % 2;
|
//int next_j=(j+1) % 2;
|
//int next_j=(j+1) % 2;
|
int current_j=mod2(j);
|
int current_j=mod2(j);
|
int next_j=mod2(j+1);
|
int next_j=mod2(j+1);
|
if (b_next[current_j][0].moves_left <= 0) turn[j]=other_player(b_next[current_j][0].turn);
|
if(j!=-1){
|
else turn[j]=b_next[current_j][0].turn;
|
if (b_next[current_j][0].moves_left <= 0) turn[j+1]=other_player(b_next[current_j][0].turn);
|
|
else turn[j+1]=b_next[current_j][0].turn;
|
|
}else turn[0]=b->turn;
|
for (i = 0; i < branches; i++) {
|
for (i = 0; i < branches; i++) {
|
//if(!(moves_next[j][i>>1].utility==AIW_WIN || moves_next[j][i>>1].utility==-AIW_WIN)){
|
//if(!(moves_next[j][i>>1].utility==AIW_WIN || moves_next[j][i>>1].utility==-AIW_WIN)){
|
if(!(utility[j][i>>1]==AIW_WIN || utility[j][i>>1]==-AIW_WIN)){
|
AIMove aim;
|
//AIMove aim = *(moves_next[current_j][i>>1].data + (i % branch));
|
//////////////////////////////////////////////////////////if(!(utility[j][i>>1]==AIW_WIN || utility[j][i>>1]==-AIW_WIN)){
|
AIMove aim = *(moves_next[current_j][i>>1].data + mod2(i));
|
if(j!=-1){
|
|
//aim = *(moves_next[current_j][i>>1].data + (i % branch));
|
|
aim = *(moves_next[current_j][i>>1].data + mod2(i));
|
//printf ("aim->utility %d \n",utility[j][i>>1]);
|
//printf ("aim->utility %d \n",utility[j][i>>1]);
|
|
|
board_copy(&b_next[current_j][i>>1], &b_next[next_j][i]);
|
board_copy(&b_next[current_j][i>>1], &b_next[next_j][i]);
|
//if(moves_next[j][i/2].len<branch) printf ("caca");
|
//if(moves_next[j][i/2].len<branch) printf ("caca");
|
//printf("%d %d\n",aim.x,aim.y);
|
//printf("%d %d\n",aim.x,aim.y);
|
|
|
/* Did we get a bad move? */
|
/* Did we get a bad move? */
|
| Line 123... |
Line 129... |
///////////////////////////}
|
///////////////////////////}
|
///////////////////////////place_piece_type(&b_next[j+1][i], aim->x, aim->y, searched);
|
///////////////////////////place_piece_type(&b_next[j+1][i], aim->x, aim->y, searched);
|
|
|
//b_next = board_new();
|
//b_next = board_new();
|
place_piece(&b_next[next_j][i], aim.x, aim.y);
|
place_piece(&b_next[next_j][i], aim.x, aim.y);
|
AIWEIGHT next_alpha = alpha, next_beta = beta;
|
//AIWEIGHT next_alpha = alpha, next_beta = beta;
|
//AIFunc func;
|
//AIFunc func;
|
|
|
|
}else{
|
|
aim.x=-1;aim.y=-1;
|
/* Player has changed */
|
/* Player has changed */
|
//printf("depth %d branches %d turn %d \n\n",j,branches,turn[j]);
|
//printf("depth %d branches %d turn %d \n\n",j,branches,turn[j]);
|
if (b_next[next_j][i].moves_left <= 0) {
|
if (b_next[next_j][i].moves_left <= 0) {
|
b_next[next_j][i].moves_left = place_p;
|
b_next[next_j][i].moves_left = place_p;
|
b_next[next_j][i].turn = other_player(b_next[current_j][i].turn);
|
b_next[next_j][i].turn = other_player(b_next[current_j][i].turn);
|
searched++;
|
searched++;
|
next_alpha = -beta;
|
//next_alpha = -beta;
|
next_beta = -alpha;
|
//next_beta = -alpha;
|
}
|
}
|
b_next[next_j][i].moves_left--;
|
b_next[next_j][i].moves_left--;
|
|
|
|
}
|
/* Did we win? */
|
/* Did we win? */
|
|
|
if (check_win_full(&b_next[1][i], aim.x, aim.y,0,0,0,0)){
|
if (check_win_full(&b_next[next_j][i], aim.x, aim.y,0,0,0,0)){
|
aim.weight = AIW_WIN;
|
aim.weight = AIW_WIN;
|
moves_next[next_j][i].utility=AIW_WIN;
|
moves_next[next_j][i].utility=AIW_WIN;
|
utility[j+1][i]=AIW_WIN;
|
utility[j+1][i]=AIW_WIN;
|
|
|
|
|
//}else if(moves_next[j][i>>1].utility==AIW_WIN || moves_next[j][i>>1].utility==-AIW_WIN ){
|
/////////////////////////////////////////////////////////////////}else if(moves_next[j][i>>1].utility==AIW_WIN || moves_next[j][i>>1].utility==-AIW_WIN ){
|
}else if(utility[j][i>>1]==AIW_WIN || utility[j][i>>1]==-AIW_WIN ){
|
/////////////////////////////////////////////////////////////////}else if(utility[j][i>>1]==AIW_WIN || utility[j][i>>1]==-AIW_WIN ){
|
//moves_next[j+1][i].utility=AIW_WIN;
|
///////////////////////////////////////////////////////////////// //moves_next[j+1][i].utility=AIW_WIN;
|
utility[j+1][i]=AIW_WIN;
|
///////////////////////////////////////////////////////////////// utility[j+1][i]=AIW_WIN;
|
/* Otherwise, search deeper */
|
//////////////////////////////////////////////////////////////////* Otherwise, search deeper */
|
}else {
|
}else {
|
|
|
//func = ai(player->ai)->func;
|
//func = ai(player->ai)->func;
|
//if (!func) {
|
//if (!func) {
|
// g_warning("DFS player has no AI function");
|
// g_warning("DFS player has no AI function");
|
| Line 197... |
Line 205... |
// /* Alpha-beta pruning */
|
// /* Alpha-beta pruning */
|
// if (alpha >= beta)
|
// if (alpha >= beta)
|
// return alpha;
|
// return alpha;
|
//}
|
//}
|
//printf("%d %d %d\n",j,i,moves_next[j+1][i].utility);
|
//printf("%d %d %d\n",j,i,moves_next[j+1][i].utility);
|
}else //moves_next[j+1][i].utility=AIW_WIN;
|
/////////////////////////////////////////////////////////////}else //moves_next[j+1][i].utility=AIW_WIN;
|
utility[j+1][i]=AIW_WIN;
|
///////////////////////////////////////////////////////////// utility[j+1][i]=AIW_WIN;
|
|
}
|
|
if(j==-1){
|
|
for(k=0;k<branch;k++){
|
|
moves->data[k].x=moves_next[0][0].data[k].x;
|
|
moves->data[k].y=moves_next[0][0].data[k].y;
|
|
//moves->data[i].weight=moves_next[1][i].utility;
|
|
}
|
|
if (moves_next[0][0].len < 1)
|
|
return AIW_DRAW;
|
}
|
}
|
}
|
}
|
for(j=depth-2;j>=0;j--){
|
for(j=depth-2;j>=0;j--){
|
int k,branches=1;
|
int k,branches=1;
|
for(k=0;k<j+1;k++) branches*=branch;
|
for(k=0;k<j+1;k++) branches*=branch;
|
//int branches=(player->branch)^j;
|
//int branches=(player->branch)^j;
|
//printf("branches %d player %d\n",branches,b_next[j+1][i].turn);
|
|
for (i = 0; i < branches; i=i+2) {
|
for (i = 0; i < branches; i=i+2) {
|
//if (b_next[next_j][i].turn != b->turn)
|
//if (b_next[next_j][i].turn != b->turn)
|
|
//printf("branches %d player %d %d %d\n",branches,b_next[j+1][i].turn,j,i);
|
if (turn[j] != b->turn)
|
if (turn[j] != b->turn)
|
//moves_next[j][i>>1].utility=mini(moves_next[j+1][i].utility,moves_next[j+1][i+1].utility);
|
//moves_next[j][i>>1].utility=mini(moves_next[j+1][i].utility,moves_next[j+1][i+1].utility);
|
utility[j][i>>1]=mini(utility[j+1][i],utility[j+1][i+1]);
|
utility[j][i>>1]=mini(utility[j+1][i],utility[j+1][i+1]);
|
else
|
else
|
//moves_next[j][i>>1].utility=maxi(moves_next[j+1][i].utility,moves_next[j+1][i+1].utility);
|
//moves_next[j][i>>1].utility=maxi(moves_next[j+1][i].utility,moves_next[j+1][i+1].utility);
|
