Essays about: "alpha-beta pruning"

Showing result 1 - 5 of 8 essays containing the words alpha-beta pruning.

  1. 1. Optimization Areas of the Minimax Algorithm : A study on a look-ahead AI as applied to the Fox game

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Ludwig Franklin; Hugo Malmberg; [2023]
    Keywords : ;

    Abstract : Artificial intelligence has become more prevalent during the last few years, revolutionizing the field of computer game-playing. By incorporating artificial intelligence as a computerized opponent, games can become more engaging and challenging for human players. READ MORE

  3. 2. Design Specifications for an Interactive Teaching Tool for Game AI using Gomoku

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Erik Nygren; [2022]
    Keywords : ;

    Abstract : This thesis seeks to understand and improve how students can learn the fundamentals of strategic game AI using a game-like application. The work focuses on the design specifications of a mockup application that can be used to teach a user the concepts behind the Minimax and Alpha-Beta Pruning algorithms using the strategic game Gomoku. READ MORE

  4. 3. Playing the Fox Game With Tree Search: MCTS vs. Alpha-Beta

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : David Ye; Jacob Trossing; [2022]
    Keywords : Artificial Intelligence; Monte Carlo Tree Search; the Fox Game; Alpha-Beta Pruning; Asymmetrical Game; Perfect Information Game;

    Abstract : The forefront of game playing Artificial Intelligence (AI) has for the better part of 21st century been using an algorithm called Alpha-Beta Pruning (Alpha-Beta). In 2017, DeepMind launched a new AI, based on the algorithm Monte Carlo Tree Search (MCTS), which defeated the former Alpha-Beta based chess AI champion Stockfish. READ MORE

  5. 4. A comparison of two tree-search based algorithms for playing 3-dimensional Connect Four

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : David Avellan-Hultman; Emil Gunnberg Querat; [2021]
    Keywords : ;

    Abstract : This thesis aims to investigate general game-playing by conducting a comparison between the well-known methods Alpha-beta Pruning and Monte Carlo Tree Search in a new context, namely a three-dimensional version of the game Connect Four. The methods are compared by conducting a tournament with instances of both methods at varying levels of allowed search extent and measuring the performance as a function of the average thinking time taken per move. READ MORE

  6. 5. Exact and Monte-Carlo algorithms for combinatorial games

    University essay from Umeå universitet/Institutionen för fysik

    Author : Anders Leino; [2014]
    Keywords : monte carlo algorithm; combinatorial game theory; computational; haskell;

    Abstract : This thesis concerns combinatorial games and algorithms that can be used to play them.Basic definitions and results about combinatorial games are covered, and an implementation of the minimax algorithm with alpha-beta pruning is presented. READ MORE