Quote:
|
Originally Posted by Aki
Shouldn't there be 9! = 362,880 ways to play it?
|
1) Perhaps there are 9! ways to play the game between two player.
2) There number of arrengment of O and X in the diagram is 2^9
3) The number of possible win of the game perhaps is C( 9, 3) =9!/(3!6!) <---i think this is wrong, but can anyone find the solution ?
3 much not be it. If one label the space of a tic tac toe game by a, b, c, d, e, f, g,h,i
To win a game, you need need 3 letters chosen from the set of {a, b, c, d, e, f, g,h,i}
ex: abc, bcd, ahi, cef ...etc
The thing is that not all 3 letter combinations are possible. the letter on the rim have( not corners) have 2 ways. The corners have 3 ways. the letter at the center have 4 ways. If they are all disjoint, then perhaps i could add those suckers together, but since those letter combine to form a win then it is really not that helpful.
