public boolean checkForObstruction(Location init, Location fin, Tile[][] obstructedBoard, Piece pieceToCheck)
	{
		//I'm thinking that I should take the locations, subtract the columns and rows from final and initial positions, then iterate over the differences
		//Once I'm iterating over the differences, I check if there's a piece in a specific space
		//If there's a piece, return true, but if it's empty, return false
		
		Location greaterLoc, lesserLoc;
		
		if((init.getColumn() + init.getRow()) > (fin.getColumn() + fin.getRow()))
		{
			greaterLoc = init;
			lesserLoc = fin;
		}
		else
		{
			greaterLoc = fin;
			lesserLoc = init;
		}
		
		int colDif = Math.abs(greaterLoc.getColumn() - lesserLoc.getColumn());
		int rowDif = Math.abs(greaterLoc.getRow() - lesserLoc.getRow());
		boolean isObstructed = false;
		
		if(colDif > 0)
		{
			for(int i = 1; i < colDif; i++)
			{
				if(obstructedBoard[greaterLoc.getRow()][greaterLoc.getColumn() - i].getPiece() != null
						&& obstructedBoard[greaterLoc.getRow()][greaterLoc.getColumn() - i].getPiece() != pieceToCheck)
				{
					isObstructed = true;
				}
			}
		}
		
		if(rowDif > 0)
		{
			for(int i = 1; i < rowDif; i++)
			{
				if((obstructedBoard[greaterLoc.getRow() - i][greaterLoc.getColumn()].getPiece() != null)
						&& (obstructedBoard[greaterLoc.getRow() - i][greaterLoc.getColumn()].getPiece() != pieceToCheck))
				{
					isObstructed = true;
				}
			}
		}
		
		return isObstructed;
	}