Thread: C++ & Tic Tac Toe

Originally Posted by iMalc

Looks like you missed the diagonal win checks Mozza.

The best way to check for wins in TTT is to define an array of the win positions.

Code:

const int wins[][3] = {{0,1,2},{3,4,5},{6,7,8},{0,3,6},{1,4,7},{2,5,8},{0,4,8},{2,4,6}};

Of course you'd need to use a 1D array for the board, which you'd find produces much shorter code anyway.
Lookup tables FTW!

Ah you're right, I did miss them. I would prefer to use vector<vector<char&> >, but it's a shame C++ is averse to using references like that. I suppose vector<vector<tr1::reference_wrapper<char> > > could be used.

However, Mozza, we hadn't learned structures or classes at the point this was due, and we hadn't really gone into any depth with vectors. Now, of course, we are done messing with C++ and all of the above and are moving on to Linux.

Linux looks like it's going to be very very interesting. The professor has us choosing between Wubi, Ubuntu, or Knoppix. What do you think? These OS's are all new to me.

Thanks again to all who helped.