Article View: alt.sources.d
Article #1528Re: Tic-Tac-Toe Program
From: Joel M. Hoffman
Date: Thu, 17 Dec 1992 16:48
Date: Thu, 17 Dec 1992 16:48
29 lines
1632 bytes
1632 bytes
In article <9689513@MVB.SAIC.COM> Whitten@Fwva.Saic.Com writes: >On a slightly different note, one of the neat things about Tic Tac Toe >is that there there are solutions which are rotationally equivalent. >ie: > > X | X | O is just a rotation of X | X | X > --------- --------- > X | O | | O | X > --------- --------- > X | | O O | | O > >Most people I know that discuss Tic Tac Toe (or even chess) >simply wave their hands and say "recognize that the position is a rotation >of another board and solve it the same as you solve the rotation." > >This implies to me that there are some "nice" data representations for boards >like this that has the reflective nature built in, but I have never seen >anyone actually publish them. > >Does anyone on the 'net want to tell the "tricks of the trade"? > Actually, TTT is one game where brute force seems to work better than advanced theory. There just aren't that many possibilities, even supposing rotations are distinct. It's not worth the trouble to rotate a TTT board. -Joel (joel@wam.umd.edu)
Technical Details
Message-ID:
<1992Dec17.164858.11378@wam.umd.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!haven.umd.edu!wam.umd.edu!joelReferences:
<1992Dec11.182925.14297@udel.edu> <1992Dec11.190631.10211@pony.Ingres.COM> <9689513@MVB.SAIC.COM>Show Full Headers
Complete Article Headers
Newsgroups: alt.sources.d,comp.sources.d,comp.misc Path: arc1-ca.pugleaf.net!sparky!uunet!haven.umd.edu!wam.umd.edu!joel From: joel@wam.umd.edu (Joel M. Hoffman) Subject: Re: Tic-Tac-Toe Program Message-ID: <1992Dec17.164858.11378@wam.umd.edu> Sender: usenet@wam.umd.edu (USENET News system) Nntp-Posting-Host: rac2.wam.umd.edu Organization: University of Maryland, College Park References: <1992Dec11.182925.14297@udel.edu> <1992Dec11.190631.10211@pony.Ingres.COM> <9689513@MVB.SAIC.COM> Date: Thu, 17 Dec 1992 16:48:58 GMT Lines: 29