Author: Robert Hyatt
Date: 06:03:54 08/27/01
Go up one level in this thread
On August 27, 2001 at 00:19:10, Pham Minh Tri wrote: >Thank Bob, I am very intested in your method to manage the time. Some my >additional questions: > >1) I see with this method program always runs out of time. As a result, in some >situations when some moves must be searched double time, the time is running out >quickly, program forces to search other moves much less time (e.g. 1/2 time). Is >it true? In a way, sure. If you spend more time on move N-1, then you will have less time for move N. However, in a game, there are "pivot" moves that will change the outcome. You want to find such moves and play them when they win, or avoid them when they lose. Spending 2x as much time to do this is worthwhile as otherwise you will play a move without knowing the game hangs on it. > >2) What will you do when program is pondering and human makes a move differs >from guess move? Continue to finish the current root move or stop pondering >immediately? Stop immediately and start searching on the right move. Hash table is not cleared so it is still likely that there are lots of transpositions that will speed the search. > >Best regards, >Pham >
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.