OCTAAJI, SAMUEL DEVAPRASAD (2018) Negascout Algorithm Implementation in Othello Board Games. Other thesis, Unika Soegijapranata Semarang.
|
Text (COVER)
13.02.0015 Samuel Devaprasad Octaaji.COVER.pdf Download (1MB) | Preview |
|
|
Text (BAB I)
13.02.0015 Samuel Devaprasad Octaaji.BAB I.pdf Download (69kB) | Preview |
|
![[img]](https://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (BAB II)
13.02.0015 Samuel Devaprasad Octaaji.BAB II.pdf Restricted to Registered users only Download (72kB) |
|
|
Text (BAB III)
13.02.0015 Samuel Devaprasad Octaaji.BAB III.pdf Download (78kB) | Preview |
|
|
Text (BAB IV)
13.02.0015 Samuel Devaprasad Octaaji.BAB IV.pdf Download (162kB) | Preview |
|
|
Text (BAB V)
13.02.0015 Samuel Devaprasad Octaaji.BAB V.pdf Download (184kB) | Preview |
|
|
Text (BAB VI)
13.02.0015 Samuel Devaprasad Octaaji.BAB VI.pdf Download (83kB) | Preview |
|
|
Text (DAFTAR PUSTAKA)
13.02.0015 Samuel Devaprasad Octaaji.DAFTAR PUSTAKA.pdf Download (58kB) | Preview |
|
|
Text (LAMPIRAN)
13.02.0015 Samuel Devaprasad Octaaji.LAMPIRAN.pdf Download (107kB) | Preview |
Abstract
ABSTRACT Othello is a zero-sum board game. Although Othello is simpler than chess, it is impossible to calculate all of sixty moves. The sheer number of possibilities will hinder calculation process. The project will explain the solution to this problem . Negascout algorithm is used to search for the maximum evaluated score. After generating all possible moves within six step ahead, Negascout will do the searching and pruning in the tree data structure. Pruning is important to reduce the visited nodes. Nodes with the maximum evaluated game are stored as the best move. There are three difficulty levels in the games. The difficulty level will affects the tree depth. Artificial intelligence will act based on the search results. In some case, the action will be similar for each difficulty level. This is happening because the game state with the maximum evaluated score in the second depth tends to be a parent of the game state with the maximum evaluated score in the next depth. Keyword: Othello, Negascout Algorithm, Tree Data Structure, Artificial Intelligence.
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 005 Computer programming, programs & data > Information Systems |
| Divisions: | Faculty of Computer Science > Department of Informatics Engineering |
| Depositing User: | Mr Lucius Oentoeng |
| Date Deposited: | 21 Jun 2018 04:14 |
| Last Modified: | 19 Mar 2021 07:01 |
| URI: | http://repository.unika.ac.id/id/eprint/16132 |
Actions (login required)
 |
View Item |
