|
|
| Line 222: |
Line 222: |
| | |} | | |} |
| | |}<!-- B --> | | |}<!-- B --> |
| − | {|<!-- T -->
| + | |
| − | | valign="top" |
| |
| − | {| class="wikitable" style="width: 550px;"
| |
| − | ||
| |
| − | <youtube>gGZQSJZyd5M</youtube>
| |
| − | <b>Dr. Michael Bowling – Artificial Intelligence Goes All-In: Computers Playing Poker
| |
| − | </b><br>Lecture of prof. Michael Bowling organized by dept. of Computer Science, FEL ČVUT in cooperation with MFF UK
| |
| − | |}
| |
| − | |<!-- M -->
| |
| − | | valign="top" |
| |
| − | {| class="wikitable" style="width: 550px;"
| |
| − | ||
| |
| − | <youtube>eFlgrFLJ9Vk</youtube>
| |
| − | <b>DeepStack: Expert-Level Artificial Intelligence in Heads-Up No-Limit Poker | AISC
| |
| − | </b><br>Discussion lead: Rick Valenzano Motivation: Artificial intelligence has seen several breakthroughs in recent years, with games often serving as milestones. A common feature of these games is that players have perfect information. Poker is the quintessential game of imperfect information, and a longstanding challenge problem in artificial intelligence. We introduce DeepStack, an algorithm for imperfect information settings. It combines recursive reasoning to handle information asymmetry, decomposition to focus computation on the relevant decision, and a form of intuition that is automatically learned from self-play using deep learning. In a study involving 44,000 hands of poker, DeepStack defeated with statistical significance professional poker players in heads-up no-limit Texas hold’em. The approach is theoretically sound and is shown to produce more difficult to exploit strategies than prior approaches.
| |
| − | |}
| |
| − | |}<!-- B -->
| |
| − | {|<!-- T -->
| |
| − | | valign="top" |
| |
| − | {| class="wikitable" style="width: 550px;"
| |
| − | ||
| |
| − | <youtube>07F9FPk82z8</youtube>
| |
| − | <b>Call, Raise or Fold - [[Python]] for Simulating Poker Games - Abhijit Gadgil
| |
| − | </b><br>This talk was presented at PyCon India 2019, on Oct 12th - 13th, at the Chennai Trade Centre. Website: http://in.pycon.org/2019
| |
| − | |}
| |
| − | |<!-- M -->
| |
| − | | valign="top" |
| |
| − | {| class="wikitable" style="width: 550px;"
| |
| − | ||
| |
| − | <youtube>3yFzFTITYv0</youtube>
| |
| − | <b>PWLSF - 3/2017 - Tom Santero on DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker
| |
| − | </b><br>Talks given on March 30, 2017 at OpenDNS. Matt Adereth on the January 1965 issue of The Computer Journal. This issue contains one of the most important techniques in numerical optimization, the Nelder-Mead simplex method. An entire full-length talk could be dedicated to it, but instead we’re going to try and understand the historical context by looking at everything else in the journal, from the other papers to the letters to the editor to the advertisements. Matt's Bio Matt builds tools and infrastructure for quantitative research at Two Sigma. He previously worked at Microsoft on Visio, focusing on ways to connect data to shapes In his spare time, he builds ergonomic keyboards using Clojure.
| |
| − | |}
| |
| − | |}<!-- B -->
| |
| | | | |
| | === Imperfect Information === | | === Imperfect Information === |
