Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: question about speed of big programs

Author: Ferdinand S. Mosca

Date: 07:59:43 09/14/03

Go up one level in this thread


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?

>
>In the relevant example you can assume that
>checking if a position is KRPPP vs KRPP is cheap but calculating if you can
>evaluate it as a draw position is not cheap.
>
>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.