Author: Ulrich Tuerke
Date: 09:53:23 05/14/98
Go up one level in this thread
>... >I suggest that the program will use in calculating one second to >compute the difference between the best move and the second >best move. That shouldn't be a constant of one second but rather a reduction in time depending on the available time (level). If you have 10 minutes per move, why then reply immediately? >if the second best move and decide about maximal time >that it should consider the move. >It is only a small improvement >because most of the moves are not forced >but this improvement seem to me simple to program. > >if the next best move give the opponent >the possibility to do a checkmate the program should use only 1 >second calculating the move. I am sure that most programs use some kind of easy move algo. But it's not that simple. How about traps ? Recapture and loose. During the 1st few moves after having left the opening book, my program is very conservative in judging about easy moves; could be a prepared line ! Later in the gane when recognizing an easy move, I use a time maximum about 1/3 of the usual maximum. Still a risk though not replying immediately. >...
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.