|
|
/*
|
/*
|
|
|
connectk -- UMN CSci 5512W project
|
connectk -- UMN CSci 5512W project
|
|
|
*/
|
*/
|
|
|
//#include "config.h"
|
//#include "config.h"
|
//#include <string.h>
|
//#include <string.h>
|
//#include <glib.h>
|
//#include <glib.h>
|
//#include <iostream>
|
//#include <iostream>
|
//#include <stdio.h>
|
//#include <stdio.h>
|
#include "./shared.h"
|
#include "./shared.h"
|
#include "pico.h"
|
#include "pico.h"
|
//#include "../connectk.h"
|
//#include "../connectk.h"
|
|
|
/* Variables required to check for cache hits */
|
/* Variables required to check for cache hits */
|
//static int cache_id = -1, cache_depth = -1, cache_branch = -1;
|
//static int cache_id = -1, cache_depth = -1, cache_branch = -1;
|
//static SEARCH cache_search = -1;
|
//static SEARCH cache_search = -1;
|
//static AIMoves *cache_moves = NULL;
|
//static AIMoves *cache_moves = NULL;
|
//static AIWEIGHT cache_best;
|
//static AIWEIGHT cache_best;
|
//static Player *cache_player;
|
//static Player *cache_player;
|
//static AIFunc cache_func;
|
//static AIFunc cache_func;
|
//static BCOORD cache_size;
|
//static BCOORD cache_size;
|
|
|
int ai_stop=0;
|
int ai_stop=0;
|
int mini(int x,int y){
|
int mini(int x,int y){
|
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;
|
}
|
}
|
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];
|
}
|
}
|
/*static*/ AIWEIGHT df_search(Board *b, AIMoves *moves,/*index_array *index,*/ Player *player,int depth, int cache_index, PIECE searched, AIWEIGHT alpha, AIWEIGHT beta)
|
/*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
|
#pragma bitsize j 16
|
#pragma bitsize j 16
|
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
|
#pragma unpacked moves_next
|
#pragma unpacked moves_next
|
AIWEIGHT utility[5][16];
|
AIWEIGHT utility[5][16];
|
#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++)
|
// // if (moves->data[i].weight != moves->data[0].weight)
|
// // if (moves->data[i].weight != moves->data[0].weight)
|
// // break;
|
// // break;
|
// //moves->len = i;
|
// //moves->len = i;
|
// 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? */
|
if (!piece_empty(piece_at(&b_next[next_j][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;
|
}
|
}
|
|
|
/* Already searched here? */
|
/* Already searched here? */
|
///////////////////////////if (piece_at(&b_next[j+1][i], aim->x, aim->y) == searched){
|
///////////////////////////if (piece_at(&b_next[j+1][i], aim->x, aim->y) == searched){
|
/////////////////////////// moves_next[j+1][i].utility=moves_next[j+1][i>>1].utility;
|
/////////////////////////// moves_next[j+1][i].utility=moves_next[j+1][i>>1].utility;
|
/////////////////////////// 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[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");
|
// 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);
|
//aimoves_free(moves_next);
|
//aimoves_free(moves_next);
|
}
|
}
|
////////////////////////////////////////////////////////////////////////if (b_next[next_j][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[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) {
|
// for(j = MAX_DEPTH - depth; j > 0; j--)
|
// for(j = MAX_DEPTH - depth; j > 0; j--)
|
// //g_print("-");
|
// //g_print("-");
|
// //g_print("> d=%d, %s, u=%d, a=%d, b=%d %s\n",
|
// //g_print("> d=%d, %s, u=%d, a=%d, b=%d %s\n",
|
// // depth, bcoords_to_string(aim->x, aim->y),
|
// // depth, bcoords_to_string(aim->x, aim->y),
|
// // aim->weight, alpha, beta,
|
// // aim->weight, alpha, beta,
|
// // piece_to_string(b->turn));
|
// // piece_to_string(b->turn));
|
//}
|
//}
|
|
|
//board_free(b_next);
|
//board_free(b_next);
|
//if (aim->weight > alpha) {
|
//if (aim->weight > alpha) {
|
// alpha = aim->weight;
|
// alpha = aim->weight;
|
// //cache_set(cache_index, aim);
|
// //cache_set(cache_index, aim);
|
|
|
// /* Victory abort */
|
// /* Victory abort */
|
// if (alpha >= AIW_WIN)
|
// if (alpha >= AIW_WIN)
|
// return AIW_WIN;
|
// return AIW_WIN;
|
|
|
// /* 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);
|
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]);
|
|
|
//printf("%d %d\n",moves_next[j+1][i].utility,moves_next[j+1][i+1].utility);
|
//printf("%d %d\n",moves_next[j+1][i].utility,moves_next[j+1][i+1].utility);
|
}
|
}
|
}
|
}
|
|
|
//for(i=0;i<branch;i++){
|
//for(i=0;i<branch;i++){
|
//moves_next[0][0].data[i].x=moves->data[i].x;
|
//moves_next[0][0].data[i].x=moves->data[i].x;
|
//moves_next[0][0].data[i].y=moves->data[i].y;
|
//moves_next[0][0].data[i].y=moves->data[i].y;
|
//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;
|
|
|
return alpha;
|
return alpha;
|
}
|
}
|
|
|
int search(Board *b, AIMove *move, Player *player)
|
int search(Board *b, AIMove *move, Player *player)
|
{
|
{
|
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)
|
// return;
|
// return;
|
|
|
/* Moves list does not need to be searched */
|
/* Moves list does not need to be searched */
|
//if (moves->len <= b->moves_left) {
|
//if (moves->len <= b->moves_left) {
|
//// if (opt_debug_dfsc)
|
//// if (opt_debug_dfsc)
|
//// g_debug("DFS no choice abort");
|
//// g_debug("DFS no choice abort");
|
// return;
|
// return;
|
//}
|
//}
|
|
|
///* Board size changed, cache is invalidated */
|
///* Board size changed, cache is invalidated */
|
//if (board_size != cache_size)
|
//if (board_size != cache_size)
|
// cache_moves = NULL;
|
// cache_moves = NULL;
|
//cache_size = board_size;
|
//cache_size = board_size;
|
|
|
///* Cache hit, last or same board */
|
///* Cache hit, last or same board */
|
//if (player->cache && cache_moves && cache_moves->len &&
|
//if (player->cache && cache_moves && cache_moves->len &&
|
// cache_search == player->search &&
|
// cache_search == player->search &&
|
// cache_depth == player->depth &&
|
// cache_depth == player->depth &&
|
// cache_player == player &&
|
// cache_player == player &&
|
// cache_func == move_func &&
|
// cache_func == move_func &&
|
// cache_branch == player->branch) {
|
// cache_branch == player->branch) {
|
// if (b->parent && cache_id == b->parent->ac.id) {
|
// if (b->parent && cache_id == b->parent->ac.id) {
|
// aimoves_remove(cache_moves, b->parent->move_x,
|
// aimoves_remove(cache_moves, b->parent->move_x,
|
// b->parent->move_y);
|
// b->parent->move_y);
|
// cache_id = b->ac.id;
|
// cache_id = b->ac.id;
|
// }
|
// }
|
// if (cache_id == b->ac.id && cache_moves->len) {
|
// if (cache_id == b->ac.id && cache_moves->len) {
|
// if (cache_moves->len) {
|
// if (cache_moves->len) {
|
// aimoves_copy(cache_moves, moves);
|
// aimoves_copy(cache_moves, moves);
|
// if (opt_debug_dfsc)
|
// if (opt_debug_dfsc)
|
// g_debug("DFS cache HIT");
|
// g_debug("DFS cache HIT");
|
// return;
|
// return;
|
// }
|
// }
|
// aimoves_free(cache_moves);
|
// aimoves_free(cache_moves);
|
// cache_moves = NULL;
|
// cache_moves = NULL;
|
// }
|
// }
|
//}
|
//}
|
|
|
/* Cache miss */
|
/* Cache miss */
|
//if (opt_debug_dfsc)
|
//if (opt_debug_dfsc)
|
// g_debug("DFS cache MISS");
|
// g_debug("DFS cache MISS");
|
//cache_id = b->ac.id;
|
//cache_id = b->ac.id;
|
//if (!cache_moves)
|
//if (!cache_moves)
|
// cache_moves = aimoves_new();
|
// cache_moves = aimoves_new();
|
//cache_moves->len = 0;
|
//cache_moves->len = 0;
|
//cache_best = AIW_MIN;
|
//cache_best = AIW_MIN;
|
//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);
|
//} else {
|
//} else {
|
// board_free(copy);
|
// board_free(copy);
|
// g_warning("Unsupported search type %d", player->search);
|
// g_warning("Unsupported search type %d", player->search);
|
// return;
|
// return;
|
//}
|
//}
|
//board_free(copy);
|
//board_free(copy);
|
|
|
///* Debug DFS search */
|
///* Debug DFS search */
|
//if (opt_debug_dfsc)
|
//if (opt_debug_dfsc)
|
// dfs_cache_dump();
|
// dfs_cache_dump();
|
|
|
///* Save params so we can check if we have a hit later */
|
///* Save params so we can check if we have a hit later */
|
//cache_player = player;
|
//cache_player = player;
|
//cache_search = player->search;
|
//cache_search = player->search;
|
//cache_depth = player->depth;
|
//cache_depth = player->depth;
|
//cache_branch = player->branch;
|
//cache_branch = player->branch;
|
//cache_func = move_func;
|
//cache_func = move_func;
|
}
|
}
|
|
|
