Відео

what kind of monitor arm they are using?

why no consider the cases that the steps take more than 4 steps, e.g first go to the top left, turn right, turn down, go to the bottom again, turn right and finally meet at bottom right

For assymetric random walk using the similar martingale approach we have E(T_0)= (a/p-q)(p^a-q^a/p^a+q^a) = 4/(1/3)* (2^4-1)/(2^4+1)= 12*15/17=180/17

Guys this is a very easy problem no need to solve equations or do anything just give me like and pray I get into Optiver. Here is the one liner, instead of the reflection think your friends' house is on -4 and +4 u start from 0. u stop when u reach 4 or -4. u need expected stopping time of a symmetric random walk. That is 4*4= 16

Where can I find more such sums to practice

everyone that manipulated random walks for once should get a good answer, wrong people will use markov chains and absorbing states and it's a big red flag to do so in an interview

Full scam 😮

optiver i watched the whole video can i get an internship

Her English is perfect. No accent at all.

for k, it’s (k-1)^2. So it’s 16. Very textbook problem

Oh hi guys, Internet Derg here, how can I help you?

Very interesting challenge. I have just submitted my solutions :)

Nice video, very well explained!

In the beginning it was said that this was to be constructed with a 4x4 grid; but the solution is portrayed with a 5x5?

For ex2, I think there is something wrong with 1/n. For instance, when n = 2, P = 0.375 while 1/n = 0.5. P = 0.375 < 0.5 shows that P > 1/n is not true. I think it should be P > 1/(n+1). Please correct me if I'm wrong.

Very educational! I hope you keep the series going!

How is working in tradong and economics not enitrly BORING and DEPRESSING?

It is always great to see keen eyes and sharp mathematical minds at work. Thanks for sharing your observations below. 07:19, the 2 in the denominator in the formula is missing a power; it should be to the power of 8. 08:39, it can be noted that this inequality holds only for n > 3. If you spot additional errors, please continue to let us know in the comments. Remember, you have until the last day of June to submit your solution to us for Exercise 1 and 2. Solutions will be judged on their clarity of exposition and mathematical novelty. We will announce the winner soon after. Good luck!

More of this please, this is great!

Some errors that I find in the video are:- 1. At 8:52 In Ex:2 it is not holding true for n = 2, for n = 2 the probability of meeting is 1/16*(1+4+1) = 3/8 < 1/2, so the proof should be asked for n>= 4. 2. Another Conceptual error that it is mentioned that probability of meeting for odd n is zero, this is not true actually that given formula is valid for all n,

I think there are 2 minor errors in the video. At 6:35, n doesn't necessarily have to be even. Consider the case n = 3, it's still possible for the friends to meet. At 7:25, the constant in front of the sum should be 1/256, or 1/2^(2*4), instead of 1/2.

I'm not sure you are correct about the 'n must be even' thing. Doesn't really make sense, just try it with 2 and 4.

I think there is something wrong with the explanation for the odd case, it shouldn’t be zero. Please check, it can still meet on the diagonals

Awesome 🙌🏻

Probability is good but in market remove the problem by creating your direction

Amazing!

7:32 There is a bug here! You forgot the power of 2, it should be (1/2) ^ 8

When n = 5, if A only goes up and B only goes left, they should meet at the top left corner right?

What tools do use for testing?

What’s the monitor size ?

Wish, I had found this earlier. I have been working on FPGA's and ASIC's since I started my career. Since last few years I have been trying to switch career into trading, especially algo trading. It's great to see FPGA at the core of HFT.

Here for ES3F1 👽👽👽👽

I think the general public might look at this and think it's an incredible feat because it's chess blindfolded. It is an incredible feat, but because it's multiple games simultaneously. That's not easy. Many of us can play individual games blindfolded quite easily, we can visualize it in our minds pretty trivially. Remembering multiple games at once is genuinely hard

somebody catch this alien

Why change the screen so many times in this video? Showing full screen of the games and then suddenly showing Giri & the boards in small. Constantly changing is not good. Fix to one layout.

Proud to see nepali origin

You ask how? Repetition They are playing these positions for 8 hours a day at least, for most of their lives.

One other application where latency is extremely important is Trigger systems for high-energy collider physics experiments, like LHC in CERN. So hearing you say that standard Xilinx IPs aren't designed for optimal latency hits very close to home

What size are those Dell monitors?

What kind of monitors are you guys using?

More unstable and skewed if you ask me

Dream company 😢

“I’m a professional chessplayer” bro is literally the #5 of the planet

that guy commentating needs to chill

Being a hft how does Backend is done, for the trading process, I am very curious to know and work with Optiver.

That was terrible play by board 3, I look them up and they’re 1900+ fide how did they stuff up so bad haha

Really annoying with the commentator saying the moves and threats. If i play with magnus carlsen calling out all my weaknesses i will easily beat someone with 200 higher elo

Great

nice