Author: Ferdinand S. Mosca
Date: 09:51:50 09/14/03
Go up one level in this thread
On September 14, 2003 at 12:03:44, Uri Blass wrote:
>On September 14, 2003 at 10:59:43, Ferdinand S. Mosca wrote:
>
>>On September 14, 2003 at 09:28:07, Uri Blass wrote:
>>
>>>I know that usually top programs do not evaluate a lot of special cases about
>>>endgames like situation of theoretical draw of KRPPP vs KRPP when the pawns are
>>>in the same side
>>>
>>>My question is if except having more important things to do there is a speed
>>>reason for programmers not to have big code for rare cases when calculating if
>>>the rare cases happen is cheap but calculating the evaluation is not cheap?
>>
>>Hello Uri, Will you simplify your question above?
>
>My question is if increasing the size of a chess program can reduce its speed.
>
>I assume for the discussion that
>99% of the program is almost never done.
>
>Suppose that a programmer writes long code for a lot of special cases about
>specific endgames.
>
>Assume that detecting that you are not in one of the special cases is cheap.
>
>Can writing the long code reduce the speed of the program significantly even in
>case that the program almost never get the special cases in the search?
>
>Uri
It will surely reduce the speed of the program, but not significantly.
("almost never")
Also if the search to a special case position has been cut earlier, it could
also be a potential, to search faster to another special case position.
Ferd
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.