Quoting Ingo Althöfer <[email protected]>:
Thanks for your postings, Magnus.
So Valkyria has a hash table which only stores the best move for the
position with a 64 bit hash (32 bits are not enough!) and log2 of the
number of visits (measuring quality of move) and log2 of the search
depth. Entries in the table is overwritten if quality is bad and depth
is deep. There are 4 million entries in the table and written to a
file the size is 50 MB.
Is there a reason to have such a small limit on the hash table size?
In computer chess, hash tables are typically in the Gigabyte range.
Because I use the rest of memory for the search tree. And it is
sufficently large because a MCTS will not produce as many evaluations
as a Chess program. I do not store all moves because most leaf nodes
in the tree will never be visited again.
Also I assume that a Gigabyte chess table is not stored to a file. Or
are they?
I never used chess program so I do not know.
If I play a game on CGOS with an empty table I think all nodes
generated for the entire game will fit in the hash table if I remember
correctly. Also harddrive access of the files storing and loading the
table is annoyingly time consuming. There is one table for each
boardsize and komi, so my old USB/sticks also run out of memory
quickly when I move several copies of different versions and so.
In short: I do not think I would get more performance if the tables
were larger so I keep it small because it is convenient.
magnus
Ingo.
--
Empfehlen Sie GMX DSL Ihren Freunden und Bekannten und wir
belohnen Sie mit bis zu 50,- Euro! https://freundschaftswerbung.gmx.de
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
