Solving Word Tile Puzzle using Bee Colony Algorithm
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 11
Abstract
In this paper, an attempt has been made to solve the word tile puzzle with the help of Bee Colony Algorithm, in order to find maximum number of words by moving a tile up, down, right or left. Bee Colony Algorithm is a type of heuristic algorithms and is efficient and better than blind algorithms, in terms of running time and cost of search time. To examine the performance of the implemented algorithm, several experiments were performed with various combinations. The algorithm was evaluated with the help of statistical functions, such as average, maximum and minimum, for hundred and two-hundred iterations. Results show that an increasing number of agents can improve the average number of words found for both number of tested iterations. However, continuous increase in number of steps will not improve the results. Moreover, results of both iterations showed that the overall performance of the algorithm was not much improved by increasing the number of iterations.
Authors and Affiliations
Erum Naz, Khaled Al-Dabbas, Mahdi Abrishami, Lars Mehnen, Milan Cvetkovic
Keywords
Related Articles
- EP ID EP396953
- DOI 10.14569/IJACSA.2016.071129
- Views 72
- Downloads 0
An Empirical Study of the Applications of Data Mining Techniques in Higher Education
Few years ago, the information flow in education field was relatively simple and the application of technology was limited. However, as we progress into a more integrated world where technology has become an integral par...
An Ontology- and Constraint-based Approach for Dynamic Personalized Planning in Renal Disease Management
Healthcare service providers, including those involved in renal disease management, are concerned about the planning of their patients’ treatments. With efforts to automate the planning process, shortcomings are apparent...
Segmentation of Touching Arabic Characters in Handwritten Documents by Overlapping Set Theory and Contour Tracing
Segmentation of handwritten words into characters is one of the challenging problem in the field of OCR. In presence of touching characters, make this problem more difficult and challenging. There are many obstacles/chal...
3D Printing of Personalized Archwire Groove Model for Orthodontics: Design and Implementation
In traditional dental treatment, archwires are bent by orthodontists using standard methods. However, the standard models cater to patients with common oral problems, and are unsuitable for personalized orthodontic treat...
A Novel Reconfigurable MMIC Antenna with RF-MEMS Resonator for Radar Application at K and Ka Bands
This paper presents a new reconfigurable antenna based on coplanar waveguide (CPW). The design for reconfigurable antenna is based on monolithic microwave integrate circuit (MMIC). This scheme combines a CPW antenna and...