Re: sub-optimal code for packed boolean arrays -- bug or inherent limitation

[Harald Korneliussen <vintermann@gmail.com>]

On Jul 4, 5:22 am, "Steve" <nospam_steve...@comcast.net> wrote:

> I work frequently with time intensive code where simulating more
> permutations translate to more value recovered.  These small differences in
> code generation seldom have a significant impact on the overall performance.
> Greater benefits are found by changes to algorithms or approaches to a
> problem.
>

If Alinabi went looking for a better chess playing algorithm, he'd
have to be either a seriously good SC researcher, or wasting his time.
It's well-trodden ground. Arguably, the opitimization isn't premature
either, since it seems this is very much what writing a competitive
chess program is about.