Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Parallel algorithms in chess programming

Author: Gian-Carlo Pascutto

Date: 11:51:45 04/17/01

Go up one level in this thread


On April 17, 2001 at 13:30:22, Vincent Diepeveen wrote:

>> Are you sure you spend most of your time in eval? My problem is inCheck()
>>since ever. That's where my prog spends most of the time.
>>  The good thing is that, everytime I want to improve the speed of my
>>program, I know exactly where to focus on :)
>>  I suggest you to profile your program to know exactly where the time is
>>spend, although probably you've already done this.
>>
>>  Josť C.
>
>How can this eat system time anyway?

If you dont have any attack information available incheck can be
costly. In Sjeng it topped the running profile a long time, though only
with 15%-20% of the total time or so.

I speeded my incheck/legal_move up greatly by looking at the move last
played and figuring out if it could possibly have put the king in check.

You can apply a lot of tricks to make this very fast.

Now it is way down on the profile (>3% or so), and my program became about
6% faster. Now need to find a way to get SEE attack info quicker :)

--
GCP



This page took 0.2 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.