Thread: int into bits Bitwise

Originally Posted by jeffcobb

For one thing you are wasting two bits on each value when one will do (since it can only be X or O)

Ixnay Jeff; last time I played tick tack toe you start with a board with no X's or O's. So there are three possibilities per square, not 2. At least, this is what I have been presuming...

Originally Posted by bdillion

ok i understand the concept how how its trying to work all x and o are given a number x = 1 0= 0 anbd the position is also given a number 1= full 0= empty so x in position xero would be 11 and if no other spaces are full it would be 110000000000000000 16 bits 2 bytes, now im just confused how to actually make it so that it knows it full or empty

What do you mean by "full or empty"?