Logic Bug need getting rid of

Question

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
    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;
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 == 1 && two == 1 && three == 2)
{return 0;}
if(one != 0 && three == 1 && two == 1 && one == 2)
{return 0;}
if(one != 0 && one == 1 && three == 1 && two == 2)
{return 0;}
return -1;
Part of my tic tac toe program, Ive narrowed down my logic problem to here. I am using a minimax algorithm and the block method is the only one that can set the my winValue for the minimax to 0, after the first 2 times this thing is called, it does what its supposed to do and check for the positions that a computer can use to block, now a problem arises when the third time it is called, all my winValues for all the moves are set to 0 and the computer doesn't think like it should and just makes a random move, same thing happens with moves beyond 3. The block method is called through a forloop and is called the same was it is called the first 2 times so it has to be somewhere in the method itself where the error is occurring. If someone can help point it out, Id be most appreciative. Ill look on my own as well and see if I can find it

Answer 1

it goes to see if it can find a win and if it can a -1 appears as the win value of that move
I have a tree worth of nodes which each hold a different move, to determine the effectiveness of that node, the winvalue is determine for each node first then chosen in the order of negative numbers to positive numbers. The computer doesn't know which move to take yet, so it makes a children worth of nodes which contains all the possible moves the computer can make. It assigns each a winValue and it takes the -1 if there is one. Then it takes the 0 if there is one and then it takes the +1 if there is one. If there is more than one of each, a random number is generated and a random one is picked. The problem is that when 2 X's are adjacent, the winValue for everything that should be a +1 or a 0 is turned into a 0 and when the computer really should block, it picks a random move instead since all the winvalues become 0.