Bitboard Info
 
Our goal is to release a working chess engine in Java, C++, and C# by April 24, 2003.

Team News:

March 25 Milestone met. (the protoype works!)

Everyone should download the Java code, run, and test it. Just download the newest versions of each of the five files and compile them.

March 20 Milestone met.

March 6 Milestone met.

We have basically started from scratch again as of March 1.


Meetings:

TBA

 

This is our bitboard:
R
N
B
K
Q
.
.
R
P
P
P
P
.
P
.
P
.
.
.
B
.
.
P
N
.
.
.
.
P
.
.
.
.
.
p
p
.
.
.
.
p
.
n
.
.
n
.
.
.
p
.
.
p
p
p
p
r
.
b
k
q
b
.
r

We can make a representation of anything from this.
for example:

spaces occupied by white pawns:
.
.
.
.
.
.
.
.
1
1
1
1
.
1
.
1
.
.
.
.
.
.
1
.
.
.
.
.
1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
spaces occupied by black pieces:
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
1
.
.
.
.
1
.
1
.
.
1
.
.
.
1
.
.
1
1
1
1
1
.
1
1
1
1
.
1

We can represent other things with bitboards also.
spaces attacked by black knights can be derived from a bitboard of black knights positions, and a jump table.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
.
1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
filtered with jump table->
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
1
1
.
1
.
1
.
.
1
1
.
.
1
.
.
.
.
.
.
.
.
1
.
.
1
1
.
.
1
.
1
.
1
1
.
1
.


now anded with the board of spaces occupied by black pieces tells us which spaces these knights can not jump to because the destination square is occupied by a friendly piece.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
1
.
.
.
.
1
.
1
.
.
1
.
.
.
1
.
.
1
1
1
1
1
.
1
1
1
1
.
1
and:
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
1
1
.
1
.
1
.
.
1
1
.
.
1
.
.
.
.
.
.
.
.
1
.
.
1
1
.
.
1
.
1
.
1
1
.
1
.
=
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
.
1
.
.
.
1
1
.
.
.

now logical xor with the jump bitboard and we get legal moves for these knights.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
.
1
.
.
.
1
1
.
.
.
xor:
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
1
1
.
1
.
1
.
.
1
1
.
.
1
.
.
.
.
.
.
.
.
1
.
.
1
1
.
.
1
.
1
.
1
1
.
1
.
=
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
1
1
.
1
.
1
.
.
.
1
.
.
1
.
.
.
.
.
.
.
.
1
.
.
1
.
.
.
.
.
1
.
.
.
.
1
.


then logical and this bitboard with white piece positions to compute captures.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
1
1
.
1
.
1
.
.
.
1
.
.
1
.
.
.
.
.
.
.
.
1
.
.
1
.
.
.
.
.
1
.
.
.
.
1
.
and:
1
1
1
1
1
.
.
1
1
1
1
1
.
1
.
1
.
.
.
1
.
.
1
1
.
.
.
.
1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
=
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.