Question: Suppose you have a chess program that can evaluate 1 million nodes per second. Decide on a compact representation of a game state for storage
Suppose you have a chess program that can evaluate 1 million nodes per second. Decide on a compact representation of a game state for storage in a transposition table. About how many entries can you fit in a 500MB in-memory table’? Will that be enough for the three minutes of search allocated for one move? How many table lookups can you do in the time it would take to do one evaluation? Now suppose the transposition table is larger than can fit in memory. About how many evaluations could you do in the time it takes to do one disk seek with standard disk hardware?
Step by Step Solution
3.54 Rating (171 Votes )
There are 3 Steps involved in it
With 32 pieces each needing 6 bits to specify its position on one of 64 squares we need 24 b... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
21-C-S-A-I (80).docx
120 KBs Word File
