Learn Blackjack Video Source & Info:
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Victor Costan
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Source: YouTube
Victor You should ask Eric for chalks, he has some nice , big , fat chalks
0:20 – 18:00 Blackjack using graphs
18:00 – 37:20 Blackjack using DP
37:20 – 52:57 longest increasing sub-sequence
Is this just me? But I find it hilarious every time the chalk breaks .
Wow, after days of mulling over the text justification problem and the blackjack problem, which were harder examples of DP, the longest increasing sub-sequence problem was a breeze. I got the DP and the state in seconds. These teachers are amazing.
Where's my cushion?
Victor is a great teacher. He repeats all the process over and over again so that make it sure all students understand the topic.
upload interviews faceoff is still ok..everytime you say interview questions…
At 12:00 why the edge end at 11 can't figure out , I am clear upto this point , if i already played 5 card then remaining card i can deal with (52-5=48) , so he iterating from 0 to 48 cards , now if i hit one card that means i have played total 6 card with 1 hit and makes me win , but not able to conclude why 11 , as i played only one card after 5 card.that makes 6 and i won .
, anyone can please explain ?
Love this
Could someone please tell me why we are looking at number of hits rather than single hit or miss at each move. I am not understanding this point.
Kenne diesen Trick Dieses System scheint in der Tat auf merkwürdige Weise zu funktionieren. Selbst wenn das sicher hier keiner ernst nimmt.