Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: speed question

Author: Filip Tvrzsky

Date: 08:06:28 02/20/03

Go up one level in this thread


On February 20, 2003 at 09:59:13, Uri Blass wrote:

>
>I see that it does not help me.
>

It's a pity, because this approach was really usefull for me, but you know, each
program is a different case and what works in one doesn't work in other. It is
hard to say why it doesn't help you. There are so many dependencies ...
Probably this approach claims some deeper changes of your implementation in
order to gain from it. The main idea here is IMO to restrict the memory access
...

>I had to replace in hundreds of places in my code and after all the job I have 2
>problems from the opening position:
>1)The code is slightly slower in the first ply(1% slower)
>2)The bigger problem:after more than 40 seconds I start to get different number
>of nodes(maybe I did a mistake in one of my replaces).
>
>Uri

Of course such a change in implementation basics is very dangerous and work
intensive operation. I hope you have some handy testing and debugging code and a
backup of your original code too ...

Filip



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.