I have the following tables Genres, Films, Directors. They have the following schema:
CREATE TABLE GENRES( GID INTEGER PRIMARY KEY, GENRE VARCHAR(20) UNIQUE NOT NULL ); CREATE TABLE Films( FID INTEGER PRIMARY KEY, Title VARCHAR(45) UNIQUE NOT NULL, DID INTEGER NOT NULL, GID INTEGER NOT NULL, FOREIGN KEY (DID) REFERENCES Directors(DID), FOREIGN KEY (GID) REFERENCES Genres(DID) ); CREATE TABLE Directors( DID INTEGER PRIMARY KEY, First_Name VARCHAR(20) NOT NULL, Last_Name VARCHAR(20) NOT NULL );
I want to write a query that will allow me to select all of Director information for every director that has made atleast one movie in the same genre(s) as another director. For example if Stanley Kubrick has made films in genres ‘Sci-Fi’, ‘Thriller’, and ‘Crime’, I want to select all the directors who have made at least 1 sci-fi AND 1 thriller AND 1 crime film.
I’ve tried the query seen below but this will give me directors who have made atleast 1 sci-fi OR 1 thriller OR 1 crime film.
SELECT DISTINCT D.DID, D.First_Name, D.Last_Name FROM Directors D LEFT JOIN Films F ON F.DID = D.DID LEFT JOIN Genres G ON G.GID = B.GID WHERE G.Genre IN ( SELECT DISTINCT G1.Genre FROM Generes G1 LEFT JOIN Films F1 ON F1.GID = G1.GID LEFT JOIN Directors D1 ON D1.DID = D1.DID WHERE D1.First_Name = 'Stanley' AND D1.Last_Name = 'Kubrick' ); Additionally, I am not able to check before hand which Genres the director in question has been involved with. The query should work with the only given information being the Directors First and Last name.
The guidelines for making your own monsters are based around the Monster Statistics by Challenge Rating table on p274. Inspired by this question regarding Animated Armor (MM 19), which is CR1, let’s see where the Armor would be if we made it from scratch…
Defensive CR: The Armor has 33 HP, but step 9 (Damage Vulnerabilities, Resistances and Immunities, DMG 277) has us adjust effective HP based on resistance.
So we start with 33 HP, giving us CR 1/8, which tells us that we’re using the first line of Effective Hit Points Based on Resistances and Immunities, for an x2 multiplier for each Resistance or Immunity.
The Armor has two Immunities, so has 33x2x2 or 132 “effective” hit points. That puts us at CR 5. We then look at its AC of 18, which is 3 higher than the normal 15 for CR 5. That adjusts us up by one, to CR 6.
Offensive CR: It does 10 (2×5) points of damage, for a CR of 1. Its Attack Bonus is +4, which is 1 higher than the normal +3, but doesn’t adjust CR up.
Final CR is the average of the two, or (6+1)/2. That gives us 3.5, which we round against the players, for a final final CR 3.
How is Animated Armor a CR1 challenge? Its only notable disadvantage (from a combat perspective) is its Antimagic Susceptibility, but that has no effect on CR, per DMG 280. What’s knocking it down from CR 3 to CR 1? Or am I horribly misunderstanding how the creation rules work?
I am working on an estimation problem where I have the following
A = 1 + Pi*Csc[(1 + Pi)*\[Lambda]]^2* (Pi + Sin[2*(1 + Pi)*\[Lambda]])
Can anyone help me how can we extract $ \lambda$ from this equation in Mathematica?
Twin Throw: As part of full attack action throw ranged weapons using one attack roll
Ranged Feint: Feint using a ranged weapon
Two Weapon Feint: Sacrifice an attack to use Feint
Throw and Charge: As a full round action, you can throw a light or one-handed ranged weapon, draw another weapon, and then charge. Both attacks are made at your highest BAB with a +2 bonus to your charge attack.
Set up: Initiate Twin Throw (assumed throwing with primary and offhand) use one of the two attacks to do a Ranged Feint. If successful, the second attack can do sneak attack damage followed by what ever method you choose to deliver a the charge attack. (Roundhouse kick, uppercut, shoulder charge, clothes line, Guile’s Flash Kick) With Twin Throw you have 2 chances to do a Ranged Feint and still catch a target flat footed with the charge.
A former DM has had the same recurring NPC/GMPC since I started playing in his game. This was 20+ years ago and we started in 1st edition and slowly made our way through the years and editions. We updated our characters as we went to the new editions. Now this NPC/GMPC is the most reviled in his games, any time he shows up all the players immediately want him dead. We stick to character though.
The question will be broken up to hopefully get expert answers from each of the editions in which we played in this particular question it will be specific to 3.Xe. I am skipping 4e (as we all hated it and only played one session) and 5e because I know for a fact that it is not possible there (yet).
The question is as follows:
Give the following constraints what is the maximum number of attacks in this edition:
- NPC is an Elf (In this edition it is irrelavent I suppose).
- He was a Thief-Acrobat in previous editions and I assume multiclassed, probably Fighter-Thief, due to how 3.X prestige works let’s assume just Rogue for this edition, although any official prestige class is fair game. Character focused on tumbling and thrown knife attacks.
- The weapon of choice was throwing knives.
- Assume unlimited ammunition as he had a bandalier that had the knives return.
- I know he could throw 3 knives at a time (pretty sure this was a thing for shuriken from Oriental Adventures).
- Assume all official sources and Dragon Magazine since the first issue are open.
- I know of this question and assume there is a variant with knives.
- If I recall he threw with both hands as well.
- Assume prestige classes are open, this DM even as a player had a tendency to stack multiclass options with min/max precision but assume Rogue is the primary focus.
- Assume Quick Draw.
- We were always between 8th and 15th level when I met this character.
- I do not recall spell-casting but not ruling it out entirely but main build would likely have been focused on mundane means.
- Assume focused magical item augmentation as well, just calling it out even though the aforementioned bandolier alluded to it, but for the most part official items other than that.
- Assume no flying invisible helpers as suggested by HeyICanChan or for that matter third party interventions or Aid Another.
The end result in game was quite literally at least 2 dozen attacks per round, perhaps more. Which I have questioned him multiple times about the build and legitimacy but he as refused to provide any answers. I know DMs do not have to justify but this, combined with a number of other things over the years has lead to distrust. I have since stopped playing his games altogether, so this is just a verification on whether I have overreacted.
This was broken into 3 questions for each of the editions.
AD&D, AD&D 2nd Edition, and Dungeons & Dragons 3.X.
The firbolg’s Hidden Step trait (VGtM, p. 107) is described as being active "until the start of your next turn" at most:
As a bonus action, you can magically turn invisible until the start of your next turn
I’m unclear on the exact mechanics of turn starts. For instance, if I use Hidden Step as a bonus action at the end of my turn, would the invisibility stay active for my next attack?
My initial reading was "no" as the trait would stay active from when I use it, into the next round, and drop as soon as my turn came up in the initiative order. I would then become visible, and take my action. This also gels conceptually: I can use Hidden Step to protect myself from combat for a round, or I can use it to gain advantage on an attack. But I can’t use it for both.
However, I’ve also read that advantage for invisibility is determined at the start of the round, and thus the advantage would in fact carry over to the next round’s attack, as if I was attacking from hiding or something similar.
Which is it, and what source would resolve it?
Seeking a one-line command (v. 10) to solve for x[s_] and y[s_] in the following equation: 3x+4y=1+5s. The answes are x=-1+3s and y=1-s.
Can anyone try the following hydra command and fix it for me I do not quite understand it: hydra -s 80 -l admin -P PASS /root/Desktop/wl/wordlist.txt -e ns -t 16 192.168.1.99 http-post-form Thanks in advance
Let G be undirected graph, G=(V,E). Consider an edge e=(u,v)∈E that wasn’t included in the solution obtained from applying Kruskal Algorithm to G. Prove that this edge isn’t in any Minimimum Spanning Tree of G.