[computer-go] Can a computer beat a human?
alain Baeckeroot
alain.baeckeroot at laposte.net
Wed Jan 24 12:11:23 PST 2007
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.
Cheers.
Alain
More information about the computer-go
mailing list