ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Visualization of minimax algorithm on game nim

Matjaž Tramte (2013) Visualization of minimax algorithm on game nim. EngD thesis.

Download (516Kb)


    We present a web application for minimax principle visualization. The purpose of it was to improve understanding of minimax algorithm and alpha-beta pruning. We describe idea for algorithm presentation and its implementation. Minimax algorithm was implemented on three variants of nim game: Grundy's game, Subtraction game and Greedy nim. All three variants are presented and their rules explained. On one of the variants we implemented and explained alpha-beta pruning. Technologies and tools we used in the application are described and the architecture of application is explained. Application consists of two parts: the game itself and a game tree where working of minimax algorithm is visualised.

    Item Type: Thesis (EngD thesis)
    Keywords: nim game, minimax principle, alpha-beta pruning, two player games, algorithm visualization
    Number of Pages: 40
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    izr. prof. dr. Marko Robnik Šikonja276Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=9993812)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 2088
    Date Deposited: 05 Jul 2013 13:05
    Last Modified: 23 Jul 2013 11:04
    URI: http://eprints.fri.uni-lj.si/id/eprint/2088

    Actions (login required)

    View Item