Datasets:
thechaingamer
/
ada-git-code

Dataset card Data Studio Files
xet
 Community
text
stringlengths
0
234
end loop;
end Init_White_Pawn_Attacks;
procedure Init_Black_Pawn_Attacks is
Pawn_Inc : array (0..1,0..1) of Integer := ((-1,1),(-1,-1));
begin
for I in 0..63 loop
Black_Pawn_Attacks_I(I):=0;
end loop;
for I in 0..7 loop
for J in 0..7 loop
for K in 0..1 loop
if Is_In_Bounds(I+Pawn_Inc(K,0),J+Pawn_Inc(K,1)) then
Black_Pawn_Attacks_B(I*8+J)((I+Pawn_Inc(K,0))*8+J+Pawn_Inc(K,1)) := 1; end if;
end loop;
end loop;
end loop;
end Init_Black_Pawn_Attacks;
procedure Init_White_Pawn_Moves1 is
begin
for I in 0..63 loop
White_Pawn_Moves1_I(I):=0;
end loop;
for I in 1..7 loop
for J in 0..7 loop
if Is_In_Bounds(I+1,J) then
White_Pawn_Moves1_B(I*8+J)((I+1)*8+J) := 1; end if;
end loop;
end loop;
end Init_White_Pawn_Moves1;
procedure Init_Black_Pawn_Moves1 is
begin
for I in 0..63 loop
Black_Pawn_Moves1_I(I):=0;
end loop;
for I in 0..6 loop
for J in 0..7 loop
if Is_In_Bounds(I-1,J) then
Black_Pawn_Moves1_B(I*8+J)((I-1)*8+J) := 1; end if;
end loop;
end loop;
end Init_Black_Pawn_Moves1;
procedure Init_White_Pawn_Moves2 is
begin
for I in 0..63 loop
White_Pawn_Moves2_I(I):=0;
end loop;
for J in 0..7 loop
White_Pawn_Moves2_B(8+J)(24+J) := 1;
end loop;
end Init_White_Pawn_Moves2;
procedure Init_Black_Pawn_Moves2 is
begin
for I in 0..63 loop
Black_Pawn_Moves2_I(I):=0;
end loop;
for J in 0..7 loop
Black_Pawn_Moves2_B(48+J)(32+J) := 1;
end loop;
end Init_Black_Pawn_Moves2;
-- All_Pieces_90_B(8*I+J) := All_Pieces_B(8*(7-J)+I);
function Find_Rank(B:Natural) return Natural is
begin
return Natural(Shift_Right(All_Pieces_I and (Shift_Left(255,8*(B/8))),8*(B/8)));
end Find_Rank;
function Find_Rank_90(B:Natural) return Natural is
begin
return Natural(Shift_Right(All_Pieces_90_I and (Shift_Left(255,8*(B mod 8))),8*(B mod 8)));
end Find_Rank_90;
function Find_Rank_45r (B:Natural) return Natural is
begin
return Natural(Shift_Right((All_Pieces_45r_I and Mask_45r_rev(B)),Start_45r_Rev(B)));
end Find_Rank_45r;
function Find_Rank_45l (B:Natural) return Natural is
begin
return Natural(Shift_Right((All_Pieces_45l_I and Mask_45l_rev(B)),Start_45l_Rev(B)));
end Find_Rank_45l;
procedure Init_Rank_Attacks is
Base,Ind : Integer;
R : Unsigned_8;
Final_I : Intboard;
Final_B : Bitboard;
pragma Import(Ada,Final_B);
for Final_B'Address use Final_I'Address;
L,D : Integer;
begin
for I in 0..63 loop
Base := I/8;Ind := I mod 8;
for J in Unsigned_8 (0) .. Unsigned_8(255) loop