Author: Alessandro Scotti
Date: 02:38:04 10/13/04
Go up one level in this thread
On October 12, 2004 at 22:49:29, Henry Hongdoyo wrote: >1) >I try to make 8-10 ply for my chess program. >Now My program can only reach 6 ply(fast). >I use all algorithm that i think important. >But it can't reach 8 ply fast. Why ? Difficult to say but a possible reason is too many nodes in the qsearch. Also, depth depends on the position: give your engine a position with only the kings and a few pawns and see how deep it goes! >3) >I have to many collision in TT when i try to >search(mtdf) in more than 6 ply ( >1000 in >quiescence). >To handle Collision, i use array temporary >and keep all collision in there. >What do u think ? it is normal or not ? >i use hash table size word*8, >zobrist key to handle index key, and >operation 'mod' to get the real key >(ZobristKey mod HashSize). Something that might help: 1) increase hash table size; 2) handle collisions with a good replacement policy, get rid of array temp; 3) use a 64-bit hash code; 4) make sure the random numbers you use to compute the Zobrist hash are good.
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.