Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!bellcore!decvax!genrad!panda!talcott!harvard!seismo!umcp-cs!aplcen!jhunix!ins_apmj
From: ins_apmj@jhunix.UUCP (Patrick M Juola)
Newsgroups: net.puzzle
Subject: Multi-D Tic-Tac-Toe
Message-ID: <2044@jhunix.UUCP>
Date: Sat, 1-Mar-86 11:04:42 EST
Article-I.D.: jhunix.2044
Posted: Sat Mar  1 11:04:42 1986
Date-Received: Mon, 3-Mar-86 01:22:54 EST
Reply-To: ins_apmj@jhunix.ARPA (Patrick M Juola)
Distribution: net
Organization: Johns Hopkins Univ. Computing Ctr.
Lines: 20


[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