Sökning: "Anton Janshagen"

Hittade 1 uppsats innehållade orden Anton Janshagen.

  1. 1. Monte-Carlo Tree Search for Fox Game

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

    Författare :Anton Janshagen; Olof Mattsson; [2022]
    Nyckelord :Monte-Carlo Tree Search; Artificial Intelligence; Fox Game; Cutoff; Heuristic Function;

    Sammanfattning : This report explores if Monte-Carlo Tree Search (MCTS) can perform well in Fox Game, a classic Scandinavian strategy game. MCTS is implemented using a cutoff in the simulation phase. The game state is then evaluated using a heuristic function that is formulated using theoretical arguments from its chess counterpart. LÄS MER