On Wed, 2007-01-24 at 21:11 +0100, alain Baeckeroot wrote: > Le mercredi 24 janvier 2007 19:56, Stuart A. Yeates a écrit : > > Since no one has mentioned bounding memory, a complete lookup table (a > > complete table of correct moves, perfect-hashed by board state) should do > > the trick. > > With 10^170 legal position for 19x19 what would be the size of this table ? > I m afraid we cannot build it with all the matter in visible universe.
I'm glad you set us straight on that. - Don > Cheers. > Alain > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
