Author: Uri Blass
Date: 10:36:18 04/18/01
Go up one level in this thread
On April 18, 2001 at 07:40:21, David Rasmussen wrote: >But everyone today (including you) is writing programs that _does_ take into >account the realistic time controls that chess will be played at. > >As all of us know, there are basically two types of optimization, an algorithmic >one that will lower the time-complexity of a program, either by taking it to a >lower complexity class altogether (say from exponential to polynomial) or by >changing the constants involved in the asymptotic complexity of the program, for >example in the case of a*b^c, lowering the value (average) of a, b or c. Of >course we are much more interested in lowering c than lowering a, typically. But >if we can change a with a to 0.00000000000001 of its original value, while >increasing c to twice its value, it would often be a good idea, in practice, >given the time controls that chess programs work under. Yes but it is impossible to do it in chess because it means that you can calculate the first plies 1000000's times faster and it means that calculating a simple computatation like a+b is going to be slower than calculating the first plies. It may be possible to reduce a and increase c but it seems that it is going to do the program weaker because computers are very fast today. 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.