Tag: total
Stone of ill Luck Total Bonus
The stone of ill luck cursed magic item from Tales from the Yawning Portal appears as a stone of good luck and says:
it confer’s that item’s property while on your person.
The bonus from the stone of good luck is +1 to saving throws and ability checks. Then under the curse section it says:
while it is on your person, you take a 2 penalty to ability checks and saving throws.
Until the curse is discovered, this is done by the DM in secret.
I see two options for how these bonuses could be added.
1) The stone of ill Luck adds a +1 to applicable rolls, and subtracts 2 as well, for a total change of 1 to applicable rolls. The DM would need to subtract 2 from applicable rolls in secret since the player would be assumed to add the original +1 themselves.
2) The stone of ill luck only appears to be a stone of good luck, and does not actually add the original +1, only subtracting 2 from applicable rolls for a total change of 2 to applicable rolls. The DM would then need to subtract 3 in secret, 2 for the curse and 1 for the incorrectly added bonus.
Option 1 is definitely easier to run and is nicer to the players, but I can also see an argument that the stone appears to add the +1 while not actually adding anything.
For anydice.com, is there a way to set a total number for three rolls?
I am very, very new to writing code and working on designing a RPG. As part of that, I am trying to do a simulation of three weighted dice rolls, ranging from 112 where I set the limit of how much the total of all three rolls can be. Meaning, I want to limit the total that any set of three rolls can give me to 12.
I am interested in the actual results of the dice and not just their sum so 3/3/3 is different from 4/4/1.
If the sum of the dice would be above 12 then the die making it go above 12 would be rerolled until this is not the case.
As an example:
 If you rolled 5/5 on the first two dice, the third die would be rolled until it was either a 1 or 2.
 If you rolled 1/1 on the first two dice, the third die would be rolled until it was a number 110.
I have the dice weighted according to the percentages I need. I just have no idea how to do the language to limit the total.
Here’s what I have thus far:
W: { 1:12, 2:14, 3:18, 4:18, 5:17, 6:8, 7:8, 8:1, 9:1, 10:1, 11:1, 12:1 } output dW
Any help would be GREATLY appreciated!
Algorithm design: find any path in an undirected acyclic graph which has a total sum of the nodes as a specific value
The question was asked in an interview, and I’m not sure if this is the most optimized answer, but here goes
You have an undirected acyclic graph, where each node has a nonnegative value x
and the edges have 0 value. You need to find a path with any number of nodes on it such that the total sum of all node values is exactly k
. There are N
nodes in the graph. You can start at any node.
I gave the bruteforce solution for this problem, which is basically do a dis on each node until you find a valid “root” node, such that it has a path to one of the other nodes, with a total sum being k
. The time complexity of this solution would be n^2
, since we are doing DFS on each node.
The question was posed as a delivery problem, where you have N
connected houses, each having a package of weight k
, and the truck can start at any house and should follow a path, and has to pick the package from every house that is on that path. The weights should sum exactly to k
.
Why there are slight difference of total users in GA?
I found out that there is a slight difference in number in total user as below, but why is it so?
From the pie chart given, by calculating the total, the number of users should be 1101 instead of 1105, hope anyone can help me to clarify this.
Optimally find one of the total orderings for a poset based on some metadata about the elements
Given a finite, partially ordered set with the following two properties:
 Every element in the set has one of two types: “A” or “B”. The type does not define the total ordering of the set and is metadata.
 Every element in the set is a natural number and the poset can be ranked by the numbers themselves. This means that the sorted elements themselves provide one of the possible total orders of the poset, or in graph theory, one of the topological orderings of the DAG.
