Which, if any, parts of the Locate City Bomb are dubious by RAW?

The “locate city bomb” is a somewhat-notorious example of theoretical optimization, turning a minor 1st-level divination into something quite similar to a nuclear blast that kills everything for miles around.

The typical process:

Typical process:

  1. Cast locate city from Races of Destiny.

  2. Use the Snowcasting feat from Frostburn to add the Cold descriptor to locate city.

  3. Use the Flash Frost feat from Player’s Handbook II, which can only be applied to cold spells, to add 2 cold damage to all creatures within the area of the Snowcasted locate city.

  4. Use the Energy Substitution feat from Complete Arcane, which can only be applied to a spell that have the acid, cold, electricity, or fire descriptor, to turn the cold damage to electricity damage, and change the descriptor to the corresponding one.

  5. Use the Born of the Three Thunders feat from Complete Arcane, which can only be applied to an area spell with the electricity or sonic descriptor that deals hit point damage. Among other things, this forces creatures within locate city’s area to make a Reflex save.

  6. Use the Explosive Spell feat from Complete Arcane, which can only be applied to a cone-, cylinder-, line-, or burst-area spell that allows a Reflex save, to force those within who fail the Reflex save to the edge of the effect, taking 1d6 damage for every 10 feet moved.

Which, if any, of these steps are dubious per the rules as written?

What other spells can power the Locate City Bomb?

The locate city bomb is a series of metamagic feats you can apply to a the locate city spell to do high damage over a very wide area.

Typical process:

  1. Cast locate city from Races of Destiny.

  2. Use the Snowcasting feat from Frostburn to add the Cold descriptor to locate city.

  3. Use the Flash Frost feat from Player’s Handbook II, which can only be applied to cold spells, to add 2 cold damage to all creatures within the area of the Snowcasted locate city.

  4. Use the Energy Substitution feat from Deities & Demigods, which can only be applied to a spell that deals acid, cold, electricity, fire, or sonic damage, to turn the cold damage to electricity (or sonic) damage.

  5. Use the Born of the Three Thunders feat from Complete Arcane, which can only be applied to an electricity or sonic spell. Among other things, this forces creatures within locate city’s area to make a Reflex save.

  6. Use the Explosive Spell feat from Complete Arcane, which can only be applied to a cone-, cylinder-, line-, or burst-area spell that allows a Reflex save, to force those within who fail the Reflex save to the edge of the effect, taking 1d6 damage for every 10 feet moved.

If the locate city spell were banned, what other spells could use this combination of feats to produce a similar effect?

The locate city spell has a radius of 10 miles/level; I’d consider a spell to have a similar effect if its area of effect was also very large (and if the rest of the locate city feat stack worked with it).

(Context: https://rpg.stackexchange.com/a/159280/21179)

Im not able to enter the city in when i run this code?How can i fix it

import java.util.Scanner;

public class myclass {

public static void main(String[] args){     int faherenheit=0, celsius=0;     String city;      Scanner keyboard = new Scanner(System.in);      System.out.print("Enter temperature in Faherenheit: ");     faherenheit = keyboard.nextInt();      celsius = ((faherenheit-32)*5)/9;       System.out.print("Enter your city: ");     city = keyboard.nextLine();  System.out.println();       // introduce a blank line     System.out.println(celsius + " degree C in " + city);  } 

}

Find the minimal tank capacity to be able to travel from any city to any other

There are $ n$ cities in the country. The car can go from any city $ u$ to city $ v$ , On this road it spends $ w_{u,v} > 0$ fuel. At the same $ w_{u,v}$ can differ from $ w_{v, u}$ . The task is to find the minimal tank capacity to be able to travel from any city to any other (possibly with refuels) in $ O(n^2\log n)$ .

Tuple Relational Calculus – Find names of persons who own at least one house in each city in Canada

Using tuple relational calculus, Find names of persons who own at least one house in each city in Canada.

Bolded are keys.

City(city-name,country-name,area,population)

House(hno,#rooms,stno,owner-name)

Street(stno,city-name,length)

This is what I came up with:

{ h.owner-name | House(h) and forAll c (City(c) and c.name=”Canada”) -> (Exists s(Street(s) and s.city-name = c.name) and Exists x(House(x) and x.stno = s.stno and x.owner-name = h.owner-name) ) }

How I read this aloud: “For all Canadian cities, there exists a street with a HOUSE x that has the same owner as the HOUSE h.”

Is this correct? I’ve peen pulling my hair out trying to understand tuple relational calculus.

What happens if a dragon in Waterdeep has permission to enter the city revoked?

The Waterdeep: Dragon Heist adventure (in a sidebar on p. 6) gives details of

In it it states:

Of specific interest are the way(s) a dragon can get permission:

This makes it pretty clear that a dragon who has been so permitted may move through the city freely. It leaves silent what happens to a dragon who has this permission rescinded while they are still in the city.

Is there any lore from previous editions or elsewhere that describes what happens in such an event?

Algorithm for matching couriers to orders in a city

I have a problem that bothers me for a long time and could not find the best approach to it yet.

I hope this is the best place to put this kind of question. If not please direct me to a better place :D.

Problem:

You are given a city with M shops and N couriers and Q orders to deliver.

M in [0, 10^3], N in [0, 10^3] and Q in [0, 10^4].

Every order has the following details

(time_to_pick_up Ti, delivery_location (xi, yi), shops_location (x, y)).

Every courier has the start_location (cx, cy)

Query:

1) Find the matching (couriers-order) that minimises the total usage or couriers.

2) Find the matching (couriers-order) that minimises the total waiting time for all orders (waiting time = (time_when_delivered – time_to_pick_up))

NOTE:

  • an order cannot be picked before time_to_pick_up
  • a courier cannot collect more than 1 order (he must deliver the order before starting a new order)
  • all couriers have same speed

I think this a problem that the Taxi companies (Uber like) solved already for their clients. I tried different greedy approaches in optimising the picking of a couriers but I think this is pretty far from the best solution. I tried to match the problem to a bipartite graph matching problem with no luck.

Thanks in advance for any help.

For what applications of the traveling salesman problem, does visiting each city at most once truely matter?

Traditionally, the traveling salesman problem has you visit a city at least once and at most once.

However, if you were an actual traveling salesman, you would want the least cost route to visit each city at least once, and you wouldn’t be bothered visiting a city 2, 3, or more times. For given city, you might stop and hawk your wares only once, and on subsequent visits, only drive through the city without stopping.

Consider an undirected graph having a city incident to exactly two edges. The cost on one of these edges is only 10 units, while the cost on the other is 99,999,999,999. If you insist on visiting each city at most once, then you are forced to incur the cost of the high cost edge. However, if you allow yourself to visit cities multiple times, then you simply leave the way you came in (on the low cost edge). The low cost edge leads you back to a city you’ve passed through before.

The traveling salesman problem is highly contrived for an actual traveling salesman. I want to give students an application for which there’s a real incentive to visit each city at most once. For what applications is visiting each city a critical aspect of the problem?