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.

>>5
I still prefer >>1-san's version. His example is the easiest to read and maintain. If there's an error with the game logic -- for example, if one the array indices was incorrect -- I'd have to do far more work to figure out the mistake in your code than in his code. Meanwhile, I highly doubt your ENTERPRISE optimisation is going to turnkey the performance metric to realtime.

This is a case of premature optimisation. Just leave it as is, OP, until you can demonstrate that it's a bottleneck to your program. Which it definitely isn't.