Šajā darbā aprakstīti divi algoritmi forsētu uzvaru meklēšnai Gomoku un Rendzju spēlēs. Pirmais algoritms meklē forsētu uzvaru ar trijniekiem (angl. Victory by Consecutive Threats, VCT), otrais algoritms meklē uzvaru ar četriniekiem (angl. Victory by Consecutive Fours, VCF). Aprakstīts, kā abi algoritmi var tikt adaptēti gan Gomoku, gan Rendzju spēlei. Algoritmi atbalsta gan ierobežotu Gomoku paveidu (kur 6 un vairāk rindā nav uzvara), gan neierobežotu Gomoku paveidu (kur 6 un vairāk rindā ir uzvara).This paper describes two algorithms for the search of the forced wins in the Gomoku and Renju games. The first algorithm searches for the Victory by Consecutive Threats (VCT), the second algorithm searches for the Victory by Consecutive Fours (...
The task of this work is to bring a complete guide for solving a SOKOBAN game problem. The work foll...
This work deals with games played on chessboard and examines which algorithm for playing them perfor...
Cílem této práce bylo aplikovat současné algoritmy systematického a lokálního prohledávání na zobecn...
The subject of this paper is an unusual approach to artificial game playing. Our main goal is to rep...
Táto práca sa zaoberá použitím algoritmu AlphaZero pre hru Gomoku. AlphaZero je založený na spätnovä...
Šī darba mērķis ir Mākslīga Intelekta nodaļas divu spēlētāju spēles pētīšana Rendzju piemērā. Darbā ...
In the present work we study non-uniform methods for searching game trees of two player games with p...
The Kalah game represents the most popular version of probably the oldest board game ever-the Mancal...
Darba mērķa teorētiskā daļa ir izpētīt meklēšanas algoritmus spēlē dambrete. Šeit un tālāk, pēc mekl...
Backward Induction Method, which is the most basic algorithm for game tree search, has two weak poin...
V magistrskem delu se ukvarjamo s preiskovalnimi algoritmi, s katerimi je možno poiskati rešitve za ...
This thesis aims to investigate general game-playing by conducting a comparison between the well-kno...
This diploma thesis focuses on finding a draw strategy in the game "Gobblet" and on finding the proo...
Congklak is a favorite populist game played at least 2 (two) players or in this article were human u...
An algorithm is presented for game-tree searching that is shown under fairly general but formally s...
The task of this work is to bring a complete guide for solving a SOKOBAN game problem. The work foll...
This work deals with games played on chessboard and examines which algorithm for playing them perfor...
Cílem této práce bylo aplikovat současné algoritmy systematického a lokálního prohledávání na zobecn...
The subject of this paper is an unusual approach to artificial game playing. Our main goal is to rep...
Táto práca sa zaoberá použitím algoritmu AlphaZero pre hru Gomoku. AlphaZero je založený na spätnovä...
Šī darba mērķis ir Mākslīga Intelekta nodaļas divu spēlētāju spēles pētīšana Rendzju piemērā. Darbā ...
In the present work we study non-uniform methods for searching game trees of two player games with p...
The Kalah game represents the most popular version of probably the oldest board game ever-the Mancal...
Darba mērķa teorētiskā daļa ir izpētīt meklēšanas algoritmus spēlē dambrete. Šeit un tālāk, pēc mekl...
Backward Induction Method, which is the most basic algorithm for game tree search, has two weak poin...
V magistrskem delu se ukvarjamo s preiskovalnimi algoritmi, s katerimi je možno poiskati rešitve za ...
This thesis aims to investigate general game-playing by conducting a comparison between the well-kno...
This diploma thesis focuses on finding a draw strategy in the game "Gobblet" and on finding the proo...
Congklak is a favorite populist game played at least 2 (two) players or in this article were human u...
An algorithm is presented for game-tree searching that is shown under fairly general but formally s...
The task of this work is to bring a complete guide for solving a SOKOBAN game problem. The work foll...
This work deals with games played on chessboard and examines which algorithm for playing them perfor...
Cílem této práce bylo aplikovat současné algoritmy systematického a lokálního prohledávání na zobecn...