Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Experimentation with move ordering

Author: Jeremiah Penery

Date: 23:53:42 11/28/00

On November 28, 2000 at 23:59:14, Ed Schröder wrote:

>Especially multiplies has been improved dramatically in the latest
>generation of processors. Nowadays it is hardly an issue anymore. I
>still use << where ever I can but I have no problems to use * so now
>and then.

It seems like compilers should produce the same assembly code for things like
a<<1 and a*2, but of course I'm not sure if they do.  Ditto for a>>1 and a/2.
(and also <<2 = *4, etc.)

Re: Experimentation with move ordering Bruce Moreland 12:38:26 11/29/00
Re: Experimentation with move ordering Eugene Nalimov 01:38:33 11/29/00
- Re: Experimentation with move ordering Dieter Buerssner 06:28:11 11/29/00
  - Re: Experimentation with move ordering Eugene Nalimov 10:21:35 11/29/00
    - Re: [OT] coding tricks (Was: Experimentation with move ordering) Dieter Buerssner 12:35:21 11/30/00
      - Re: [OT] coding tricks (Was: Experimentation with move ordering) Eugene Nalimov 16:50:46 11/30/00
        
        Re: [OT] coding tricks (Was: Experimentation with move ordering) Dieter Buerssner 08:54:07 12/01/00
        
        Re: [OT] coding tricks (Was: Experimentation with move ordering) Eugene Nalimov 01:49:51 12/02/00
  - A few assembly tricks Severi Salminen 08:41:37 11/29/00
- Re: Experimentation with move ordering Jeremiah Penery 02:55:26 11/29/00
  - Re: Experimentation with move ordering Bruce Moreland 12:50:43 11/29/00
    - Re: Experimentation with move ordering Jeremiah Penery 20:59:57 11/29/00
    - Re: Experimentation with move ordering James Swafford 16:33:17 11/29/00
      - Re: Experimentation with move ordering Bruce Moreland 21:33:49 11/29/00
- Re: Experimentation with move ordering Jeremiah Penery 02:54:42 11/29/00

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.