If the dragon has one head, you can cut it off then in the moment before it grows back the dragon has zero heads and the soldier wins. This case was missed
For the first problem, let p be the probability of miss. Then P(soldier wins) = 2p^3 / (1 - 2p^3). This is what you get when draw out the Markov chain and solve the system of equations
I don't know if this is because English isn't my native language but on the first problem the description sounds a bit misleading. "...or misses entirely OR the dragon gains a head..." sounds like these are two different scenarios. Remember that later she says "the probability of missing is always equal to the probability of killing two heads given that..." so it's assumed that missing entirely and gaining a head are the same scenario. Also, in the Markov chain graph later the transition probability from state 1 to state 2 should be 1 since that's the only possible scenario; after all, this is what the guy says when he explains his thought process.
1. I was surprised the answer is independent of the probability of one head. Changing this doesn't change the answer but does change how fast we converge to a final state. 3. Probability player 1 wins is 9/13 but the odds are 9:4, right?
The solution is obvious if you solve recursively and count the depth of recursion tree.
if he cannot <kill 2 heads> when there is only 1 head remaining, then he also cannot miss, since the probability of missing is defined to be equal to the probability of <kill 2 heads>. So probability of killing that 1 head = 1. if the game can be concluded in the instant before the dragon grows back a head from 0 heads, that's another win condition.
it doesn't make sense that the dragon only regrows a head when it gets 1 head chopped. it should just grow 1 head after every round, whether it gets 2, 1, or 0 chopped. And also the soldier should be have the probability of chopping 1 head if it's the last, and winning.
Can you do HRT interview?
Let me clarify the deuce for non-tennis guys. It would be best if you thought of a deuce not like winning 2 consecutive points but surpassing your opponent with 2 points. To understand why you should think like that, think of this scenario: The player scores 1 point and then the player 2 scores consecutive 2 points. If you think the player 2 just won, it is wrong. Player 2 should still get 1 more point (which means it gets 3 points consecutively). If you think winning 2 consecutive points is enough to win the game, then the final answer will be (12.6/19) I believe they should have explained the Deuce more carefully.
Can you do quant research?
the first problem is very badly formulated, could be better next time I guess
Dragons yo, you heard!
Hello 👋🏼 please can you tell me your opinion on technical analysis? can one be profitable with technical analysis alone?
WHAT, how can anyone even understand the fucking question
These are medium/easy level?
If i ever get asked these at work, im quitting. This is a trading firm. Not preschool. I wouldn't hire the idiot that spends 15 mins on dragons during the interview. Fire the interviewer too because every question asked is never given complete information, as well as saying Sweet as a response. Quant not.
@TheQuantGuide