Author: Mike Adams
Date: 03:06:19 09/20/00
Go up one level in this thread
Maybe this database can be online. It could utilize a huge hardrive and a
standarized hashing scheme so it doesnt have to search the harddrive but just
index the position. If it was a final position it would be nice to have the
score so you dont have to evaluate it. the scoreing alorithm though would have
to be fairly standarized and this might now work because every chess programer
has his own way of scoreing. But just best move could be interesting too. This
move could be played first to get better move ordering and speed up the program.
Actually what is interesting to me about this is it is essentially the same
idea as hashing. When you hash you save all previous stored postions so if you
come across it again you know what the best move and if its been searched to
equale depth you can even take the score. Same position of course can occor
twice. e4 e5 nf3. and nf3 e5 e4 ect. transpositions.
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.