Sirvi Autor "Papagoi, Virmo" järgi

Tulemuste filtreerimiseks trükkige paar esimest tähte
Nüüd näidatakse 1 - 1 1
  • Pisipilt
    listelement.badge.dso-type Kirje ,
    Time Complexity of Generating Solvable Boards for Minesweeper
    (Tartu Ülikool, 2025) Papagoi, Virmo; Põder, Ahti, juhendaja; Tartu Ülikool. Loodus- ja täppisteaduste valdkond; Tartu Ülikool. Arvutiteaduse instituut
    This Bachelor’s thesis aimed to determine the time complexity of generating solvable boards for the game Minesweeper. This included implementing Minesweeper in Java to test the time complexity. During this thesis, explanations of solving algorithms for Minesweeper are given, and how these were modified for use in this project. Ideas for board generation algorithms are also discussed, and the generation algorithm used is explained. A hypothesis of Θ(nc^n), where c>1 is a constant that depends on mine density, and time complexity is proposed and shown to fit experimental data.