Solving Word Tile Puzzle using Bee Colony Algorithm

Abstract

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.

15-Puzzle Problem Solving with the Artificial Bee Colony Algorithm Based on Pattern Database

“…However, the solutions of the 8-puzzle problem with the genetic algorithm have not sufficiently been researched, and the experimental results have not fully been revealed. A similar study to the N-puzzle problem was carried out by [Naz et al 2016]. In the study, the word tile puzzle was tried to be solved by moving a tile up, down, right, or left to find the maximum number of words using the Bee Colony Algorithm.…”