Summer of Math Exposition

Really solid video ! The topic is not the most interesting in my opinion, but you managed to share it in a way that made it entertaining. Everything is really easy to understand, it was a pleasure to watch.

Very good animation style. But I believe the conclusions of the math are wrong. The corner most likely has the greatest chance of being reached

Awesome video: good animations, novel & interesting topic, good explanation. Some quality improvements in audio and subtitles are possible. Engagement was great.

Hi ! I have not noticed any obvious possible improvements to your video. Beautiful animations, sound quality was great, and explanations are very clear. Maybe you could provide a little bit more motivation at the beginning ? Like why is this problem of counting the average return time important or complicated. Other than that, very very good video. Thanks for submitting and keep at it. :)

I would suggest using an easy problem to build intuition and then explaining why the chess board has that property

Would have loved to see the specific formulas used. Good explanation!

Rating as "Better than most" I really enjoyed this one. Its a nicely paced video and the subject is explained well. I thought that this was a neat way of looking at the problem. I wouldn't have thought of this approach so it has taught me something new.

The video does not adequately explain the leaps of logic it uses. Why is the likelihood of being on a given square proportional to the number of valid moves from that square, without any weighting for the likelihood of being on *those* squares? There is a reason, but the video does not provide it. Why is the expected return time equal to the long-term average probability of being on a given square when taking random moves? Again there is a reason, and again the video does not provide it.

I really liked this video. The only thing that I missed was a bit of more math in it. Maybe not a rigourious proof, but at least some intuitive justifications.

Very nice introduction-by-example to random Markov chains.

Short and sweet. Was expecting more based on the title but very clean delivery and easy to stay engaged.

Good problem but less applicable but still lot enjoyable