long east = (square << 1) & ~fileMasks[0]; // ~fileMasks[0] ensures that overflow is adjusted for
		long west = (square >> 1) & ~fileMasks[7];
		long attack = (east | west);
		attack |= (attack << 8 | attack >> 8); // finding the top and bottom adjacent squares
		
		return (attack | (square >> 8)| (square << 8)); // finding the diagonals

        long east = 0;
        long west = 0;
        long attacks = 0;

		east = (pos << 1) & ~fileMasks[0];
		west = (pos >> 1) & ~fileMasks[7];
		attacks = (east | west) << 16 & (~rankMasks[0] & ~rankMasks[1]); //down 2 left/right 1
		attacks |= (east | west) >> 16 & (~rankMasks[7] & ~rankMasks[6]); //up 2 left/right 1
		east = (east << 1) & ~fileMasks[0];
		west = (west >> 1) & ~fileMasks[7];
		attacks |= (east | west) << 8 & (~rankMasks[0]); // left/right 2 up 1
		attacks |= (east | west) >> 8 & (~rankMasks[7]); // left/right 2 down 1

        // rank and file masks account for moves out of bounds

		return attacks;

        int row = square / 8;
		int col = square % 8;
		int diagIndex = (row-col) & 15; // index of the diagonal the bishop is on -> '/'
		int antiDiagIndex = (row+col) ^ 7; // index of the anti-diagonal -> '\'
		
		return sliding_moves(square,occupied,diagMasks[diagIndex]) | sliding_moves(square,occupied,antiDiagMasks[antiDiagIndex]);

        return sliding_moves(square,occupied,rankMasks[square/8]) | sliding_moves(square,occupied,fileMasks[square%8]); 

       	long pawn_move = 1L << square;
		long push = (color == 0) ? pawn_move << 8 : pawn_move >> 8;
		return push & ~GameState.occupied; 

        long attackedSquares = MoveLogic.rook_moves(squareIndex,GameState.occupied);
	    attackedSquares |= MoveLogic.bishop_moves(squareIndex,GameState.occupied);

 		// getting positions of all the pieces

		long pawnPos = GameState.piecePosition[color][Type.PAWN];
		long knightPos = GameState.piecePosition[color][Type.KNIGHT];
		long rookPos = bishopPos = GameState.piecePosition[color][Type.QUEEN];
		long bishopPos |= GameState.piecePosition[color][Type.BISHOP];
		rookPos |= GameState.piecePosition[color][Type.ROOK];

		return (pawnAttacks[color ^ 1][kingIndex] & pawnPos) | (knightAttacks[kingIndex] & knightPos)
				| (bishop_moves(kingIndex, GameState.occupied) & bishopPos)
				| (rook_moves(kingIndex, GameState.occupied) & rookPos);