implementation algorithm

Question

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<result)result=val;

}

return result;

}