Thesis Details
Scrabble pro mobilní telefony
This paper deals with an usage of searching algorithms and lexical data structures for platforms with limited computing power and accessible memory (celluar phones and similar) in SCRABBLE brand crossword game. There are also shown its advantages and disadvantages on this platform. The Appel-Jacobson searching algorithm is used to search possible moves. The lexicon with all words is available for this algorithm. It's stored in Directed Acyclic Word Graph (DAWG), which provides fast data searching and data compression too, so the size of the lexicon is comparatively small considering the target platform. The final Java application for celluar phones (MIDP 2.0) adds graphical interface and game control so it provides playing SCRABBLE brand crossword game against artificial intelligence or against human.
Scrabble, Trie, Directed Acyclic Word Graph, DAWG, Appel-Jacobson algorithm, Backtracking games, Artificial intelligence, Game heuristics
Bartík Vladimír, Ing., Ph.D. (DIFS FIT BUT), člen
Černocký Jan, prof. Dr. Ing. (DCGM FIT BUT), člen
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Motyčka Arnošt, doc. Ing., CSc. (Mendelu), člen
@bachelorsthesis{FITBT4990, author = "Ond\v{r}ej Kan\v{e}\v{c}ka", type = "Bachelor's thesis", title = "Scrabble pro mobiln\'{i} telefony", school = "Brno University of Technology, Faculty of Information Technology", year = 2008, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/4990/" }