Record Details

IMPLEMENTASI ALGORITMA GREEDY BEST FIRST SEARCH PADA APLIKASI PERMAINAN CONGKLAK UNTUK OPTIMASI PEMILIHAN LUBANG DENGAN POLA BERFIKIR DINAMIS

Ubaya Repository

View Archive Info
 
 
Field Value
 
Relation http://repository.ubaya.ac.id/439/
 
Title IMPLEMENTASI ALGORITMA GREEDY BEST FIRST SEARCH PADA APLIKASI PERMAINAN CONGKLAK UNTUK OPTIMASI PEMILIHAN LUBANG DENGAN POLA BERFIKIR DINAMIS
 
Creator Hermawan, Galih
 
Subject QA Mathematics
 
Description Congklak or Dakon is one of traditional games in Indonesia that is generally played by two players with the goal of obtaining congklak seeds as much as possible by following the congklak game’s rules. In this paper we discuss the use of greedy best-first search algorithm that is used by the computer’s player for selecting the hole that can produce an optimal solution. The player can make a choice whether to get a seed as much as possible or maintain the vulnerable contains holes that can be shot by the opponent. The test results show that the greedy algorithm is able to produce quite good local solutions, although not necessarily optimal global solutions
 
Publisher Teknik Informatika Universitas Surabaya
 
Date 2012-04-28
 
Type Article
PeerReviewed
 
Format application/pdf
application/pdf
 
Language en
en
 
Identifier /439/1/Hermawan_Implementasi%20Algoritma_Abstract_2012.pdf
/439/2/Hermawan_Implementasi%20Algoritma_References__2012.pdf
Hermawan, Galih (2012) IMPLEMENTASI ALGORITMA GREEDY BEST FIRST SEARCH PADA APLIKASI PERMAINAN CONGKLAK UNTUK OPTIMASI PEMILIHAN LUBANG DENGAN POLA BERFIKIR DINAMIS. Prosiding Seminar Nasional Teknologi Informasi dan Multimedia 2012 (SNASTIA 2012), 3. C1-C6. ISSN 1979-3960