Author: blass uri
Date: 03:11:31 06/10/98
Go up one level in this thread
On June 08, 1998 at 18:42:07, Ed Schröder wrote: >Say you play the NPS tournament, Program_X gets 4:30 per move, >Program_Y gets 45:00 per move, both programs with permanent brain off. maybe Program Y will do better if it uses 10 minutes to find the 2 best moves in the position and 35 minutes to continue to search using the alpha beta algoritam what is the best move of the 2 (ignoring other moves). of course something like this is not a good idea at a fast rate because there is a big chance the program will miss the best move(not 1 of the 2) but I think in a slow rate most of the chances are that the program will not miss the best move and in this case so it should be better. I do not know if 45 minutes per move is slow enough for ideas like this but I believe an idea like this should be good at slow rate. 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.