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

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

[img]
Preview
PDF
Hermawan_Implementasi Algoritma_Abstract_2012.pdf - Published Version

Download (26Kb) | Preview
[img]
Preview
PDF
Hermawan_Implementasi Algoritma_References__2012.pdf - Published Version

Download (76Kb) | Preview

Abstract

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

Item Type: Article
Uncontrolled Keywords: congklak, greedy algorithm, artificial intelligence, traditional game, game design
Subjects: Q Science > QA Mathematics
Depositing User: Eko Setiawan 194014
Date Deposited: 08 May 2012 01:15
Last Modified: 08 May 2012 01:15
URI: http://repository.ubaya.ac.id/id/eprint/439

Actions (login required)

View Item View Item