Penggunaan Algoritma Backtracking Pada Permainan Knight's Tour Dengan Membandingkan Algoritma BFS Dan DFS
DOI:
https://doi.org/10.55606/juitik.v3i2.512Keywords:
Knight's Tour, Backtracking, Breadth First Search, Depth First SearchAbstract
Knight is one type of pawn in the game of chess. By using a strategy to play chess pieces, the rules of the Knight's Tour are formed. Knight's Tour is a math puzzle where we have to move the piece by forming the letter "L" exactly once on the game board. Progression in the game results in different types of moves in the Knight and solutions provided. The goal is to get every possible move on the Knight in completing the game optimally. There are various algorithm methods that have been developed to solve this game, one of which is the Backtracking algorithm. And in this study, researchers produced a comparison between the BFS and DFS algorithms in completing the knight's tour game.
References
M. Z. d. D. H. Akbar Serdano, "Implementasi Algoritma Backtracking Pada Knight’s Tour Problem," Volume 3 Nomor 1, 22 Agustus 2019, vol. 3, pp. 179-184, 2019.
S. N. d. D. Pramadhana, "Penerapan Algorithma Backtracking Dalam Menyelesaikan Permainan Knight Tour," pp. 205-213, 2019.
S. N. Simangunsong, "Aplikasi Algoritma Brute Force Pada Knight’s Tour Problem," Makalah IF3051 Strategi Algoritma – Sem. I Tahun 2010/2011, 2011.
M. A. F. Al-Hasan, "Penerapan Algoritma Backtracking pada Knight’s Tour Problem," Makalah IF3051 Strategi Algoritma – Sem. I Tahun 2012/2013, 2012.
F. Thirafi, "Pemanfaatan Algoritma BFS dalam Menyelesaikan Permasalahan Knight Moves," Makalah IF2120 Matematika Diskrit – Sem. I Tahun 2015/2016, 2015.
F. Mumtaz, "Penyelesaian Permasalahan Knight’s Tour Menggunakan Algoritma Breadth First Search (BFS)," 29 April 2010 , 2010.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Jurnal Ilmiah Teknik Informatika dan Komunikasi
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
