thank you , i wll try it without the clearing process. actually in the 4 first moves i use an evaluation function and after that i am brut forcing to the end of the game tree,so i hope that this is still ok (to retain the positions searched in the "evaluation" part of the program).
and one more thing please.. i am trying to understand what exactly is a "hash move".. i know that when i am storing a position in my TT i should also store the best move (or something like that...). but when should i use it? at the beggining of alpha beta, when i am probing the table for a position, if the position is found in the table i just returning the score, or updating alpha/beta accordingly.. so when i get the change to use the hash move?? can you please advice on that?
I tries reading stuff on the net, but no one actually gets to the technical part
Edited by patishi, 07 July 2013 - 06:52 AM.