Congklak, a traditional game solution approach with breadth first search
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 eac...
| Main Authors: | , , , , , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2018-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | https://doi.org/10.1051/matecconf/201819703007 |
| _version_ | 1818664188910764032 |
|---|---|
| author | Rahim Robbi Kurniasih Nuning Hasibuan Abdurrozzaq Andriany Liesna Najmurrokhman Asep Supriyanto S Wardayani W Hidayat Rahmat Lubis D S W Napitupulu Darmawan Nugraha Anggara Trisna Siburian Henry Kristian Abdullah Dahlan |
| author_facet | Rahim Robbi Kurniasih Nuning Hasibuan Abdurrozzaq Andriany Liesna Najmurrokhman Asep Supriyanto S Wardayani W Hidayat Rahmat Lubis D S W Napitupulu Darmawan Nugraha Anggara Trisna Siburian Henry Kristian Abdullah Dahlan |
| author_sort | Rahim Robbi |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-17T05:28:47Z |
| format | Article |
| id | doaj.art-e6be84f417674dafbc02964ce7f7bc7c |
| institution | Directory Open Access Journal |
| issn | 2261-236X |
| language | English |
| last_indexed | 2024-12-17T05:28:47Z |
| publishDate | 2018-01-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | MATEC Web of Conferences |
| spelling | doaj.art-e6be84f417674dafbc02964ce7f7bc7c2022-12-21T22:01:48ZengEDP SciencesMATEC Web of Conferences2261-236X2018-01-011970300710.1051/matecconf/201819703007matecconf_aasec2018_03007Congklak, a traditional game solution approach with breadth first searchRahim RobbiKurniasih NuningHasibuan AbdurrozzaqAndriany LiesnaNajmurrokhman AsepSupriyanto SWardayani WHidayat RahmatLubis D S WNapitupulu DarmawanNugraha Anggara TrisnaSiburian Henry KristianAbdullah DahlanCongklak 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.https://doi.org/10.1051/matecconf/201819703007 |
| spellingShingle | Rahim Robbi Kurniasih Nuning Hasibuan Abdurrozzaq Andriany Liesna Najmurrokhman Asep Supriyanto S Wardayani W Hidayat Rahmat Lubis D S W Napitupulu Darmawan Nugraha Anggara Trisna Siburian Henry Kristian Abdullah Dahlan Congklak, a traditional game solution approach with breadth first search MATEC Web of Conferences |
| title | Congklak, a traditional game solution approach with breadth first search |
| title_full | Congklak, a traditional game solution approach with breadth first search |
| title_fullStr | Congklak, a traditional game solution approach with breadth first search |
| title_full_unstemmed | Congklak, a traditional game solution approach with breadth first search |
| title_short | Congklak, a traditional game solution approach with breadth first search |
| title_sort | congklak a traditional game solution approach with breadth first search |
| url | https://doi.org/10.1051/matecconf/201819703007 |
| work_keys_str_mv | AT rahimrobbi congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT kurniasihnuning congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT hasibuanabdurrozzaq congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT andrianyliesna congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT najmurrokhmanasep congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT supriyantos congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT wardayaniw congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT hidayatrahmat congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT lubisdsw congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT napitupuludarmawan congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT nugrahaanggaratrisna congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT siburianhenrykristian congklakatraditionalgamesolutionapproachwithbreadthfirstsearch AT abdullahdahlan congklakatraditionalgamesolutionapproachwithbreadthfirstsearch |