I'm creating playing chess algorithm and i use transposition table, but searching for position that occured before takes a lot of time on deeper levels.
My comparing is just creating Zobrist's hash of the position and going through my table with previosly added positions.
Is there any way to improve this comparing? Should it look like this (values below) or am I doing something wrong? My search calculates 7 plies.
Here are some numbers: without transposition table: 577576 nodes in 4928ms (117 nodes per ms)
transposition table search on ply 3 and 4: 407658 nodes in 3852ms (105 nodes per ms)
transposition table search on ply 3,4,5: 243348 nodes in 2695ms (90 nodes per ms)
transposition table search on ply 3,4,5,6: 197984 nodes in 2757ms (71 nodes per ms)