unity – Tile draws pixels from adjacent tiles

Whenever I try to draw from the tile palette, this is the result. why does this happen? I have tried messing around with the palette, how the sprite editor has sliced the tiles and played around with the anchors and cell sizes, but to no avail. I found a few threads about offset tiles in the tile map, but it doesn’t help at all. Any leads as to why this happens?

enter image description here

Filtering entries in Excel with multiple connected data on adjacent column

I’m sorry if my title is confusing, I’m fairly new to excel.

Below is a sample image, basically what I want to do is be able to filter the Topics. But when I filter to see — Climate Change for example — it does not show that it is a topic for the “Duis vulputate tempus” book. Would like to ask how I can connect the Title to all the Topics related to it. Thank you all in advance.
Here is the screenshot

unity – Changing block shape to blend with adjacent blocks

I am in the process of programming a Minecraft like game in Unity. I am currently implementing the block mechanics.

My goal is that when a block is placed, it has an effect on its neighboring blocks and merges with them.

My previous implementation was: I cut a block into 8 parts. Each of these parts reacts to its neighboring parts and decides what part it is.

Block subdivided into coloured parts
(Please ignore the area above …there is still a bug) The different colors represent a part of the block. I didn’t paint them all, but I think you can understand.

However, following this logic, I have a lot to do for this style in 3D. To catch all cases, I have 8 * 9 (Corner, Corner X, Corner Y, Corner Z, Single Cube, Transition X, Transition Y, Transition Z) 3D models. Now if I want to apply a different style. One, where e.g. the corners are even rounder, I would have to model 8 * 9 blocks again and enter them. Even if it is possible to work with a symmetry I don’t want to do that.

There are already games like Portal Knights that have done it. Notice the bevels in this screenshot, or the trim added only on the outside corners in the next one.

Bevels in Portal Knights

Trim in Portal Knights

Unfortunately I can’t find anything about this on the internet… or I’m searching wrong. Does anyone have a concept or an idea that can save me work here? Whether 3D or 2D, Paper or Git I would be very grateful.

usa – Caribbean Islands or adjacent to the sea? Onward ticket ESTA requirements!

Non-insular countries bordering the Caribbean Sea are not included unless they are “territory or possessions” of the UK, the Netherlands, or France.

First, the statute establishing the visa waiver program, 8 USC 1187 has this to say on the matter:

(8) Round-trip ticket

The alien is in possession of a round-trip transportation ticket (unless this requirement is waived by the Secretary of Homeland Security under regulations or the alien is arriving at the port of entry on an aircraft operated under part 135 of title 14, Code of Federal Regulations, or a noncommercial aircraft that is owned or operated by a domestic corporation conducting operations under part 91 of title 14, Code of Federal Regulations).

At some point, someone realized that this is overly restrictive, so they issued a defining regulation, 8 CFR 217, which says at 217.2

Round trip ticket means any return trip transportation ticket in the name of an arriving Visa Waiver Pilot Program applicant on a participating carrier valid for at least 1 year, electronic ticket record, airline employee passes indicating return passage, individual vouchers for return passage, group vouchers for return passage for charter flights, and military travel orders which include military dependents for return to duty stations outside the United States on U.S. military flights. A period of validity of 1 year need not be reflected on the ticket itself, provided that the carrier agrees that it will honor the return portion of the ticket at any time, as provided in Form I-775, Visa Waiver Pilot Program Agreement.

It also says

(c) Restrictions on manner of arrival –

(1) Applicants arriving by air and sea. Applicants must arrive on a carrier that is signatory to a Visa Waiver Pilot Program Agreement and at the time of arrival must have a round trip ticket that will transport the traveler out of the United States to any other foreign port or place as long as the trip does not terminate in contiguous territory or an adjacent island; except that the round trip ticket may transport the traveler to contiguous territory or an adjacent island, if the traveler is a resident of the country of destination.

I think that someone at United Airlines got confused about “contiguous territory or adjacent island,” which includes Caribbean islands, and somehow morphed it into a designation that includes “territory adjacent to the Caribbean,” which it does not (except for Mexico, of course, which is included not because of the Caribbean but because it is contiguous with the US).

So what are the adjacent islands? They are defined at 8 USC 1101(b)(5):

(5) The term “adjacent islands” includes Saint Pierre, Miquelon, Cuba, the Dominican Republic, Haiti, Bermuda, the Bahamas, Barbados, Jamaica, the Windward and Leeward Islands, Trinidad, Martinique, and other British, French, and Netherlands territory or possessions in or bordering on the Caribbean Sea.

(As far as I am aware, there is no longer any non-insular “territory or possession” of any of those three countries that is adjacent to the Caribbean sea. French Guiana is too far east; it’s on the Atlantic Ocean.)

Since Costa Rica is not a possession of any other country, much less of one of those three European countries, you should be all set. Also, if you’re a resident of Costa Rica, it wouldn’t matter even if it were somehow taken to be included in “contiguous territory or adjacent islands.”

How to find adjacent elements in multidimensional list in Python?

