Tic Tac Toe

Does /prog/ know an efficient algorithm to check for a win/loss/draw in the game of Tic Tac Toe?

Let board be an array of integers where same numbers represent same players or blank, e.g. -1 and 1 for the players and 0 for blank.

Is there a more efficient alternative than checking it like this:
// check if player "1" won:
if ((board[0] == 1 && board[1] == 1 && board[2] == 1)
 || (board[3] == 1 && board[4] == 1 && board[5] == 1)
 || (board[6] == 1 && board[7] == 1 && board[8] == 1)
 || (board[0] == 1 && board[3] == 1 && board[6] == 1)
 || (board[1] == 1 && board[4] == 1 && board[7] == 1)
 || (board[2] == 1 && board[5] == 1 && board[8] == 1)
 || (board[0] == 1 && board[4] == 1 && board[8] == 1)
 || (board[2] == 1 && board[4] == 1 && board[6] == 1)) {
    // player "1" won
}

This is ucking fugly.

/* fix this shit because OP is an idiot */
for(int i = 0; i < 9; ++i) board[i] = ((1 - board[i] ^ 1) + 1) / 2

switch((board[4] & ((board[0] & board[8]) |
                    (board[1] & board[7]) |
                    (board[2] & board[6]) |
                    (board[3] & board[5]))) |
       (board[0] & ((board[1] & board[2]) |
                    (board[3] & board[6]))) |
       (board[8] & ((board[2] & board[5]) |
                    (board[6] & board[7]))))
{ case 1:
    /* player 1 wins */
    break;
  case 2:
    /* player 2 wins */
    break;
  default:
    abort("fix your shit, moron."); }

one comparison.