Computer Chess Club Archives

Search

Messages

Subject: Re: Bitboard question

Author: Gian-Carlo Pascutto

Date: 09:40:53 05/25/02

Go up one level in this thread

On May 25, 2002 at 11:21:40, Vincent Diepeveen wrote:

>On May 25, 2002 at 11:16:38, Georg v. Zimmermann wrote:
>
>>On May 25, 2002 at 09:49:50, Gian-Carlo Pascutto wrote:
>>
>>Exactly. And the only other problem are uncovered and covered attacks. But that
>>is solvable too.
>>Georg
>
>The problems are far greater.
>
>Please try to generate in bitboards mobility with for a bishop
>at each square a value in array
>
>   bishopvalues[64];

You can do this _EXACTLY_ as fast as normal mobility in
bitboards.

--
GCP

• Re: Bitboard question Vincent Diepeveen 14:29:03 05/25/02
  • Re: Bitboard question Gian-Carlo Pascutto 15:02:45 05/25/02
    • Re: Bitboard question Vincent Diepeveen 13:07:41 05/26/02
      • Re: Bitboard question Robert Hyatt 15:15:41 05/26/02
        • Re: Bitboard question Randall Jouett 20:41:51 05/26/02
          • Re: Bitboard question Russell Reagan 22:34:39 05/26/02
            • Re: Bitboard question Randall Jouett 08:44:20 05/27/02
        • Re: Bitboard question Vincent Diepeveen 15:48:11 05/26/02
          • Re: Bitboard question Robert Hyatt 18:17:35 05/26/02

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.