What is the most optimal algorithm to find the total ordering of the described poset that groups elements with the same type together?
The posets are represented by describing the type and dependencies of every element such that:
0:{[], A}, 1:{[0], A}, 2:{[], B}, 3:{[2], A} 4:{[0], A}, 5:{[0,1,4], B}, 6:{[1,2], A}
looks like this:
Where the blue dot represents the “B” type and every other element is of type “A”. The following are some of the valid total orderings:
[0, 1, 2, 3, 4, 5, 6, 7]
[0, 2, 1, 4, 3, 6, 5, 7]
[0, 2, 1, 4, 3, 6, 7, 5]
However, I have been trying to find the most optimal algorithm that will group elements based on their type, if it is possible, while preserving the total order. For the DAG/poset in the example, one of the possible solutions would be:
[[0, 1, 4], [5, 2], [6, 3, 7]]
Thank you!
Woocommerce shipping options not changing checkout total
I am working with woocommerce at the moment, I have created a child theme off of storefront, and I notice that when I change the shipping option to once that has a price the total order price does not change, and Javascript error is thrown. I have not changed any of the parent theme for this process so I am not sure why it would be throwing an error?
The error is as follows,
If I just use storefront it works fine, so there must be a conflict in my child theme but I am not sure where to start?
If I am hiding and moving silently at the same time, what is my total movement penalty?
In D&D 3.5, according to page 79 of the PHB under the move silently skill:
You can move up to onehalf your normal speed at no penalty. When moving at a speed greater than onehalf but less than your full speed, you take a –5 penalty.
And, according to page 76 of the PHB under the hide skill:
You can move up to onehalf your normal speed and hide at no penalty. When moving at a speed greater than one half but less than your normal speed, you take a –5 penalty.
Assuming:

I have no special abilities that have any relevance to this circumstance

I am able to move silently and hide in the same round

I wanted to do this without incurring a penalty on my skill checks

My normal movement speed is 30ft
Would my speed, which I have opted to reduce, be to 15ft or would it be 7.5ft?
[ Politics ] Open Question : Virus job losses could total 47 mil, unemployment rate may hit 32%. What will those people do after losing their employer health insurance?
“Economists at the Fed’s St. Louis district project total employment reductions of 47 million, which would translate to a 32.1% unemployment rate, according to a recent analysis of how bad things could get.” https://www.cnbc.com/2020/03/30/coronavirusjoblossescouldtotal47millionunemploymentrateof32percentfedsays.html “A record 3.3 million Americans filed initial jobless claims for the week ended March 21. Economists surveyed by Dow Jones expect another 2.65 million to join them this week.”
How does class level rebuilding work if you want to change the order of classes (but not the classes or total number of levels)?
Say a character took 5 levels in duskblade, then 5 levels in abjurant champion, then 5 in cleric, then 5 in wizard (it’s not a particularly optimized character). They later decide they want to use abjurant champion’s capstone feature on their wizard class, instead of duskblade. However, the prestige class says:
At each level, you gain new spells per day and an increase in caster level (and spells known, if applicable) as if you had also gained a level in an arcane spellcasting class to which you belonged before adding the prestige class level.
(emphasis mine)
This means that in order to “register” their wizard spellcasting with abjurant champion at all, they need to “move” at least one of their wizard levels “in front of” at least one of the abjurant champion levels (ideally all of them, for caster progression). In effect, they want to go from:
duskblade 5/abjurant champion 5/cleric 5/wizard 5
to:
duskblade 5/wizard 1/abjurant champion 5/cleric 5/wizard 4
Now, the PHB II section on class level rebuilding (pp.197198) says:
Each time your character completes a rebuild quest, you can change a number of levels equal to 1/5 his character level (rounded up) from one class to any other class (or classes).
So, in the example above, how many levels are they “changing”? Are they only changing one level, as the others get “pushed out of the way”, and therefore they only need to do one rebuild quest?
Or are they changing every level from character level 6th up to character level 16th, and thus need to complete several rebuild quests, changing a handful of levels each time in order to slowly move their wizard level further up the chain?
Or are they not changing any class levels, because in the end every class level they have after rebuilding, they also had before, meaning there’s no actual change taking place? And so, all they need to do is reorganize the way they list things on their character sheet and retrain the abjurant champion class features?