Looking for an old adventure module – Heroes explore a tower and find a trapped wizard

I’m looking for an old adventure module and I can’t remember the name.

This is what I remember:

  • For AD&D 1e, and may have been a DM’s Guild publication

  • For low level characters, not more than 5th

  • Wizard is trapped in a magic circle and begs for help

  • One room is a "refrigerator" with a bound ice-elemental to keep it cold

  • One room has a pet basilisk, and anti-stoning spectacles hanging outside the door

  • Magical "elevator" that goes to every floor of the tower, and one floor is "secret"

  • I think the cover art was a B&W drawing of a lone medieval type tower, with lightning bolts flashing around it. The perspective has the viewer looking up at the tower from the ground level.

Is there more information on the spell Galder’s Tower available from previous editions?

I’m playing 5e, and planning my 3rd level spell acquisitions. I came across the spell Galder’s Tower. The spell description says:

You conjure a two-story tower made of stone, wood, or similar suitably sturdy materials.

It then goes on to describe a few more of the tower’s details such as how rooms are furnished and what happens when you upcast the spell. I’m wondering if this is a ‘new to 5e’ spell, and if it isn’t

Is there more information on the spell Galder’s Tower available from previous editions?

How can I effectively shield block with a tower shield?

I am a champion with a shield ally and a tower shield. Shield ally adds +2 to my shield’s hardness and 50% HP and BT. So a normal tower shield in my hands has a hardness of 7 and 30 HP.

I want to be able to do two things: use shield block to reduce damage for myself and allies, and use raise shield/take cover to provide AC and cover bonuses.

How can I keep shield block effective past my initial levels? There are some magic shields that increase HP and hardness, but I haven’t seen one that is a tower shield. Are there any shields, class features, feats, or strategies that I can use to keep shield block with a tower shield effective?

How does an IMSI catcher “impersonate” a base station/cell tower?

On reading about IMSI catchers, I keep seeing that they “impersonate” a real cell tower or “base station” so that the phone drops its signal-carried data on that machine while on its way to the intended destination.

What I don’t understand is, how exactly does the IMSI catcher do that, or by what mechanism? What is it doing to trick the phone/SIM/connection into saying “This is a valid stop to drop off data”?

Do tower shields provide cover from all directions?

A Tower Shield allows you to use the Take Cover action, in order to gain Greater Cover from the shield. This is confusing because the cover rules require that a source of cover must be between you and the threat, while shields have no rule that specifies which direction they’re facing.

Usually, the GM can quickly decide whether your target has cover. If you’re uncertain or need to be more precise, draw a line from the center of your space to the center of the target’s space. If that line passes through any terrain or object that would block the effect, the target has standard cover (or greater cover if the obstruction is extreme or the target has Taken Cover). If the line passes through a creature instead, the target has lesser cover. When measuring cover against an area effect, draw the line from the effect’s point of origin to the center of the creature’s space.

Because there’s no rule that tracks the direction of shields, does that imply that a tower shield wielder gains omnidirectional cover from Taking Cover behind their shield?

Can allies take cover behind my tower shield?

I am a champion who is wielding a tower shield. I raise my shield, and then Take Cover. On their turns, can my allies attempt to take cover behind my tower shield also?

The Take Cover action requires:

You are benefiting from cover, are near a feature that allows you to take cover, or are prone.

It isn’t clear to me if an ally standing behind my tower shield is benefiting from cover, or if my shield is a “feature that allows you to take cover”.

Keep moving cell phone connected to any tower within specified distance

Solve using ford fulkersen algorithm. Please see the comment section for the source of the problem and for the google doc link to my failed attempt .

“You can tell that cellular phones are at work in rural communities, from the giant microwave towers you sometimes see sprouting out of corn fields and cow pastures. Let’s consider a very simplified model of a cellular phone network in a sparsely populated area. We are given the locations of n base stations, specified as points b1 ,…, b n in the plane. We are also given the locations of n cellular phones, specified as points p1 ,…, pn in the plane. Finally, we are given a range parameter d> 0. We call the set of cell phones fully connected if it is possible to assign each phone to a base station in such a way that

1)Each phone is assigned to a different base station, and

2) If a phone at pi is assigned to a base station at bj , then the straight-line distance between the points pi and bj is at most distance d

Suppose that the owner of the cell phone at point p1 decides to go for a drive, traveling continuously for a total of z units of distance due east. As this cell phone moves, we may have to update the assignment of phones to base stations (possibly several times) in order to keep the set of phones fully connected.

Give a polynomial-time algorithm to decide whether it is possible to keep the set of phones fully connected at all times during the travel of this one cell phone. (You should assume that all other phones remain stationary during this travel.) If it is possible, you should report a sequence of assignments of phones to base stations that will be sufficient in order to maintain full connectivity; if it is not possible, you should report a point on the traveling phone’s path at which full connectivity cannot be maintained. You should try to make your algorithm run in O(n^3 ) time if possible.

Example. Suppose we have phones at p1 = (0, 0) and p2 = (2, 1); we have base stations at b1 = (1, 1) and b2 = (3, 1); and d=2. Now consider the case in which the phone at p1 moves due east a distance of 4 units, ending at (4, 0). Then it is possible to keep the phones fully connected during this motion: We begin by assigning p1 to b1 and p2 to b2 , and we reassign p1 to b2 and p2 to b1 during the motion (for example, when p1 passes the point (2, 0)). “

galata tower light shows

I’ve seen a few videos of light shows being projected onto the Galata Tower in Istanbul, Turkey. eg.


I’ll be in Istanbul on Nov 25 and Nov 26 of this year. Are these light shows something they do nightly? If so at what times?

My Google searches have been inconclusive. http://www.galatatower.net/ doesn’t seem to have any info.

Tower of Hanoi – helper function

Here is a fairly straightforward solution Python to the Tower of Hanoi problem

def move_rings(number_rings, move_from, move_to, spare_tower):     """Print all steps move_to move N rings move_fromom move_tower A move_to move_tower C"""     dict_rings = {0: "A", 1: "B", 2: "C"}      if number_rings == 1:         print("Move from", dict_rings[move_from], "to", dict_rings[move_to])     else:         move_rings(number_rings-1, move_from, spare_tower, move_to)         move_rings(1, move_from, move_to, spare_tower)         move_rings(number_rings-1, spare_tower, move_to, move_from)  if __name__ == "__main__":     number_rings = 3     move_rings(number_rings, 0, 2, 1)  

I tried using a helper function (below) but this broke my code. Please can someone help me understand why?

def helper(number_rings, move_from, move_to, spare_tower):     """Helper function works out which ring to move"""     if number_rings == 1:         return move_from, move_to     helper(number_rings - 1, move_from, spare_tower, move_to)     helper(1, move_from, move_to, spare_tower)     helper(number_rings - 1, spare_tower, move_to, move_from)   def move_rings(number_rings):     """Function prints the ring move required"""     counter = 0     dict_rings = {0: "A", 1: "B", 2: "C"}     move_from, move_to = helper(number_rings, 0, 2, 1)     counter += 1     print("Move disc from", dict_rings[move_from], "to", dict_rings[move_to])     return counter   if __name__ == "__main__":     counter = move_rings(3)     print(f"Solution possible in {counter} moves")