| Language: | Slovenian |
|---|---|
| Year of publishing: | 2013 |
| Typology: | 2.11 - Undergraduate Thesis |
| Organization: | UM FERI - Faculty of Electrical Engineering and Computer Science |
| Publisher: | [M. Rešek] |
| UDC: | 004.8:794.98(043.2) |
| COBISS: |
17493526
|
| Views: | 1584 |
| Downloads: | 111 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
| Secondary language: | English |
|---|---|
| Secondary title: | MONTE-CARLO METHODS FOR GAME PLAYING |
| Secondary abstract: | Monte-Carlo methods are a new way of using artificial intelligence for game playing. First concepts of using this method appeared quite some time ago, but first use in gaming came a lot later. In the work we present one of possible uses of that algorithm in the game of checkers. Monte-Carlo methods are relatively simple to adapt for that game, because it’s a game with perfect information. It shows that even with simple heuristic function the method is competitive to average human players. |
| Secondary keywords: | Monte carlo methods;checkers;games with perfect information;Monte carlo tree search; |
| URN: | URN:SI:UM: |
| Type (COBISS): | Bachelor thesis/paper |
| Thesis comment: | Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko |
| Pages: | VI, 26 f. |
| ID: | 8727855 |