On Wed, 2007-01-24 at 18:56 +0000, Stuart A. Yeates wrote: > > On 1/24/07, Don Dailey <[EMAIL PROTECTED]> wrote: > I am fairly sure a perfect program would be impossible, even > among > the set of all possible programs that could find a move within > let's > say 60 seconds per move. > > 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.
Yes, but I was assuming a modern desktop system of today. Otherwise, I can write a program today that will play perfectly even without the memory. - Don > cheers > stuart > > > > > _______________________________________________ > 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/
