Help implementing a simple minimax algorithm

Question

Okay Im making a minimax algorithm for Tic Tac Toe to try to learn some basics of it but I hit a wall
protected int winValue(int indexOne, int indexTwo)
    int[][] tempBoard = new int[3][3];
    int winValue;
    for(int i = 0; i < 3 ; i++)
      for(int b = 0; b < 3; b++)
        tempBoard[i] = ticTacToeBoard;
if(Player == false)
{tempBoard[indexOne][indexTwo] = 1;}
else if(Player == true)
{tempBoard[indexOne][indexTwo] = 2;}
for(int i = 0; i < 8; i++)
int one = tempBoard[winGameChecks[i][0][0]][winGameChecks[i][0][1]];
int two = tempBoard[winGameChecks[i][1][0]][winGameChecks[i][1][1]];
int three = tempBoard[winGameChecks[i][2][0]][winGameChecks[i][2][1]];
if(one != 0 && one == two && three == two)
Win = true;
if(Win == true)
winValue = -1;
Win = false;
else if(block(indexOne,indexTwo) == 0)
winValue = 0;
else
winValue = 1;
return winValue;
Okay
win game checks is basically all the possible wins for victory in tic tac toe
protected int[][][] winGameChecks =
        { {0,0},{0,1},{0,2} },
        { {0,0},{1,0},{2,0} },
        { {0,0},{1,1},{2,2} },
        { {0,1},{1,1},{2,1} },
        { {0,2},{1,2},{2,2} },
        { {1,0},{1,1},{1,2} },
        { {2,0},{2,1},{2,2} },
        { {2,0},{1,1},{0,2} }
  };TictacToeboard is the actual board from rows 0-2 and colums 0-2
indexOne is the row
indexTwo is the colum
This code is to determine the win value of each move, -1 for a win, 0 for a draw or block and 1 for a random move
in my head this seemed to work, but whenever I call the method, it always returns 1
and the method block is this
protected int block(int indexOne, int indexTwo)     //to determine the win value if blocking
  {                         //return 0 if the move is a block, -1 if block failed
    for(int i = 0; i < 8; i++)
      int one = ticTacToeBoard[winGameChecks[0][0]][winGameChecks[i][0][1]];
int two = ticTacToeBoard[winGameChecks[i][1][0]][winGameChecks[i][1][1]];
int three = ticTacToeBoard[winGameChecks[i][2][0]][winGameChecks[i][2][1]];
if(indexOne == three)
if(one != 0 && one == two && three == 0)
{return 0;}
else if(indexOne == one)
if(one != 0 && three == two && one == 0)
{return 0;}
else if(indexOne == two)
if(one != 0 && one == three && two == 0)
{return 0;}
return -1;
if anyone wants to read this through and help me I'd appreciate it

Answer 1

helped a little but now when I try to return the right node with the lowest value, it always gives a random move...
protected void minMoves()
          int winValue;
          ArrayList bestMoves = new ArrayList(0);  //TreeNode of arrays of best moves
          TreeNode temp;
          int row;
          int col;
          for(int i = 0; i < 3; i++)    //makes children with moves remaining
               for(int b = 0; b < 3; b++)
                    if(movesLeft[0] != -1 && movesLeft[0] != -1)
                    row = movesLeft[0];
                    col = movesLeft[1];
                    winValue = winValue(row, col);
                    TreeNode add = new TreeNode(row,col,winValue);
                    computer.addNode(add);
for(int i = 0; i < computer.getLength(); i++)//used for debuggin
temp = new TreeNode((TreeNode)computer);
System.out.println("Cord" + computer.getIndex(i).getRow() + " " + temp.getIndex(i).getCol());
          for(int i = 0; i < computer.getLength(); i++) //go through all the children nodes
          if(computer.getIndex(i).winValue() == -1)
          temp = computer.getIndex(i);
          bestMoves.add(temp);
          else if (computer.getIndex(i).winValue() == 0 && bestMoves.size() == 0)
          temp = computer.getIndex(i);
          bestMoves.add(temp);
          else if (computer.getIndex(i).winValue() == 1 && bestMoves.size() == 0)
          temp = computer.getIndex(i);
          bestMoves.add(temp);
          for(int i = 0; i < bestMoves.size(); i++)
          temp = new TreeNode((TreeNode)bestMoves.get(i));
          System.out.println("Cord" + temp.getRow() + " " + temp.getCol());
          //Now I have an arraylist of the best moves possible
          //Now to pick a random of the best moves.
          Random ranGen = new Random();
          int random = ranGen.nextInt(bestMoves.size());
          temp = new TreeNode((TreeNode)bestMoves.get(random));
          row = temp.getRow();
          col = temp.getCol();
          ticTacToeBoard[row][col] = 2;
          computer = new TreeNode(row, col, winValue(row, col));
          removeUsedMove(row, col);
          OutputBoard();
          //Next Players Turn
          Player = false;
Help please, my head is hurting over this