Tablut, a Finnish variant of the classic Viking game Hnefatafl is a two-player perfect deterministic game. To accomplish the objective of winning Tablut, the following two game playing strategies were explored:
(1) Alpha-Beta pruning
(2) Monte Carlo Tree Search
Ultimately, since the Alpha-Beta pruning algorithm performed better than Monte Carlo Tree Search, this algorithm as submitted for the COMP 424 class tournament. This programme ranked 21st among ~270 students.
The clockworks of the game were created by Kian Kenyon-Dean (COMP 424 Teacher Assistant). The game playing strategies within the folder "/src/student_player" were created by me.
forked from kiankd/comp424
-
Notifications
You must be signed in to change notification settings - Fork 0
ohaanika/tablut
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implement game-playing algorithms (minimax, alpha-beta, Monte Carlo) on a two-player perfect deterministic game (COMP 424, McGill University)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Java 100.0%