Jump to content

  • Log In with Google      Sign In   
  • Create Account

We're offering banner ads on our site from just $5!

1. Details HERE. 2. GDNet+ Subscriptions HERE. 3. Ad upload HERE.


#Actualpatishi

Posted 07 July 2013 - 08:39 PM

yes,right now i am starting with the hash move and than trying my two killers..after that i just continue to go through the rest of the columns list that wasn't played.  
I also got some very good improvements with the killer moves (and the TT ofcourse).  but like i said,i am not doing nothing at the root negamax and i think that this is the main reason that the search is not optimal.            I am not using iterative deepening yet,but i will investigate about it.         thx!


#2patishi

Posted 07 July 2013 - 08:32 PM

yes,right now i am starting with the hash move and than trying my two killers..after that i just continue to go through the rest of the columns list that wasn't played.  
I also got some very good improvements with the killer moves (and the TT ofcourse).  but like i said,i am not doing nothing at the root negamax and i think that this is the main reason that the search is not optimal.            I am not using iterative deepening yet,but i will investigate about it.         thx!

 

 

EDIT: by the way, is it possible to implement history heuristic and killer heuristic at the same time?


#1patishi

Posted 07 July 2013 - 07:53 PM

yes,right now i am starting with the hash move and than trying my two killers..after that i just continue to go through the rest of the columns list that wasn't played.  
I also got some very good improvements with the killer moves (and the TT ofcourse).  but like i said,i am not doing nothing at the root negamax and i think that this is the main reason that the search is not optimal.            I am not using iterative deepening yet,but i will investigate about it.         thx!


PARTNERS