文章基本信息

标题：Congklak, a traditional game solution approach with breadth first search
本地全文：下载
作者：Robbi Rahim ; Nuning Kurniasih ; Abdurrozzaq Hasibuan 等
期刊名称：MATEC Web of Conferences
电子版ISSN：2261-236X
出版年度：2018
卷号：197
DOI：10.1051/matecconf/201819703007
语种：English
出版社：EDP Sciences
摘要：Congklak is a favorite populist game played at least 2 (two) players or in this article were human user and computer (AI). An essential point of playing congklak is to collect as many congklak seeds as possible to win the game, to win form from congklak it need a technique and it’s different for each players. Breadth First Search algorithm is a search algorithm which process to visit each node and the neighbors node to generate optimal graph that gives the best solution to computer (AI) and in this case were to complete the congklak game. Breadth First Search algorithm could be uses an alternative solution for optimal solution to win congklak with the help of mathematical computation.