Author: Dieter Buerssner
Date: 11:58:49 04/05/03
Go up one level in this thread
On April 04, 2003 at 17:10:15, Russell Reagan wrote: >Instead of fiddling around with all of the special cases of when to hash this or >that, how well do you think a combination approach would work? Russell, I don't see much fiddling with special cases. To me it seems, you want to fix a problem, that does not exist. >Use (say) 32-bits >for the "board arrangement" hash key, and 32-bits for a "move list" hash key, >packed into one 64-bit hash key. Then you would only match positions that were >setup the same on the board and also had the same (pseudo) legal moves. Does >this do anything to solve any problems? Or does it only create new ones? I think, it should be not better, and possibly is worse. If you set up the board the same, you will have the same movelist anyway. So this is sort of redundant information. I know, I phrased this argument way too sloppy ... Regards, Dieter
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.