Subject: Re: "Seeing" you opponent - Looking for an algorithim
References: <49j0oo$p1u@life.ai.mit.edu>
X-Newsreader: TIN [version 1.2 PL2]
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!fas-news.harvard.edu!newspump.wustl.edu!news.ecn.bgu.edu!vixen.cso.uiuc.edu!howland.reston.ans.net!newsfeed.internetmci.com!in1.uu.net!news00.sunet.se!sunic!news99.sunet.se!news.uni-c.dk!imada.ou.dk!breese
From: breese@imada.ou.dk (Bjorn Reese)
Message-ID: <1995Dec4.171132.29958@imada.ou.dk>
Sender: news@imada.ou.dk
Nntp-Posting-Host: wagner.imada.ou.dk
Organization: Dept. of Math. & Computer Science, Odense University, Denmark
Date: Mon, 4 Dec 1995 17:11:32 GMT
Lines: 15
Newsgroups: comp.ai.games

Michael Afergan (mikea@ai.mit.edu) wrote:

> 	Has anyone dealt with a problem like this?  Could you please explain 
> the most efficent way of dealing with this problem?  Even better - Could 
> someone post (or email me) the actual source code for such a method?

If I'm not totally mistaken Joseph O'Rourke wrote a book on that subject
called something like "The Watchman Algorithm" or similar. He usually
hangs out on comp.graphics.algorithms so you may want to ask there.

--
Bjorn Reese                      Email: breese@imada.ou.dk
Odense University, Denmark       URL:   http://www.imada.ou.dk/~breese

"It's getting late in the game to show any pride or shame" - Marillion
