Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!news.mathworks.com!tank.news.pipex.net!pipex!in1.uu.net!ncrgw2.ncr.com!ncrhub6!daynews!falcon!news
From: Dick Menninger <Dick.Menninger@DaytonOH.ATTGIS.COM>
Subject: Re: Minesweeper
X-Nntp-Posting-Host: 149.25.99.44
Message-ID: <DDvt6q.Dt7@falcon.daytonoh.attgis.com>
Sender: news@falcon.daytonoh.attgis.com (News administrative Login)
Reply-To: Dick.Menninger@DaytonOH.ATTGIS.COM (mennid)
Organization: AT&T Global Information Solutions
X-Newsreader: DiscussIT 2.5.1.2 for MS Windows [AT&T Software Products Division]
References: <41igi6$fhn@uwm.edu>
Date: Fri, 25 Aug 1995 19:37:38 GMT
Lines: 27


> ==========Bruno Wolff III, 8/24/95==========
> 
> From article <41i4jl$s09@kernighan.cs.umass.edu>, by
> mcnulty@cs.umass.edu (John McNulty):
> > 
> > Along the frontier, the probability of a cell having a mine
IS readily
> > solved.  You know EXACTLY how many mines are along the
frontier and you
> > can calculate exactly the probability of each cell having a
mine.  Then
> 
> The following is a counter example to knowing how many mines are on the
> frontier, though this doesn't preclude most of your description on how
> to get probabilities for mines being located in specific locations.
> 
> ? 1 ? ? ? (The ones can be accounted for with either 1 or 2
> bombs along the
> ? 1 1 ? ?  frontier.)

This was the kind of situation I was remembering.  There are many
other patterns like this that can occur.

Good Day
Dick

