Author: Uri Blass
Date: 08:24:18 12/06/01
Go up one level in this thread
On December 06, 2001 at 11:17:14, Severi Salminen wrote: >>>It is relatively a lot of work and if I have to do the last makemove then my >>>program is going to be clearly slower. >>> >>>my program needs 205 seconds to calculate perft 6 if you force it to make the >>>last ply that mean updating the attack arrays. >>> >>>Uri >> >>OK, whichever is fine by me as long as we do the same ;) > >So I AM the winner! My program takes 160 secs to make perft 6 from initial >position and that includes makemove()/unmakemove() of ALL moves (this includes >legality chech of course)! And it is on Celeron 300Mhz without external (or was >it internal) caches what so ever! I could make it probably still a little faster >by removing code but that would be stupid. > >I AM THE KING OF THE WORLD!!!! ...no?... > >Severi No You are not My task was not to calculate perft with make and unmake move but to calculate perft. legality check is not done in my makemove and I guess that legality check is done in your makemove. The main problem is that my makemove update the attack arrays and it is needed for generating the next ply moves because my gen function generate only legal moves not like your program. Uri
This page took 0.01 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.