| Line 37... |
Line 37... |
{
|
{
|
#pragma internal_fast index
|
#pragma internal_fast index
|
int i, j;
|
int i, j;
|
#pragma bitsize i 16
|
#pragma bitsize i 16
|
#pragma bitsize j 16
|
#pragma bitsize j 16
|
Board b_next[5][16];
|
Board b_next[2][16];
|
#pragma internal_blockram b_next
|
#pragma internal_blockram b_next
|
AIMoves moves_next[5][16];
|
AIMoves moves_next[2][16];
|
#pragma internal_fast moves_next
|
#pragma internal_fast moves_next
|
AIWEIGHT utility[5][16];
|
AIWEIGHT utility[5][16];
|
|
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;
|
|
turn[0]=b->turn;
|
|
for(i=0;i<branch;i++){
|
|
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].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 71... |
Line 78... |
for(j=0;j<depth;j++){
|
for(j=0;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 next_j=(j+1) % 2;
|
|
if (b_next[current_j][0].moves_left <= 0) turn[j]=other_player(b_next[current_j][0].turn);
|
|
else turn[j]=b_next[current_j][0].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)){
|
if(!(utility[j][i>>1]==AIW_WIN || utility[j][i>>1]==-AIW_WIN)){
|
AIMove aim = *(moves_next[j][i>>1].data + (i % branch));
|
AIMove aim = *(moves_next[current_j][i>>1].data + (i % branch));
|
//printf ("aim->utility %d \n",moves_next[j][i>>1].utility);
|
//printf ("aim->utility %d \n",utility[j][i>>1]);
|
|
|
board_copy(&b_next[j][i>>1], &b_next[j+1][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? */
|
if (!piece_empty(piece_at(&b_next[j+1][i], aim.x, aim.y))) {
|
if (!piece_empty(piece_at(&b_next[next_j][i], aim.x, aim.y))) {
|
//g_warning("DFS utility function suggested a bad move "
|
//g_warning("DFS utility function suggested a bad move "
|
//"(%s)", bcoords_to_string(aim->x, aim->y));
|
//"(%s)", bcoords_to_string(aim->x, aim->y));
|
//printf("bad move\n");
|
//printf("bad move\n");
|
continue;
|
continue;
|
}
|
}
|
| Line 97... |
Line 109... |
/////////////////////////// continue;
|
/////////////////////////// continue;
|
///////////////////////////}
|
///////////////////////////}
|
///////////////////////////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[j+1][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;
|
|
|
|
|
/* Player has changed */
|
/* Player has changed */
|
if (b_next[j+1][i].moves_left <= 0) {
|
//printf("depth %d branches %d turn %d \n\n",j,branches,turn[j]);
|
b_next[j+1][i].moves_left = place_p;
|
if (b_next[next_j][i].moves_left <= 0) {
|
b_next[j+1][i].turn = other_player(b->turn);
|
b_next[next_j][i].moves_left = place_p;
|
|
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[j+1][i].moves_left--;
|
b_next[next_j][i].moves_left--;
|
|
|
/* Did we win? */
|
/* Did we win? */
|
|
|
if (check_win_full(&b_next[j+1][i], aim.x, aim.y,0,0,0,0)){
|
if (check_win_full(&b_next[1][i], aim.x, aim.y,0,0,0,0)){
|
aim.weight = AIW_WIN;
|
aim.weight = AIW_WIN;
|
moves_next[j+1][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 ){
|
//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 {
|
|
|
| Line 132... |
Line 146... |
//if (!func) {
|
//if (!func) {
|
// g_warning("DFS player has no AI function");
|
// g_warning("DFS player has no AI function");
|
// return moves->utility;
|
// return moves->utility;
|
//}
|
//}
|
//moves_next = func(b_next);
|
//moves_next = func(b_next);
|
ai_threats(b_next,j+1,i,moves_next,index);
|
ai_threats(b_next,next_j,i,moves_next,index);
|
utility[j+1][i]=moves_next[j+1][i].utility;
|
utility[j+1][i]=moves_next[next_j][i].utility;
|
|
|
//aim->weight = df_search(&b_next, &moves_next, index,player,
|
//aim->weight = df_search(&b_next, &moves_next, index,player,
|
// depth - 1, next_ci, searched,
|
// depth - 1, next_ci, searched,
|
// next_alpha, next_beta);
|
// next_alpha, next_beta);
|
//aimoves_free(moves_next);
|
//aimoves_free(moves_next);
|
}
|
}
|
if (b_next[j+1][i].turn != b->turn)
|
////////////////////////////////////////////////////////////////////////if (b_next[next_j][i].turn != b->turn)
|
//moves_next[j+1][i].utility=-moves_next[j+1][i].utility;
|
//moves_next[j+1][i].utility=-moves_next[j+1][i].utility;
|
utility[j+1][i]=-moves_next[j+1][i].utility;
|
////////////////////////////////////////////////////////////////utility[j+1][i]=-moves_next[1][i].utility;
|
//if (moves_next[j+1][i].utility >= AIW_WIN)
|
//if (moves_next[j+1][i].utility >= AIW_WIN)
|
// moves_next[j+1][i].utility=AIW_WIN;
|
// moves_next[j+1][i].utility=AIW_WIN;
|
|
|
/* Debug search */
|
/* Debug search */
|
//if (opt_debug_dfsc) {
|
//if (opt_debug_dfsc) {
|
| Line 174... |
Line 188... |
//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;
|
}
|
}
|
}
|
}
|
for(j=depth-1;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);
|
//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[j+1][i].turn != b->turn)
|
//if (b_next[next_j][i].turn != 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);
|
utility[j][i>>1]=maxi(utility[j+1][i],utility[j+1][i+1]);
|
utility[j][i>>1]=maxi(utility[j+1][i],utility[j+1][i+1]);
|
| Line 199... |
Line 214... |
//moves_next[0][0].data[i].weight=moves->data[i].weight;
|
//moves_next[0][0].data[i].weight=moves->data[i].weight;
|
//}
|
//}
|
//moves_next[0][0].utility=moves->utility;
|
//moves_next[0][0].utility=moves->utility;
|
//moves_next[0][0].len=branch;
|
//moves_next[0][0].len=branch;
|
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;
|
moves->data[i].weight=utility[1][i];
|
moves->data[i].weight=utility[1][i];
|
}
|
}
|
moves->len=branch;
|
moves->len=branch;
|
|
|
| Line 275... |
Line 290... |
//ai_threats(©,&moves,&index);
|
//ai_threats(©,&moves,&index);
|
|
|
//if (player->search == SEARCH_DFS) {
|
//if (player->search == SEARCH_DFS) {
|
df_search(©, &moves, &index,player, player->depth, 0,
|
df_search(©, &moves, &index,player, player->depth, 0,
|
PIECE_SEARCHED, AIW_LOSE, AIW_WIN);
|
PIECE_SEARCHED, AIW_LOSE, AIW_WIN);
|
//printf("%d %d \n",moves.data[0].weight,moves.data[1].weight);
|
//printf("FINAL WEIGHTS %d %d \n\n",moves.data[0].weight,moves.data[1].weight);
|
int ret_val;
|
int ret_val;
|
ret_val=aimoves_choose(&moves, move,&index);
|
ret_val=aimoves_choose(&moves, move,&index);
|
if (!ret_val)
|
if (!ret_val)
|
return 0;
|
return 0;
|
else return 1;
|
else return 1;
|
