Analisis Perbandingan Algoritma Longest Common Subsequence Dengan Simple Hill Climbing Pada Permainan TTS
-
Yardani Yardani
*
Universitas Budi Darma, Medan,
Indonesia
(*) Corresponding Author
Abstract
Crossword is a game to sharpen the brain. Crossword puzzles can be used in the field of education to test students' abilities, so that the questions used are adapted to their needs. But it will be difficult if a large number of questions are used, because to make a crossword puzzle from a set of questions, the possible combinations of existing words form a crossword puzzle. Research in optimizing the filling of empty spaces in the crossword matrix board certainly requires an algorithm using a comparison of the Longest Common Subsequence (LCS) algorithm and the Simple Hill Climbing algorithm. By comparing the performance of the Longest Common Subsequence (LCS) algorithm and the Simple Hill Climbing algorithm, it will be known how the work and performance in terms of speed and accuracy of the two algorithms work. The questions displayed in the crossword application are obtained from the database access randomly by the program. The crossword puzzle that is formed is a collection of answers to the questions used, the answers to the questions are arranged in such a way that they intersect with one another. On this matrix board, the answers to the questions will be placed to form a crossword puzzle. Each letter of the answer will occupy one cell on the matrix board. The number of questions is the number of questions that will be used in the crossword game. Apart from receiving input from the user, the application also provides output to the user in the form of a crossword puzzle and the correct answer from the TTS
References
J. M. Penusa and I. Pendahuluan, “IMPLEMENTASI ALGORITMA SIMPLE HILL CLIMBING PADA APLIKASI GAME TTS ( TEKA – TEKI SILANG ) Paska Marto Hasugian Program Studi Teknik Informatika STMIK Pelita Nusantara , Jl Iskandar Muda No 1 Medan , Sumatera Utara , Indonesia Abstrak,” vol. 19, no. 1, pp. 138–141, 2016.
P. N. Saleh, “Implementasi Algoritma Longest Common Subsequence Dengan Algoritma Genetika Pada Permainan Word Search Puzzle,” vol. 8, pp. 361–366, 2020.
H. Simalango, “RANCANG BANGUN GAME TEKA TEKI SILANG ( TTS ) DENGAN METODE LONGEST COMMON SUBSEQUENCE,” 2012.
J. M. Informasi, V. No, and D. M. Hutagalung, “Konsep algoritma genetika sebagai dasar pembuatan teka teki silang berbasis komputer,” vol. 3, no. 1, pp. 1–7, 2018.
A. Minandar, A. Tanoto, and D. Tanadi, “Aplikasi Algoritma Pencarian String Boyer-Moore pada Pencocokan DNA,” Inst. Teknol. Bandung, pp. 1–3,
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Analisis Perbandingan Algoritma Longest Common Subsequence Dengan Simple Hill Climbing Pada Permainan TTS
Pages: 62-69
Copyright (c) 2022 Yardani Yardani
This work is licensed under a Creative Commons Attribution 4.0 International License.
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).
