Solving Word Tile Puzzle using Bee Colony Algorithm

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

WQbZS: Wavelet Quantization by Z-Scores for JPEG2000

In this document we present a methodology to quantize wavelet coefficients for any wavelet-base entropy coder, we apply it in the particular case of JPEG2000. Any compression system have three main steps: Transformation...

El Niño / La Niña Identification based on Takens Reconstruction Theory

An identification method for earth observation data according to a chaotic behavior based on Takens reconstruction theory is proposed. The proposed method is examined by using the observed time series data of SST (Sea Su...

Reliability and Connectivity Analysis of Vehicluar Ad Hoc Networks for a Highway Tunnel

Vehicular ad-hoc network (VANET) uses ‘mobile internet’ to facilitate the communication between vehicles and with the goal to ensure road safety and achieve secure communication. Thus the reliability of this type of netw...

Modified Graph-theoretic Clustering Algorithm for Mining International Linkages of Philippine Higher Education Institutions

Graph-theoretic clustering either uses limited neighborhood or construction of a minimum spanning tree to aid the clustering process. The latter is challenged by the need to identify and consequently eliminate inconsiste...

Firefly Algorithm for Adaptive Emergency Evacuation Center Management

Flood disaster is among the most devastating natural disasters in the world, claiming more lives and causing property damage. The pattern of floods across all continents has been changing, becoming more frequent, intense...

Download PDF file
  • EP ID EP396953
  • DOI 10.14569/IJACSA.2016.071129
  • Views 101
  • Downloads 0

How To Cite

Erum Naz, Khaled Al-Dabbas, Mahdi Abrishami, Lars Mehnen, Milan Cvetkovic (2016). Solving Word Tile Puzzle using Bee Colony Algorithm. International Journal of Advanced Computer Science & Applications, 7(11), 229-234. https://europub.co.uk/articles/-A-396953