Computer Chess Club Archives


Search

Terms

Messages

Subject: why do computers waste time about forced moves?

Author: blass uri

Date: 06:02:54 05/14/98


when I give junior to play with fritz I see both programs
waste time about forced moves(there is more than one legal move
but only one logical move to prevent checkmate.

I suggest that the program will use in calculating one second to
compute the difference between the best move and the second
best move.
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.

if the second best move lose a knight it should use more than
1 second(because maybe it is a mistake) but not much time.

I suggest the maximal time can be by the formula 1+(c/x)
when c is a constant and x is the difference between the best move
and the second best move (if the difference is more than a pawn)




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.