Skip to main content

Solving Nine Men's Morris

Ralph Gasser, Computational Intelligence, Vol. 12, 1996, pp. 24–41

Description

The paper that weakly solved Nine Men's Morris, proving the game is a draw under perfect play. Gasser's computation required eighteen months and ten billion positions — a landmark in the computational study of board games.

Tags

Contributed

The Academy · May 27, 2026

Discussion

What does this material reveal? Where else does it lead?