Word-based game development on Android with an efficient graphical data structure

Abstract

Today, new games are released every day, and the virtual reality market is developing in a similar way to the rapidly growing smartphone ecosystem about 10 years ago. In addition to this, mobile games that take place with smartphones in people’s daily lives can be downloaded to their phones for free, without paying any money, only with an internet connection. In this sense, a mobile game on android has been designed and developed about word games for this study. These word games need to have fast feedback and fast research time to the users and the players. In this context, Directed Acyclic Word Graph (DAWG) has been used and applied for giving fast feedback in the developed game “Kelimetris” in the study. The game “Kelimetris” has been explained in detail step by step with showing its captures, screenshots, UML diagrams and code blocks. In addition, this study has showed – the graphical data structure – DAWG’s efficiency and usability in word-based games on mobile phones on Android. As a result, this study will have had a positive effect on the relationship between data structures and mobile games with the contribution of the developed game “Kelimetris” and the finite state machine DAWG.

Keywords

• Word-Based games
• Mobile games
• Android
• Graphs
• DAWG

References

1. Aarseth E (2001). Computer Game Studies, Year One, Game Studies: International Journal of Computer Game Research, 1(1).
2. Aarseth E (2003). Playing Research: Methodological Approaches to Game Analysis. Computer Game Theory Compendium.
3. Ahl D H (1983). Creative Computing Video & Arcade Games.
4. Aoe J, Morimoto K, Shishibori M & Park K-H (1996). A Trie Compaction Algorithm for a Large Set of Keys, IEEE Transactions on Knowledge and Data Engineering, 8(3), 476-491.
5. Appel A W & Jacobson G J (1988). The World’s Fastest Scrabble Program. Communications of the ACM, 31(5), 572-578.
6. Bates B (2004). Game Design: The Art and Business of Creating Games. Boston, MA: Thomson Course Technology.
7. Crochemore M & Vérin R (1997). Direct Construction of Compact Directed Acyclic Word Graphs, 8th Annual Symposium, CPM 97, Aarhus, Denmark, 116-129.
8. Huizinga J (1995). Homo Ludens, (Çev. MA. Kılıçbay), İstanbul: Ayrıntı Yayınları.

9. Jansen J A & Boekee D E (1990). On the significance of the directed acyclic word graph in cryptology, Advances in Cryptology — AUSCRYPT '90, Lecture Notes in Computer Science, 453, Springer-Verlag, pp. 318–326, doi:10.1007/BFb0030372, ISBN 3-540-53000-2.
10. Mitchell B L (2001). Game Design Essentials, Indianapolis: John Wiley & Sons, Inc.
11. Perrin D (1990). Finite Automata, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier, Amsterdam, Vol. A, 3-57.
12. Rouse R (2005). Game Design, Theory and Practice (Wordware Game Developer’s Library). USA: Worldware Publishing.
13. Su H, Zhao V (2011). Alive Character Design: For Games, Animation and Film, Beijing: CYPI Press.
14. Yılmaz E & Çağıltay K (2015). History of Digital Games in Turkey, Digra Uluslar Arası Konferansı.