Computer Chess Club Archives

Search

Messages

Subject: Re: Bitboard question

Author: Georg v. Zimmermann

Date: 08:16:38 05/25/02

Go up one level in this thread

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

>On May 25, 2002 at 09:32:58, Russell Reagan wrote:
>
>>The problem is that you
>>have pseudo-attacks.
>
>No
>
>>Again, this seems like you could calculate pseudo-mobility,
>
>No
>
>You pick the right bitboard depending on the occupation of
>a rank/file/diagonal.
>
>You need to calculate bitboards in advance for every possible
>occupation of rank/file/diagonal.
>
>--
>GCP

• Re: Bitboard question Vincent Diepeveen 08:21:40 05/25/02
  • Re: Bitboard question Leen Ammeraal 09:42:44 05/25/02
    • Re: Bitboard question Vincent Diepeveen 13:04:52 05/26/02
  • Re: Bitboard question Gian-Carlo Pascutto 09:40:53 05/25/02
    • 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
  • Re: Bitboard question Georg v. Zimmermann 09:27:51 05/25/02

This page took 0.01 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.