Word Search Puzzle using Multi-Linked Lists
Shivam Haresh Kumar Patel1, A. Jackulin Mahariba2
1Shivam Haresh Kumar Patel, UG Student, Department of Computer Science and Engineering, SRM Institute of Science and Technology, Kattankulathur, Chennai (Tamil Nadu), India.
2A. Jackulin Mahariba, Assistant Professor Senior Grade, Department of Computer Science and Engineering, SRM Institute of Science and Technology, Kattankulathur, Chennai (Tamil Nadu), India.
Manuscript received on 18 July 2019 | Revised Manuscript received on 25 July 2019 | Manuscript Published on 01 August 2019 | PP: 12-18 | Volume-8 Issue-4S2, April 2019 | Retrieval Number: D10050484S219/19©BEIESP | DOI: 10.35940/ijeat.D1005.0484S219
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Word Search Puzzle is a game in which a player is supposed to find words in the given grid of characters, by unveiling the clues stated for those words. This paper presentsthe creation of the grid of characters in the Word Search Puzzle using multi-linked list data structure. The primary motivation to create this game using multi-linked list data structure was the efficiency of a linked list to handle data – insertion and deletion of an element to the list. The model which was created using a multi-linked list as described in this paper will now be referred to as Model A, for better understanding. The construction of Model A is described as a 5-step process with the help of algorithms. The time complexities to create the grid for Model A and to access data from it were analyzed and found to be much better than the other existing models in the market.
Keywords: Multi-Linked List, Word Search Puzzle, Data Structure, Algorithm.
Scope of the Article: Data Mining and Warehousing