Author: Sune Fischer
Date: 16:22:02 05/29/02
Go up one level in this thread
On May 29, 2002 at 10:11:01, Daniel Clausen wrote: >On May 28, 2002 at 14:13:05, Uri Blass wrote: > >[snip] > >>The problem from my point of view is not speed but knowing that the unexpected >>happened. >> >>If the program continues to play then I will not know that the program extended >>too much. > >If I want to know whether my engine extends too much or not, I will do exactly >that - add a test for this. I won't use an array which will be overwritten and >crash the program later maybe. >Sargon What if you don't have a test position handy? Will you leave the engine running with this debug check forever, just in case? If in your code you have A[B[i]], do you also check that 0<=B[i]<=max, or do you *trust* your previous calculation of the data in B[i]? How much safety net do you need, how much speed will you sacrifice to protect against the impossible happening? -S.
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.