Author: Alessandro Damiani
Date: 03:28:41 06/03/98
Go up one level in this thread
On June 02, 1998 at 06:49:16, Inmann Werner wrote: >Hello! > >Making programs faster is making them playing better.(?!) >OK >But in a match, if there is a time limit, it is important, that the >program thinks long at the right time, and not, when everything is >clear. >But to implement that is more then difficult. When is a move "clear"? >Maybe deeper, there is a fine combination. When should the program >take time to look deeper? > >any suggestion, which are common? Hi Werner! One idea I had some days ago was to use the definition of singularity at the root to decide whether to start the next iteration or not: If the best move is at least S better than all other moves, then stop the search. Since we know the score of the best move, the cost is testing the siblings with a null-window. So, when one move is obviously better than the others, the program will stop and play that move. Seems ok to me. But: is the cost worth it or not? I think not, but perhaps I am wrong? Ciao Alessandro
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.