Participant of Video games

Participant of Video games

[Submitted on 6 Dec 2021]

Authors: Martin Schmid, Matej Moravcik, Neil Burch, Rudolf Kadlec, Josh Davidson, Kevin Waugh, Nolan Bard, Finbarr Timbers, Marc Lanctot, Zach Holland, Elnaz Davoodi, Alden Christianson, Michael Bowling

Earn PDF

Summary: Video games include an extended history of serving as a benchmark for growth in
artificial intelligence. Lately, approaches utilizing search and finding out include
shown solid performance during a neighborhood of ideal files video games, and
approaches utilizing game-theoretic reasoning and finding out include shown solid
performance for particular unsuitable files poker variants. We introduce
Participant of Video games, a general-motive algorithm that unifies outdated approaches,
combining guided search, self-play finding out, and game-theoretic reasoning.
Participant of Video games is the first algorithm to attach solid empirical performance
in gigantic ideal and unsuitable files video games — a a must-include step in direction of
if truth be told general algorithms for arbitrary environments. We sign that Participant of
Video games is sound, converging to ideal play as on hand computation time and
approximation capacity will enhance. Participant of Video games reaches solid performance in
chess and Breeze, beats the strongest overtly on hand agent in heads-up no-restrict
Texas aid’em poker (Slumbot), and defeats the command of the art agent in
Scotland Yard, an unsuitable files game that illustrates the associated charge of
guided search, finding out, and game-theoretic reasoning.

Submission history

From: Marc Lanctot [view email]

Mon, 6 Dec 2021 17: 16: 24 UTC (7,469 KB)



Hey! look, i give tutorials to all my users and i help them!