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.

Erum Naz, Khaled Al-Dabbas, Mahdi Abrishami, Lars Mehnen and Milan Cvetkovic , “Solving Word Tile Puzzle using Bee Colony Algorithm” International Journal of Advanced Computer Science and Applications(IJACSA), 7(11), 2016. http://dx.doi.org/10.14569/IJACSA.2016.071129

@article{Naz2016,
title = {Solving Word Tile Puzzle using Bee Colony Algorithm},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2016.071129},
url = {http://dx.doi.org/10.14569/IJACSA.2016.071129},
year = {2016},
publisher = {The Science and Information Organization},
volume = {7},
number = {11},
author = {Erum Naz and Khaled Al-Dabbas and Mahdi Abrishami and Lars Mehnen and Milan Cvetkovic }
}