Tech Talk: Poker AI: Libratus and an Introduction to Counterfactual Regret Minimization

Subscribers:
58,000
Published on ● Video Link: https://www.youtube.com/watch?v=htRtfyab-Ns



Duration: 12:23
7,302 views
97


In 2017, a poker playing AI developed by researchers at Carnegie Mellon defeated 4 top heads up no limit hold 'em players in a 120,000 hand challenge. In this video, Wade introduces counterfactual regret minimization, one of the algorithms that Libratus was built on, along with a simple CFR example for rock, paper, scissors.

----
Fullstack Academy was recently ranked the #1 coding bootcamp in the U.S. Learn more at https://www.fullstackacademy.com