Solving cross-matching puzzles using intelligent genetic algorithms


KESEMEN O., ÖZKUL E.

ARTIFICIAL INTELLIGENCE REVIEW, cilt.49, sa.2, ss.211-225, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 49 Sayı: 2
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1007/s10462-016-9522-6
  • Dergi Adı: ARTIFICIAL INTELLIGENCE REVIEW
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.211-225
  • Anahtar Kelimeler: Genetic algorithm, Depth first search, Cross-matching puzzle, Multi-layer genetic algorithm, Intelligent genetic algorithm, OPERATORS
  • Karadeniz Teknik Üniversitesi Adresli: Evet

Özet

Cross-matching puzzles are logic based games being played with numbers, letters or symbols that present combinational problems. A cross-matching puzzle consists of three tables: solution table, detection table, and control table. The puzzle can be solved by superposing the detection and control tables. For the solution of the cross-matching puzzle, a depth first search method can be used, but by expanding the size of the puzzle, computing time can be increased. Hence, the genetic algorithm, which is one of the most common optimization algorithms, was used to solve cross-matching puzzles. The multi-layer genetic algorithm was improved for the solution of cross-matching puzzles, but the results of the multi-layer genetic algorithm were not good enough because of the expanding size of the puzzle. Therefore, in this study, the genetic algorithm was improved in an intelligent way due to the structure of the puzzle. The obtained results showed that an intelligent genetic algorithm can be used to solve cross-matching puzzles.