Author: John Coffey
Date: 13:55:12 09/29/98
Go up one level in this thread
Early last year I wrote an opening "database." It was a tree structure where each node stored the location of the next move and the next alternative move. Also stored at each node was the number of games that move had been played and the number of wins times 2 (to allow for draws.) The structure took 20 bytes for each node, and the database was based on one million games (up to move 24) and took a total of 600 megs. I burned it onto a CD and still use it in my own opening study. I can see a transposition table having an advantage in that it could take less space, although some comercial databases use 40 to 80 bytes per node. I could see a transposition table having a disadvantage of that it would require more disk-access. This is especially bad if the opening database is on CD. john coffey
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.