PERANCANGAN APLIKASI GAME CATUR MENGGUNAKAN METODE BREADTH FIRST SEARCH BERBASIS ANDROID
| dc.contributor.author | Purba, Ade Lestari | |
| dc.date.accessioned | 2024-10-21 | |
| dc.date.available | 2024-10-21 | |
| dc.date.issued | 2023 | |
| dc.identifier.uri | https://journal.aira.or.id/index.php/cosie/article/view/871 | |
| dc.description.abstract | Chess is a game that relies on the brain's thinking ability. The current chess game problem is difficult to solve because it is an NP-complete problem. Until now, many programmers are looking for the right algorithm to make chess games, one of which is the Alpha Beta Pruning algorithm, which is a search algorithm used to reduce the number of nodes through an evaluation process. As with the Min-Max algorithm, the Alpha Beta Pruning algorithm is an algorithm for finding the optimal solution to a problem. This study will use the Breadth First Search algorithm to search for the best path in a chess game on the computer side, making it difficult for users to finish the game easily. Keywords: Chess, Game, Algorithm | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Universitas Harapan Medan | en_US |
| dc.subject | APLIKASI GAME CATUR | en_US |
| dc.title | PERANCANGAN APLIKASI GAME CATUR MENGGUNAKAN METODE BREADTH FIRST SEARCH BERBASIS ANDROID | en_US |
| dc.type | Skripsi | en_US |
File In This Item
| No Thumbnail |
|
Peer Review
|
This item appears in the following Collection(s)
Skripsi [1393]Show Simple Item Record