please help me to implementation this algorithm
int min-MaxSearch(node state)
{
temp=max(node state);
return the move that produces Successors of current state;
}
int max(state)
{
for(s is terminal state)
return Utility(state);
E=expand(state);
result=-9999
for(every state in E )
{
val=min(x);
if(val>result)result=val;
}
return result;
}
int minstate)
{
for(s is terminal state)
return Utility(state);
E=expand(state);
result=9999
for(every state in E )
{
val=max(x);
if(val
}
return result;
}
1 Reply
Know the answer? Post it — somebody with the same question will find it here.
Sign in to answer this question
It is the same account you read, post and publish with — and you will come straight back to this page.
isra sweilehPosted Jul 5, 2013, 1:08 PM