Author: blass uri
Date: 23:21:37 04/01/00
Go up one level in this thread
On April 01, 2000 at 23:17:11, Tina Long wrote: <snipped> >Eg. >guessed ply depths "well" searched for the first four choices over 24 hrs. > >Show 1 best: 1-19 2-15 3-15 4-15 >Show 3 best: 1-17 2-17 3-17 4-13 I think that show 1-best does not search the second best move and the third best move for only 15 plies. The computer use less time to calculate the second best move because proving that a move is weaker than the best move is usually easier relative to finding the exact value of the best move. I think that a better idea to improve programs at correspondence games may be something like that show 3-best in the first hour. 1-15 2-15 3-15 and now show only first best. The reason is that in this case you can remember the right killer moves for the second and third best and you can save time in iterations 16,17,18,19 for proving that the second best move is weaker. For examples suppose the third best move is losing because of forced mate. If you calculate only the best move it is possible that the program rejects the third best move because of losing a pawn and not because of a forced mate and waste a lot of time about it in iterations 16-19. There is usually not a forced mate but if you reject moves for the right reason you can save time I do not know if programs remember the right reason to reject the second best and the third best move if you go down from 3 options to one option so I do not know if my idea is good. The programmers can answer it. Uri
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.