Author: Jay Scott
Date: 14:16:43 01/03/03
Go up one level in this thread
On January 02, 2003 at 07:19:18, Dieter Buerssner wrote: >On January 02, 2003 at 06:03:58, Edward Seid wrote: > State-space Game-tree >> Complexity Complexity >> ----------- ---------- >[...] >>13. Nine Men's Morris 10^10 10^50 >But Nine Men's Morris is solved (from what I read here and at other places). Yes, Nine Men's Morris was solved by state-space search, that is, by a big lookup table. Think of it as an endgame database that includes the entire game. :-) If the tree complexity were the smaller number, then solving by forward search would make sense. Jay
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.