Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal TIN: TERAPAN INFORMATIKA NUSANTARA
Ramadhan, M. Ibnu
Unknown Affiliation
Aerospace Engineering Arts Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Neuroscience Nursing Physics Social Sciences Veterinary Other

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Penerapan Algoritma Booyer Moore Pada Aplikasi Teka Teki Silang (TTS) Ramadhan, M. Ibnu
TIN: Terapan Informatika Nusantara Vol 2 No 6 (2021): November 2021
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar

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
Co-Authors