Article View: gnu.chess
Article #3761Re: To sort or not to sort?
From: Marcel van Kervinck
Date: Mon, 23 Dec 1996 00:00
Date: Mon, 23 Dec 1996 00:00
18 lines
1364 bytes
1364 bytes
Robert Hyatt (hyatt@cis.uab.edu) wrote:
> In short, you are looking at the wrong place to speed things up. The
> selection sort is a negligible part of the total search time. Trying to
> shave it further, at the expense of even slightly worse move ordering is not
> going to pay dividends... 1% faster sorting is quickly swamped by a 2%
> larger tree...
This weekend I just ran a few tests again. At least in my program there
doesn't seem to be a significant difference between using the 'latest'
history values and the 'old' history values. Doesn't mean other programs
won't benefit, ofcourse...
Marcel
-- _ _
_| |_|_|
|_ |_ Marcel van Kervinck
|_| buex95a@urc.tue.nl
Technical Details
Message-ID:
<59lo5g$9oj@tuegate.tue.nl>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<59dusn$4n$1@mhafc.production.compuserve.com> <59e219$1hm@juniper.cis.uab.edu> <59ec3f$dds@tuegate.tue.nl> <59flnr$ml9@juniper.cis.uab.edu>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 110df2,74603dfbdf933ad5 X-Google-Attributes: gid110df2,public X-Google-Thread: 10d71d,1d03c3c9facc2503 X-Google-Attributes: gid10d71d,public From: buex95a@asterix.urc.tue.nl (Marcel van Kervinck) Subject: Re: To sort or not to sort? Date: 1996/12/23 Message-ID: <59lo5g$9oj@tuegate.tue.nl> X-Deja-AN: 205828519 references: <59dusn$4n$1@mhafc.production.compuserve.com> <59e219$1hm@juniper.cis.uab.edu> <59ec3f$dds@tuegate.tue.nl> <59flnr$ml9@juniper.cis.uab.edu> organization: Eindhoven University of Technology, The Netherlands newsgroups: gnu.chess,rec.games.chess.computer