Nah, hash tables are amortized O(1). As long as you can address all that memory, 300MHz should be sufficient.
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/
