Author: Nicolas Carrasco
Date: 20:30:01 09/30/99
As I have seen on some chess programs they do this time increment:
///////////////////////////////
depth = -1;
while(time () == 3/4)
{
++i;
alphabeta(i,-12000,12000);
}
////////////////////////////////
Here, if we have more time we play with one more depth, for example if we play
up to depth 4 and average of chess moves is 35: 35^4+35^3+35^2+35^1 that means
that if we directly searched with 4 depth we could search a 3.1 %
(aprox.)faster!
what other ideas?
Thanks
This page took 0 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.