Congklak, a traditional game solution approach with breadth first search

¹ Universiti Malaysia Perlis, School of Computer and Communication Engineering, Perlis, Malaysia
² Universitas Padjadjaran, Faculty of Communication Science, Library and Information Science Program, Bandung, Indonesia
³ Universitas Islam Sumatera Utara, Department of Industry Engineering, Medan, Indonesia
⁴ Universitas Islam Sumatera Utara, Department of Language and Literature, Medan, Indonesia
⁵ Universitas Jenderal Achmad Yani, Department of Electrical Engineering, Cimahi, Indonesia
⁶ Politeknik LP3I Medan, Department of Business Administration, Medan, Indonesia
⁷ Sekolah Tinggi Ilmu Manajemen Sukma, Department of Management, Medan, Indonesia
⁸ Indonesian Institute of Sciences, Research Center for Quality System and Testing Technology, Jakarta, Indonesia
⁹ Universitas Muhammadiyah Sidoarjo, Department of Electrical Engineering, Sidoarjo, Indonesia
¹⁰ Sekolah Tinggi Manajemen Informatika dan Komputer, Department of Informatics, Medan, Indonesia
¹¹ Universitas Malikussaleh, Department of Informatics, Lhokseumawe, Indonesia

^* Corresponding author: usurobbi85@zoho.com

Abstract

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.