And then I'm going to go into their algorithm, which is written. We're going to talk about a simple poker game and solutions to it. I'm going to do a quick introduction to what game theory is. Probably spend 55 and then save the rest for questions.Īll right, so that line of talk- first I'm going to talk about what the Cepheus accomplished, what the University of Alberta people accomplished, and I'm going to bring that up by discussing game theory optimal energies in poker. Just raise your hands if something is unclear because I've been told I have about 80 minutes. So by the way, as the lecture goes on, you can interrupt with questions. To It's sort of an, I think, objective commentary. So we're pretty familiar with the same research that's going on. So I have to tell you that Jared and I did not work directly with the University of Alberta people, but we are very familiar with their methods and have actually tried some of their coding techniques. There seems to be a lot of buzz about this, so I thought this was a good to do. We're going to talk about what they actually did. All right, today I'm going to talk about the University of Alberta's Cepheus computer program. I just wish it were at some other time besides the winter. Actually, I'm coming back in another two weeks because I think a Harvard MIT math tournament for high school kids. It's always great to come here, and we're going to be having a tournament in a couple weeks, so good luck for the people participating in that. PROFESSOR: All right, well I'd like to thank you for inviting me again to talk to the poker class. To make a donation or to view additional materials from hundreds of MIT courses, visit MIT OpenCourseWare at.
Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. The following content is provided under a Creative Commons license.
0 kommentar(er)
