ins_apmj@jhunix.UUCP (Patrick M Juola) (03/01/86)
[Bon Appetit...] As long as we're talking about tic-tac-toe (TTT)... When I was in high school, I had this really dull econ class. As in, when you looked up the word "dull" in the dictionary, it mentions that class as an example. The only things I remember from it are the gaming sessions I had during lectures, including a month spent experimenting with the finer points of TTT with varying sizes of boards. I submit: On a N-cube of size k, the first player has a forced win (i.e. can get k in a straight line.) iff k==N. If k<N, the game is a forced draw. I have no speculation about k>n. Any comments/disagreements/proofs? I can demonstrate the truth of this propostition for k=1,2,3;N=1,2,3, so I would be fascinated by any attempt at induction. Eagerly awaiting the flood of responses... Pat Juola Hopkins Maths