Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!news.sprintlink.net!news-peer.sprintlink.net!howland.erols.net!vixen.cso.uiuc.edu!uchinews!not-for-mail
From: espogrel@midway.uchicago.edu (Pogie)
Subject: Re: Unbeatable tic-tac-toe
X-Nntp-Posting-Host: kimbark-nfs.uchicago.edu
Message-ID: <DzBvMy.Jpr@midway.uchicago.edu>
Sender: news@midway.uchicago.edu (News Administrator)
Organization: The University of Chicago
References: <53m77m$nt0@dns2.inter.net.il> <325EBABD.5B87@ils.nwu.edu>
Date: Tue, 15 Oct 1996 17:37:46 GMT
Lines: 26

In article <325EBABD.5B87@ils.nwu.edu>,
John P DeMastri  <demastri@ils.nwu.edu> wrote:
>erezs@mail.inter.net.il wrote:
>> 
>> I've made an unbeatable tic-tac-toe game for DOS. I need everybody possible to
>> try to beat him.
>> Mail me for more information.
>
>Better yet - can't you prove mathematically that the rules you use to
>program the engine are optimal?  Wouldn't this nearly obviate the need
>to even WRITE the engine?
>
>John

I agree. There are only 3? maybe 4? unique opening moves in TTT, and one
can easily remember every counter move. The thing with TTT is that it's 
a game for which solving all possible games is trivial. You can predict,
on one sheet of loose leaf, every possible game that can be played. Try
modifying the engine for checkers, or even 4x4, instead of TTT.

Pogie
-- 
-----------------Hey CDA, Fuck You! (Go ahead, arrest me)-------------------
Eric Pogrelis                                     
espogrel@midway.uchicago.edu                      
The University of Chicago... Where fun comes to die
