| Line 28... |
Line 28... |
return (x<=y)?x:y;
|
return (x<=y)?x:y;
|
}
|
}
|
int maxi(int x,int y){
|
int maxi(int x,int y){
|
return (x>=y)?x:y;
|
return (x>=y)?x:y;
|
}
|
}
|
static AIWEIGHT df_search(Board *b, AIMoves *moves,index_array *index, Player *player,
|
int mod2(int x){
|
int depth, int cache_index,
|
#pragma bitsize x 5
|
PIECE searched, AIWEIGHT alpha, AIWEIGHT beta)
|
int ans[16]={0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1};
|
|
return ans[x];
|
|
}
|
|
int mod5(int x){
|
|
#pragma bitsize x 5
|
|
int ans[16]={0,1,2,3,4,0,1,2,3,4,0,1,2,3,4,0};
|
|
return ans[x];
|
|
}
|
|
/*static*/ AIWEIGHT df_search(Board *b, AIMoves *moves,/*index_array *index,*/ Player *player,int depth, int cache_index, PIECE searched, AIWEIGHT alpha, AIWEIGHT beta)
|
/* Depth is in _moves_ */
|
/* Depth is in _moves_ */
|
{
|
{
|
#pragma internal_fast index
|
#pragma internal_fast index
|
int i, j;
|
int i, j;
|
#pragma bitsize i 16
|
#pragma bitsize i 16
|
| Line 42... |
Line 50... |
Board b_next[2][16];
|
Board b_next[2][16];
|
#pragma internal_blockram b_next
|
#pragma internal_blockram b_next
|
AIMoves moves_next[2][16];
|
AIMoves moves_next[2][16];
|
#pragma internal_fast moves_next
|
#pragma internal_fast moves_next
|
AIWEIGHT utility[5][16];
|
AIWEIGHT utility[5][16];
|
|
#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;
|
| Line 78... |
Line 87... |
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 current_j=j % 2;
|
int next_j=(j+1) % 2;
|
//int next_j=(j+1) % 2;
|
|
int current_j=mod2(j);
|
|
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 (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;
|
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[current_j][i>>1].data + (i % branch));
|
//AIMove aim = *(moves_next[current_j][i>>1].data + (i % branch));
|
|
AIMove 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);
|
| Line 146... |
Line 158... |
//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,next_j,i,moves_next,index);
|
ai_threats(b_next,next_j,i,moves_next/*,index*/);
|
utility[j+1][i]=moves_next[next_j][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);
|
| Line 231... |
Line 243... |
AIMoves moves;
|
AIMoves moves;
|
#pragma internal_blockram moves
|
#pragma internal_blockram moves
|
moves.len=0;
|
moves.len=0;
|
Board copy;
|
Board copy;
|
#pragma internal_blockram copy
|
#pragma internal_blockram copy
|
index_array index={0};
|
/*index_array index={0};*/
|
#pragma internal_fast index
|
#pragma internal_fast index
|
//AIFunc move_func = ai(player->ai)->func;
|
//AIFunc move_func = ai(player->ai)->func;
|
|
|
/* Player is not configured to search */
|
/* Player is not configured to search */
|
//if (player->search == SEARCH_NONE)
|
//if (player->search == SEARCH_NONE)
|
| Line 288... |
Line 300... |
//copy = board_new();
|
//copy = board_new();
|
board_copy(b, ©);
|
board_copy(b, ©);
|
//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("FINAL WEIGHTS %d %d \n\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;
|
// if (cache_moves->len)
|
// if (cache_moves->len)
|
// aimoves_copy(cache_moves, moves);
|
// aimoves_copy(cache_moves, moves);
|
