Jump to content

  • Log In with Google      Sign In   
  • Create Account

Banner advertising on our site currently available from just $5!


1. Learn about the promo. 2. Sign up for GDNet+. 3. Set up your advert!


#Actualcryo75

Posted 04 July 2013 - 06:10 AM

I commented out the transposition table code. It is not always playing better. In some games, the AI has a clear win on the next move, however it stays moving other unnecessary pieces. Looks like this happens more often in the endgame.

 

I use 2 depths because (as you can see from the code above), I do:

 

1. check if the current depth is the maximum depth (maximum being that of the current iterative of the ID) and if it is, I exit the function, and

2. if current depth == 0, then the search is at the root and I need to save the the move too.

 

I don't know how I can eliminate one depth variable.


#1cryo75

Posted 04 July 2013 - 06:04 AM

I commented out the transposition table code. It might be playing better, however I've played only a couple of games against the AI. I might set up to AI's and play against each other. I also noticed no decrease in perfomance.

 

I use 2 depths because (as you can see from the code above), I do:

 

1. check if the current depth is the maximum depth (maximum being that of the current iterative of the ID) and if it is, I exit the function, and

2. if current depth == 0, then the search is at the root and I need to save the the move too.

 

I don't know how I can eliminate one depth variable.


PARTNERS