Recall that Thursday’s class will be the Enigma talk by David J. Saltman in PHS 218. [Details] To ensure that everyone is keeping up with the readings, everyone should post a comment (to this post) about the Rubin and Watson reading [reading post]. Your comment should either: (1) state three surprising things you learned from […] ↓ Read the rest of this entry…
There’s an article in Slate explaining how much more interesting it would be to build a champion poker player than a Jeopardy player: Jeopardy, Schmeopardy: Why IBM’s next target should be a machine that plays poker, Chris Wilson, Feb 15, 2011. But it’s safe to say that the algorithms that were finally able to defeat […] ↓ Read the rest of this entry…
I will be giving an introduction to poker opponent modeling with a discussion on the opponent modeling system used in Loki. Opponent Modeling in Poker: Billings, D. Papp, D. Schaeffer, J. Szafron, D. (opponent_modeling_in_poker_billings.pdf) Class Slides: presentation
Here’s the new survey paper I mentioned in class today: Jonathan Rubin, Ian Watson. Computer Poker: A review. Artificial Intelligence, 2011. [Proof PDF] [Final Version PDF (UVa only)] Please read it before the next class.
For Feb 17th class: http://www.cs.virginia.edu/~evans/poker/wp-content/uploads/2011/02/Evolutionary-Poker_revised.pptx Thanks!
IBM’s Watson pulled off a resounding victory in the computer vs. Jeopardy champions! The computer did make some strange answers (e.g., “What is Toronto?????????” to a question about American cities), but was much faster than the humans on the easy questions (not so surprising) and did get many tricky questions right. Here’s the New York […] ↓ Read the rest of this entry…
Next Thursday (Feb 24), there will be an interesting talk on Enigma and cryptanalysis during our normal class time. So, instead of having class, I encourage everyone to go to the talk. The talk is 11am Thursday, Feb 24 in PHS 218. I have adjusted the presentation schedule to move some of the presentations to […] ↓ Read the rest of this entry…
The slides from the February 15 class are given below. On_the_Borel_and_von_Neumann_Poker_Models.pptx
Project 1 is now posted. It is due March 10 (during Spring Break). We will form teams for this in class Tuesday. If you would like to form your own team for this, you should notify me before class Tuesday.
I’ve added a page with some suggested readings: Readings. I will add more links to this page as the semester progresses. It is definitely not required that the papers you select be from this list, though, it is just meant as a starting point if you are looking for ideas.
©2011 cs6501: PoKER | Powered by WordPress with Easel | Subscribe: RSS | Back to Top ↑
Recent Comments