Basically, the larger the better provided it all fits into physical memory
with no chance of paging out to disk. It's not going to fit into the L2
cache anyway....

Basically, run a simple test...

With whatever test suite you have, try it with various sizes.

The odds are good you'll see that the larger it is, the better the program
performs, with the improvements slowing down the larger the table size gets.

If you have the memory and it's not being used for anything else, then why
not use it? You have nothing to loose by doing so because a larger hash
table will never make a program play worse (unless there are bugs in the
program, and a few pathological test cases.)


Incidentally, this newsgroup is no longer suitable for discussions of
computer chess. Too much spam, Sam Sloan, USCF, etc. etec. garbage.

Most chess programmers have moved over to:

http://www.talkchess.com/forum/viewf...opic_view=flat

(They have several forums, but that's the programmer's forum.)


"dkraft" wrote in message
...
Hi,

How large should the hash table size be?
The large the better?
Or is 1536 MB wasting hash memory?
And is 512 MB enough?

Thanks
Dieter