Penerapan Algoritma Booyer Moore Pada Aplikasi Teka Teki Silang (TTS)
-
M. Ibnu Ramadhan
*
Universitas Budi Darma, Medan,
Indonesia
(*) Corresponding Author
Abstract
Crossword or abbreviated with TTS is a game to fill the empty spaces (in the form of white boxes) with letters that form a word based on the instructions given. In further developments, this puzzle is also intended for problems that must be filled with numbers. To fill in the letters in each box, instructions are given that are divided into "horizontal" and "downward" categories. The speed at which to play the crossword game depends greatly on the vocabulary possessed by the player. That is because the game must be able to arrange words whose letters are interrelated arranged vertically and vertically, the words must be in accordance with the theme of questions provided by the game. Boyer Moore's algorithm is the most efficient string search algorithm and has become the standard of the string search system. This algorithm detects patterns in strings by comparing characters in different sequences. This process is called Shift, and shift rules are calculated by applying 2 rules, namely bad character rules and good suffix rules. The maximum value of the shift length that can be done is calculated by this rule, then the character search is carried out from the beginning until the shift is as long as the shift length
Downloads
References
Wikipedia, “Teka-teki silang,” 2019. .
C. Charras and T. Lecroq, Handbook of Exact String-Matching Algorithms. London: King College London Publication, 2004.
M. S. Syakur and Wijanarto, “Generator Teka-Teki Silang Menggunakan Algoritma Backtracking dan Brute Force,” J. Appl. Intell. Syst. UDINUS, vol. 1, no. 1, pp. 12–21, 2016.
A. Darmawan dan Setianingrum, “Implementasi Algoritma Boyer Moore Pada Aplikasi Kamus Istilah Kebidanan Berbasis Web,” J. Sist. Inf., vol. II, no. April, pp. 53–62, 2018.
G. L. Ginting, “Implementasi Algoritma Boyer-Moore Pada Aplikasi Pengajuan Judul Skripsi Berbasis Web,” Pelita Inform., vol. 3, no. 1, 2014.
S. S. Sari and G. Ginting, “Implementasi Algoritma Boyer Moore Pada Kamus Perbedaan Kata Dalam Bahasa Inggris British dan Bahasa Inggris America,” J. Informatics Manag. Inf. Technol., vol. 1, no. 2, pp. 74–78, 2021.
A. Fau, M. Mesran, and G. L. Ginting, “Analisa Perbandingan Boyer Moore Dan Knuth Morris Pratt Dalam Pencarian Judul Buku Menerapkan Metode Perbandingan Eksponensial ( Studi Kasus : Perpustakaan STMIK Budi Darma ),” J. Times (Technology Informatics Comput. Syst., vol. 6, no. 1, pp. 12–22, 2017.
M. Ayu Permatasari Siahaan, “Kamus Nama Bayi Beserta Maknanya,” Pelita Inform., vol. 17, pp. 97–101, 2018.
Sulastri, “Implementasi Algoritma Turbo Boyer Moore Pada Aplikasi Tarian Tradisional Berbasis Android,” Bull. Comput. Sci. Res., vol. 1, no. 3, pp. 93–97, 2020.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Algoritma Booyer Moore Pada Aplikasi Teka Teki Silang (TTS)
Pages: 378-384
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