Here I have a multidimensional list in python.
Suppose I take an input, how do I find the number of adjacent elements of that input which are alphabets other than itself? If there arer two elements then we have to print the maximum.
For example, the number of adjacent elements which are equal to ‘R’ is 2.

c=input()
#suppose c='R'
#print the number of equal and adjacent elements, for c='R' it is 2
l=(('G', '.', 'B', 'C'), ('A', '.', 'R', 'Z'), ('.', '.', 'R', 'B'))



#G.BC
#A.RZ
#..RB

This is how I tried it.

from collections import OrderedDict
x,y,z=input().split()
l=()
c=()
x,y=int(x),int(y)

def f(e):
    ls=()
    a=e(0)
    b=e(1)
    for i in range(int(x)):
        for j in range(int(y)):
            t=l(i)(j)
            if i==a and t!=z and t!='.':
                if j==b-1 or j==b+1:
                    ls.append(t)
            if j==b and t!=z and t!='.':
                if i==a-1 or i==a+1:
                    ls.append(t)
    ls=list(OrderedDict.fromkeys(ls))
    
    return ls
                

for i in range (0,int(x)):
    s=""
    s=input()
    sl=list(s)
    for j in range(int(y)):
        if z==sl(j):
            c.append((i,j))
    l.append(sl)
d=0
for i in range(len(c)):
    m=f(c(i))
    d=max(d,len(m))
print(d)

Here function f is used to create a list of elements which satisfy the conditions.

calculus and analysis – How to ask Mathematica to subtract each adjacent pair in a list, and then, sum them?

If I have a list of numbers as (the number of elements in this list is even)

list={1,23,32,54,65,76,87,98,109,110,...}

How can I ask Mathematica to subtract each adjacent pair, and then, sum them, i.e. compute this value

$sum=(…)+(110-109)+(98-87)+(76-65)+(54-32)+(23-1)$

algorithms – Merging all adjacent and overlapping rectangles in a grid to bigger rectangles

I have a 𝑛×𝑚
rectangular grid of cells, and a set 𝑅 of rectangles within this grid. Each rectangle is a subset of the cells. (Alternatively, you can think of them as axis-aligned rectangles where each of the four corners has integer coordinates.) Some of these rectangles overlap and some of these rectangles are adjacent. I want to merge adjacent rectangles to bigger rectangles if possible and remove overlaps.

So my output set should have bigger non overlapping rectangles instead of small adjacent or overlapping rectangles. The number of rectangles in the output set should be minimized. The output set need not be a subset of input set.
Is there any approximate or exact algorithm for this problem.

combinatorics – Number of permutations where absolute difference between adjacent elements is greater than 1, ie, $|a_i – a_{i+1}| > 1$

What are the number of permutations $(a_1, a_2 … a_n)$ of size $n$ where $|a_i – a_{i+1}| > 1$ ?

This question is asked here: number of permutations in which no two consecutive numbers are adjacent

In the answers there is given a link of OEIS which has a formula for it, given here: oeis.

If n = 0 or 1 then a(n) = 1; if n = 2 or 3 then a(n) = 0;

otherwise a(n) = (n+1)*a(n-1) – (n-2)*a(n-2) – (n-5)*a(n-3) +
(n-3)*a(n-4).

I tried for some time but I think its not very easy, is there a simple explanation for above formula, based on basic counting principle, not using generating function

google sheets – Find the previous non-blank value from a column using a value in an adjacent column as search key

Assuming that invoices and models are in A2:B, you can look up the first matching invoice for the model in cell E2 like this:

=arrayformula( 
  iferror( 
    vlookup( 
      E2, 
      { 
        B2:B, 
        iferror( 
          vlookup( 
            row(A2:A), 
            if( len(A2:A), { row(A2:A), A2:A } ), 
            2, 
            true 
          ) 
        ) 
      }, 
      2, 
      false  
    ) 
  ) 
)

To look up the first matching invoice for a whole column of models in E2:E, replace E2 with E2:E in the formula.

google sheets – Conditional Format Blank Cells Based on Number of Adjacent Blank Cells

I am trying to take attendance and highlight who has been absent and to what extent using colors. (see image 1) Here is a link to a test sheet.

Image 1:
image 1; this is the goal

If someone has missed two gatherings in a row, then I’d like for the two adjacent cells to be light red. 3 missed gatherings in a row should be bright red and 4 or more missed gatherings should have a dark red color in those adjacent cells.

The formula I’m currently using is very basic and just highlights any missed gatherings in a row. This is the formula: =AND(ISBLANK(V2), NOT(ISBLANK(V$1)), SUM(COUNTBLANK(V2:W2),COUNTBLANK(U2:V2))>2) (see image 2) The things wrong with this formula are:

  1. The cells AB12:AB16 should not be highlighted. I believe they’re highlighted because the cells next to them (AC12:AC16) are empty. I need a way to check if the header row is empty or not before counting a cell as blank.
  2. I need a way to break up the formula (or a new formula) to add the different colors like in the first image.

Image 2:
image 2; the portion outlined in blue is one of the issues

I have seen articles like these that might suggest using an index, but I haven’t gotten it to work. I’ve also tried using the COUNTIFS function, but I had array errors that I couldn’t figure out how to work around them