Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Programming question

Author: Vincent Diepeveen

Date: 07:30:12 12/27/99

Go up one level in this thread


On December 27, 1999 at 09:53:28, Ulrich Tuerke wrote:

>>...
>>
>>No need to add move ordering info already when generating.
>>That's a bug from gnuchess which didn't know very well what
>>modular programming was.
>
>I don't see why this should be a bug.
>Vincent, do you think that performing move ordering later is more efficient ?
>Do you have an argument ?
>
>Uli

Yes the argument of neat programming, and your code ending up
in total chaos.

Apart from that, i use a different move ordering for quiescencesearch
than main search, as in qsearch i only see a few nodes and in mainsearch
i might take a look at all search.

The most important argument by far is your code ending up in total chaos,
unless you keep your move ordering simple.

Vincent



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.