How to utilize miniMax algorithm in Checkers game

See more:

JavaSE

J2ME

game

, +

I am confused in the implementation of AI. I have generated all possible moves of computer's type pieces. Now I can't decide the flow. Whether I need to start a loop for the possible moves of each piece and assign score to it.... or something else is to be done.

Kindly tell me the proper flow/algorithm for this. Thanks

For piece's evaluation, I am using the following method:

public double score(int type, int aBoard[]) {
  double reds, blacks, ret=0.0;
  int loop;     

  for(reds=blacks=loop=0;loop<36;loop++) {
    switch(aBoard[loop]) {
    case 2: //redKingType:
      reds+=1;
    case 0://redType:
      reds+=1;
      break;
    case 3://blackKingType:
      blacks+=1;
    case 1://blackType:
      blacks+=1;
      break;
    default:
      break;
    }
  }
  switch(type) {
  case 0://redType:
    if(reds==0) {
      return 0.0;
    }
    if(blacks==0) {
      return 24.0;
    }
    ret=reds/blacks;
    if(ret>24 || ret<0) myErr("score(i,i)");
    return ret;
  case 1://blackType:
    if(reds==0) {
      return 24.0;
    }
    if(blacks==0) {
      return 0.0;
    }
    ret=blacks/reds;
    if(ret>24 || ret<0) myErr("score(i,i)");
    return ret;
  default:
    break;
  }
  return ret;
}  

Please suggest me if I need to change the evaluation function as well.