To do a complete lookup you would need more than 32 GB of memory, but I think that the question was more about making programs smarter more than it was about unlimited hardware. Infact, my question was what is the minimum hardware. That said, 300 Mhz should be plenty to do a lookup. There are what 10^170 legal positions. That means that if you were able to generate an index so that there was exactly one index into your lookup table for each legal position. You would need about a 564-bit number (or higher if it proved too difficult to make a unique continuous indexing function). You would be able to perform that lookup with a 1KHz computer in a reasonable amount of time (under a second) assuming the processor had a way to address all that memory (I think even 512-bit processors are still a bit over the horizen however...)
On 1/24/07, Chris Fant <[EMAIL PROTECTED]> wrote:
> 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. > > cheers > stuart You're going to need more than 300MHz to do that lookup. _______________________________________________ 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/
