IMPLEMENTASI ALGORITMA BOYER-MOORE PADA PERMAINAN WORD SEARCH PUZZLE

Steven Kristanto G, Antonius Rachmat C, R. Gunawan Santosa

Abstract


This research is discuss about implementation of Boyer-Moore algorithm on word search puzzle game. The problem faced is whether Boyer-Moore algorithm can be applied to find the hidden words in the game and measurement of algorithm’s efficiency. The purpose of this research is to understand how algorithm works and to apply the Boyer-Moore algorithm in word search puzzle game. The results of this research are the Boyer-Moore algorithm can be implemented 100% in word search puzzle game. On

Keywords


word search puzzle, Boyer-Moore, string matching.

References


Carras, C., & Lecroq, T. (2004). Handbook of Exact String-Matching Algorithms. London: King's College London Publications.

Chiquita B, C. (2011). Penerapan Algoritma Boyer Moore-Dynamic Programming untuk Layanan Auto-Complete dan Auto-Correct. Makalah IF3051 Strategi Algoritma , 1.

Dwi Purwoko, P. (2006). Perbandingan Algoritma Turbo-BM, Algoritma Quick Search, dan Algoritma Shift-Or. Bandung: UNIKOM.

Hadianti, D. (2007). Penerapan Algoritma String Matching Pada Permainan “Word Search Puzzle”. Makalah IF2251 Strategi Algoritmik , 2.

Munir, R. (2004). Algoritma Pencarian String (String Matching). Bandung: Departemen Teknik Informatika Institut Teknologi Bandung.

Peters, K. (2007). Foundation ActionScript 3.0 Animation Making Things Move. New York: Friendsof.

Soleh, Y. (2010). Implementasi algoritma KMP dan Boyer-Moore dalam Aplikasi Search Engine Sederhana. Makalah IF3051 Strategi Algoritma , 3.

Zulen, A. A. (2009). Penerapa Algoritma Backtracking Pada Permainan Word Search Puzzle.Makalah IF3051 Strategi Algoritma , 1-2.


Refbacks

  • There are currently no refbacks.