From: bruno@cerberus.csd.uwm.edu (Bruno Wolff III)
Newsgroups: rec.games.abstract
Subject: Re: Nine Men's Morris!!
Date: 16 Nov 1995 21:32:54 GMT

>From article <48g33t$r0k@giga.bga.com>, by peat@bga.com (peter J. Farley):
] Does anyone have any info on this game?
] 
] ive played it for years and recently heard it had been solved by computer 
] guaranteeing a first player victory 100% of the time.  Where might i find 
] this solution?
] 

The following references were given in a paper on poker that was mentioned
here about a month ago.

R. Gasser, Applying Retrograde Analysis to Nine Men's Morris, Heuristic
Programming in Artificial Intelligence 2, (1990), 161-173.

R Gasser, Heuristic Search and Retrograde Analysis: their application to
Nine Men's Morris, Diploma thesis, Swiss Federal Institute of Technology,
Zurich, Switzerland, (1990).

D N L Levy and D F Beal (editors), Heuristic Programming in Artificial
Intelligence 2 - The Second Computer Olympiad, Ellis Horwood Limited,
Chichester, England, (1990).

==============================================================================

Newsgroups: sci.math
From: domnei@aol.com (Domnei)
Re: Lasca and Nine Men's Morris
Date: Thu Nov 19 17:51:38 CST 1998

>I was wondering if anyone knows about any theoretical, mathematical, or
>statistical studies on  the games Nine Men`s Morris and Lasca (or
>Laska). 

Samy -

I believe Nine Men's Morris has been solved - i.e., a complete
strategy is known.  I haven't read it myself, but try the following
paper:

R. Gasser (1996), Solving nine men's Morris,
in:  Combinatorial Games, Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA (R. J. Nowakowski, ed.), MSRI Publ. Vol.29,
Cambridge University Press, Cambridge

Mike Keith