Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!europa.chnt.gtegsc.com!howland.reston.ans.net!news.nic.surfnet.nl!spider.research.ptt.nl!gerwen.research.ptt.nl!M.J.A.M.vanGerwen
From: M.J.A.M.vanGerwen@research.ptt.nl (Emile van Gerwen)
Subject: Re: mine sweeper
Message-ID: <M.J.A.M.vanGerwen.102.000F6465@research.ptt.nl>
Sender: usenet@news.research.ptt.nl (USENET News System)
Nntp-Posting-Host: gerwen.research.ptt.nl
Organization: KPN Research
X-Newsreader: Trumpet for Windows [Version 1.0 Rev A]
References:  <3smu05$op4@maverick.tad.eds.com>
Date: Tue, 4 Jul 1995 13:24:25 GMT
Lines: 29


About 5 years ago I wrote a program in C ('miner') that tries to solve the 
mine sweeper problem. In fact it was written for the SUN 'mines' game: you 
have to walk from the upper left corner to the lower right corner (without 
hitting a mine ofcourse).

The program solves a mine field (10x10) within a second (no exact timing 
results). In the case it necessary to make a guess, the probability getting 
hurt as well as the direction towards the target (lower right corner) is taken 
into account.

I have a strong feeling that the program never makes a guess unless there is 
absolutely no way of making a safe single step by reasoning. I can't prove it, 
but I have played numerous games and presented a lot of 'difficult' situations.


Emile van Gerwen.






--------------------------------------------------------------------------
--  Emile van Gerwen             
--  KPN Research                            P.O.Box 421
--  Tel: +31-70-3326126                     2260 AK Leidschendam
--  Fax: +31-70-3326477                     The Netherlands
--------------------------------------------------------------------------
