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.
Highlights
The prime inspiration to design any optimization algorithm is to simulate natural processes
Lots of algorithms have proved their inspiration from natural process such as simulated annealing (SA), genetic algorithms (GA) [1], ant colony optimization (ACO) [2], particle swarm optimization (PSO) and other Swarm Intelligences (SI) [3]
The purpose of this paper is to develop a slide tile game
Summary
The prime inspiration to design any optimization algorithm is to simulate natural processes. Lots of algorithms have proved their inspiration from natural process such as simulated annealing (SA), genetic algorithms (GA) [1], ant colony optimization (ACO) [2], particle swarm optimization (PSO) and other Swarm Intelligences (SI) [3]. Swarm Intelligence is based on the collective behaviour of individuals in various decentralized systems. These decentralized systems are composed of physical individuals that communicate, cooperate, collaborate, and exchange information and knowledge among themselves to perform some tasks in their environment [4]. An attempt has been made to solve the word tile puzzle problem for the most optimum solution by taking an inspiration from natural processes. By moving the tiles (up, down, right, left) a specific situation should be found, where the graph contains a maximum number of words (length 2 to n)
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
