Principles of Knowledge Engineering and Reconstruction

cs6501: PoKER

RSS
  • Syllabus
    • Course Registration Survey
  • Projects
    • Warm-Up Project: West Virginia Hold’Em
    • Final Project
  • Schedule
  • Readings
  • Leaderboard

Recent Posts

  • Final Project Submission
  • Machine Learning Comparisons
  • Tuesday’s class: A Theory of the Learnable
  • Some poker bots available for download!
  • Plans for April 21th (updated)

Recent Comments

  • Als on Some poker bots available for download!
  • cbraley on Final Project Submission
  • Peter_C on Final Project Submission
  • Yuchen Zhou on Final Project Submission
  • Thom Noble on Assignment for 24 Feb

Archives

  • May 2011 (1)
  • April 2011 (11)
  • March 2011 (28)
  • February 2011 (17)
  • January 2011 (8)

Meta

  • Log in
  • Entries RSS
  • Comments RSS
  • WordPress.org

Interesting application of HMMs

by brk7bx on March 15th, 2011 at 2:50 pm
Posted In: Uncategorized

http://portal.acm.org/citation.cfm?doid=1880022.1880029

Basically, the authors discovered a side channel attack on encrypted VoIP systems that use VBR encoding (this is relatively common), and they use HMMs to implement their attack.

1 Comment

Plans for Mar 22nd’s class

by Yuchen_Zhou on March 15th, 2011 at 9:47 am
Posted In: Announcements, Classes, Readings

In Mar 22nd’s class we are going to talk a little more on Adaboost, SVM or other related machine learning techniques. Ben will give you an introduction and I will talk more on applying machine learning techniques to build poker bots. The algorithms we are going to talk about are: SVM, CBR and Bayesian network. They can be downloaded at here.

Comments Off

Plans for Final Project

by David Evans on March 15th, 2011 at 9:32 am
Posted In: Announcements, Assignments

For the final project, we will target one (or more) of the games used in the 2011 Computer Poker Competition. These games are all Texas Hold ‘Em games, with three structures:

  1. 2 player, limit
  2. 2 player, no limit
  3. 3 player, limit

We can decide to either agree to have all teams target one of these games (which will enable a full class competition, as well as more sharing of development), or to have teams target different games.

If you have thoughts on this, please post them here or let me know. In particular, note if you have a preference for which of the three games to target.

2 Comments

More comments on Pot odds & Bluffing frequency

by scha on March 12th, 2011 at 3:17 pm
Posted In: Uncategorized

I’m uploading slides that were used in the Mar 3rd presentation.

I’ll also add some comments to discuss issues in them.

*pdf: poker

3 Comments

March 17th Papers

by brk7bx on March 11th, 2011 at 4:28 am
Posted In: Classes, Readings

On March 17th, I will be presenting two machine learning algorithms, Support Vector Machines and Adaptive Boosting. I recommend reading the following papers:

  • Kristin Bennett and Colin Cambpell, Support Vector Machines: Hype or Hallelujah?, SIGKDD Explorations, Volume 2, Number 2, 2000. http://www.sigkdd.org/explorations/issue2-2/bennett.pdf.
  • Yoav Freund and Robert E. Schapire. A Decision-Theoretic Generalization of on-Line Learning and an Application to Boosting. 1995. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9855
Comments Off

Bot from team Brielin-Sahnghyun-Matthew ready

by mky7b on March 11th, 2011 at 12:49 am
Posted In: Assignments, Uncategorized

A version of our bot capable of beating the benchmark is available below.  It was compiled and tested on 32-bit Ubuntu.

brielin-sahnghyun-matthew-bot.tar

3 Comments

Yikan Chen, Weikeng Qin and Yuchen Zhou’s first WV bot.

by Yuchen_Zhou on March 10th, 2011 at 8:40 pm
Posted In: Assignments

No warranty on keeping the dealer/your bot/your computer working.

Please use caution.

Click here to download this “cheater” bot.

Comments Off

Class on CFR Minimization on March 15th

by samee on March 10th, 2011 at 3:06 pm
Posted In: Uncategorized

Me and Yan Huang will be leading the class on March 15th on Counterfactual Regret Minimization. Seems to be a technique that many of the better bots have been exploring in recent contests. Reading materials include the Rubin and Watson survey paper, the paper from UAlberta that introduced this technique to poker, and Chapter 4 from this textbook Algorithmic Game Theory

3 Comments

Project Preliminary Deadline Reminder

by David Evans on March 10th, 2011 at 2:45 pm
Posted In: Announcements, Assignments

Remember that the preliminary deadline for Project 1 is today. The preferred way to satisfy this is to post your bot on the course site, which two teams have already done. If you prefer not to release a preliminary bot, or are making progress on a strategy that has not produced a benchmark-beating bot yet, you can also satisfy it by sending me an email.

2 Comments

Dealer Bug

by David Evans on March 9th, 2011 at 11:03 pm
Posted In: Announcements, Assignments

Note that there is a bug in the isValidAction in game.c that means the dealer will allow invalid raises. The fix is below. See the comments here for a more complete discussion.

Replace line 822 of game.c with

      return 0; // was -1

(Boolean types and strict type checking are good things.)

Comments Off
  • Page 3 of 7
  • «
  • 1
  • 2
  • 3
  • 4
  • 5
  • »
  • Last »

©2011 cs6501: PoKER | Powered by WordPress with Easel | Subscribe: RSS | Back to Top ↑