Author: Vincent Diepeveen
Date: 10:46:25 04/07/04
Go up one level in this thread
On April 07, 2004 at 12:37:47, Renze Steenhuisen wrote: Bugfree programming means you should store it. No worries about possible disasters that can happen taking the inverse. So take the inverse + store extra bit. Optimizing your code means you can go test whether you can get rid of this. >No, I do not > >>On April 07, 2004 at 10:24:41, Renze Steenhuisen wrote: >> >>Do you store 1 extra bit in hashtable who has the move? >> >>>Alright, I promised to get back on this... >>> >>>I tested my do_move and undo_move by comparing the incremental hashkey with the >>>freshly generated hashkey, and guess what: NO PROBLEM! The incremental system is >>>working just fine. >>> >>>Now what? >>> >>>I guess I'll be checking my retrieve_data_from_transposition_table() code >>>again... >>> >>>What could be wrong there? >>> >>>Any other ideas? >>> >>>Cheers! >>> Renze
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.