Damaging inanimate objects in battles to indirectly gain advantage in battles

  1. I was thinking of using Spell damage to knockdown a dead Tree trunk in order for it to land on two/three skeletons and therefore pinning them effectively in place.

  2. Assuming having 1 Torch lit only with an all-human party (and I am Chaotic Evil), I was thinking of aiming my spell on the Torch effectively putting it out and make my quick getaway.

Are these possible scenarios?

This is for the Table Top game Dungeons and Dragons (DnD-e5). (sorry about that)

Can your familiar use the frozen spell bead from Arcane Abeyance to indirectly let you concentrate on a 2nd spell?

Arcane Abeyance (p184 EGtW)Says:

…A creature holding the bead can use its action to release the spell within, whereupon the bead disappears. The spell uses your spell attack bonus and save DC, and the spell treats the creature who released it as the caster for all other purposes.

Find Familiar (p240 PHB) Says:

…In combat, it rolls its own initiative and acts on its own turn. A familiar can’t attack, but it can take other actions as normal.

Can a familiar accept the frozen spell bead and then use it to cast a spell, if so does the familiar concentrate on the spell instead of the original caster?

Can the tongues spell decipher writing (directly or indirectly)?

The description for tongues states,

This spell grants the creature touched the ability to speak and understand the language of any intelligent creature

It makes no special mention of understanding written languages–just that you can “understand the language”. If it doesn’t include this ability, though, could, for example, a Dwarf using the spell read aloud a message written by Orcs (since apparently Dwarvish and Orcish use the same writing system, but if that’s not how the actual languages in the settings work then replace the example with languages that do work that way), and then listen to and understand their own Orcish?

Is it safe to handle a denarian coin indirectly?

I’m currently a new player in a campaign which does have a Denarian in it and has OOC had jokes made about my PC being tricked into touching one of their coins, which has made me curious and want to ask:

Is there anything in the setting on if it’s safe to touch a denarian coin indirectly?

Such as if the character is wearing gloves, or were to try pick it up with something like tweezers/tongs- would that result in any infestation and count as “touched/picked up” or be perfectly okay for someone to do since it’s not direct skin to metal?

Merge sort to sort apple sizes indirectly

I am a beginner in Python and wrote this program to solve the following question. where are the areas that I can improve the code? I want to write in Pythonic Way. Any advice on how to improve my code? I am from a C background so python is a bit different in terms of syntax.

Q- I have an array A with the sizes of apples and have to create another array S which would contain the indices of the apples in sorted order given that we cannot directly access or touch A only a function is_large(A,i,j) function can access it. It returns -1 is A[i] > A[j] and 1 if A[i] < A[j].

def is_large_apples(apple_size, i, j):     """ Takes two indices and tells     which one of them is larger or smaller """      if apple_size[i] > apple_size[j]:         return 1     elif apple_size[i] < apple_size[j]:         return -1  def mergesort_apples(s, l, r):     """ This function takes indexed list and      makes recursive calls to sort the array """     if l < r:         mid = (l+r)//2         mergesort_apples(s, l, mid)         mergesort_apples(s, mid+1, r)         merge_apples(s, l, mid, r)   def merge_apples(s, l, mid, r):     """ This function takes the list and     the indices to merge them into the final array"""     nl = mid - l + 1     nr = r - mid     left, right = [], []     left = s[l:mid+1:1]     right = s[mid+1:r+1:1]     i, j, k = 0, 0, l;     while i < nl and j < nr:         print(s)         if is_large_apples(apple_size, left[i], right[j]) == -1:             s[k] = left[i]             i += 1         else:             s[k] = right[j]             j += 1         k += 1      while i < nl:         s[k] = left[i]         k += 1         i += 1     while j < nr:         s[k] = right[j]         k += 1         j += 1  apple_size = [5, 7, 1,44,2,33] # Given list of sizes. s = [x for x in range(0,len(apple_size))] # Original list of indices. mergesort_apples(s, 0, len(s)-1) print(s)