该链接内的代码为一个完整的六子棋博弈的代码,以下为一个Alpha-Beta剪枝搜索算法的伪代码,请根据链接内的六子棋完整代码用C语言修改伪代码并放进六子棋完整代码中,使原来的六子棋代码改为用Alpha-Beta剪枝搜索算法策略的新代码并能运行出来
int AlphaBeta (int Depth ,int Color ,int Alpha ,int Beta){
if(Depth =0)
{
LeavesValu e =EvaluateLe aves();
return LeavesValu e;
}
else(Depth ≠0)
{
AddPossibl eMove (Color ,Width);
if(IsMaxNode(Depth))
{
foreach(Lisway)
SimulateMo ve();
Score =AlphaBeta(Depth ,ThreatColo r,Alpha,Beta);
Re storeMove ();
if(Score >Alpha)
{
Alpha =Score;
if(Depth =MaxDepth )
{
Re coedPo int s;
}
if(Alpha ≥Beta )return Beta;
}
}
return Alpha;
}
else
{
foreach(Lisway )
{
SimulateMo ve();
Score =AlphaBeta(Depth ,0wnColor ,Alpha ,Beta);
Re storeMove ();
if(Score<Beta )Beta =Score;
if(Alpha ≥Beta)
{
return Alpha;
}
}
return Beta;
}
}