极大极小搜索

最新推荐文章于 2024-07-06 22:59:20 发布

zym339

最新推荐文章于 2024-07-06 22:59:20 发布

阅读量252

点赞数

CC 4.0 BY-SA版权

文章标签：欢迎纠错

本文链接：https://blog.csdn.net/zym339/article/details/78653172

#include<iostream>
#include<stdlib.h>

using namespace std;

int n = 0,randseed = 0;

int canmoveto(int m,int dire);
int evaluation();
int dfs(int m,int mark);

int main()
{
cin>> n >> randseed;
srand(randseed);

cout<<dfs(n,1)<<endl;

return 0;
}

int canmoveto(int m,int dire)
{
return (rand() % 2);
}

int evaluation()
{
return(rand() % 21 - 10);
}

int dfs(int m,int mark)
{
int i;
int value;
int maxvalue = -10;

if(m == 0)
{
return (evaluation());
}
else
{
for(i=0;i<4;i++)
{
   if(canmoveto(m , i))
   {
    value = dfs(m - 1,mark * -1);

    if(mark * value > maxvalue)
    {
     maxvalue = mark * value;
    }
   }
}
}

return (mark * maxvalue);
}