Author: Christophe Theron
Date: 17:52:26 09/25/03
Go up one level in this thread
On September 25, 2003 at 13:37:49, Uri Blass wrote:
>I decided to take back the changes that I did in the last months and start again
>from version 8080a.
>
>I am going to do part of the changes again but all the changes about incremental
>data are probably not going to be done.
>
>The changes that I did included information for every square about the queen
>directions that it is blocked by white and the queen directions that it is
>blocked by black when the information calculated incrementally.
>
>It also included directions that every piece can go.
>
>I thought that this information is good because it helped me in faster
>generation of moves(I do not need to check moves of the rook to direction that
>it cannot go) and I thought about it as an investment for the future because it
>may be a good idea to do the code slower if later a lot of things that I am
>going to do are going to become faster(like evaluating of trapped pieces).
>
>I decided that it is not a good idea because the speed of the program is not
>proportional to the number of calculations and it seems that having more arrays
>also does other things that I want to add slower because the program cannot use
>the fast memory for them.
>
>It caused me to change my opinion about slow searchers.
>I had the conception that slow searchers is a better design decision because it
>is possible to add knowledge with almost no price but this was based on a wrong
>assumption(the assumption that the speed is proportional to the number of
>calculations).
The wrong conception is to make a difference between slow and fast searchers.
Knowing that a program is a fast or slow searcher tells you absolutely nothing
about what it is doing inside. It also tells you absolutely nothing about its
strength and weaknesses.
Hence there is absolutely nothing to understand from this criteria and it is
absolutely useless to bother about it.
Christophe
>I think now that it is important not to use big arrays very often(some of the
>arrays in my old code are bigger but I use them less often).
>
>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.