Sökning: "Counterfactual regret minimization"

Hittade 4 uppsatser innehållade orden Counterfactual regret minimization.

  1. 1. Evaluating the performance of a team consisting of an advanced agent and a less advanced agent in the game Manille : A comparison of agents trained using the CFR algorithm with and without abstractions.

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Oliver Lindgren; Leonardo Rezza; [2023]
    Nyckelord :;

    Sammanfattning : Making artificial intelligence (AI) algorithms solve games has always been an interesting benchmark of AI research. Perfect information games like Chess can be played on a level beyond human capabilities. LÄS MER

  3. 2. Stratego Using Deep Reinforcement Learning and Search

    Master-uppsats, KTH/Matematisk statistik

    Författare :Anton Falk; [2021]
    Nyckelord :;

    Sammanfattning : Algorithmic game theory is a research area concerned with developing algorithms for solving games using game-theoretic concepts, with many applications in areas where games are used as models to achieve knowledge. In the last decades, numerous game-playing bots have been created, and in many games, they outperform top humans. LÄS MER

  4. 3. En spelteoretisk AI för Stratego

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Giorgio Sacchi; David Bardvall; [2021]
    Nyckelord :Counterfactual Regret Minimization; AI; Imperfect recall; Wargames; Imperfect infomation games; Stratego;

    Sammanfattning : Many problems involving decision making withimperfect information can be modeled as extensive games. Onefamily of state-of-the-art algorithms for computing optimal playin such games is Counterfactual Regret Minimization (CFR).The purpose of this paper is to explore the viability of CFRalgorithms on the board game Stratego. LÄS MER

  5. 4. Bluffing AI in Strategy Board Game

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Johan Leijonhufvud; Albin Henriksson; [2021]
    Nyckelord :Strategy game; Stratego bot; Tactical AI; Counterfactual regret minimization; Chance sampling;

    Sammanfattning : Games have been a field of interest for researchin artificial intelligence for decades. As of now, it is over 5years ago an AI for the strategy game Go, AlphaGo, beat worldchampion Lee Sedol 4-1, which was considered to be an enormousmilestone for AI. LÄS MER