Journals / Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi / 2021 / Cilt: 8 - Sayı: 15

UNSUPERVISED MACHINE LEARNING ALGORITHM TO SOLVE KNIGHT COVERING PROBLEM FOR 6 BY 6 BOARD

6'YA 6 TAHTA ÜZERİNDE AT KAPLAMA PROBLEMİNİ ÇÖZMEK İÇİN DENETİMSİZ MAKİNE ÖĞRENME ALGORİTMASI

Pages
414–426
Publication Date
2022-10-12
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Lastly, the modularity method extracts the solutions from 61, for resolution 0.5, to 195, for resolution 0.2, out of 2253 solutions.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Modularity is a well-known method as a machine-learning algorithm to extract information from graphs.
📊
Key Findings & Data:In the present study, we analyze the 6×6 knight graph by modularity method to obtain 6 Knight Covering Problem (6-KCP) solutions.
💡
Conclusion & Impact:Lastly, the modularity method extracts the solutions from 61, for resolution 0.5, to 195, for resolution 0.2, out of 2253 solutions.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Modularity is a well-known method as a machine-learning algorithm to extract information from graphs. The modularity, in essence, divides the considered network into smaller clusters. The extracted clusters highlight the shared properties between the nodes in the same cluster. In the present study, we analyze the 6×6 knight graph by modularity method to obtain 6 Knight Covering Problem (6-KCP) solutions. Our investigation is ranged for the resolutions from 0.1 to 2.0. The maximum modularity score is 0.318 found for resolution 1.2. The resolutions, namely 0.3 and 0.4, identified all solutions, by 8 knights. Moreover, some solutions are obtained by 8 knights for the resolutions 0.2 and by 9, 10, 11, 12, 13 knights for the resolutions 0.2, 0.3, and 0.4. Moreover, resolution 0.3 is the most efficient resolution to find 6-KCP solutions. Also, within our analysis, resolution 0.2 is the best resolution to find more solutions, 195 solutions of 6-KCP. Lastly, the modularity method extracts the solutions from 61, for resolution 0.5, to 195, for resolution 0.2, out of 2253 solutions.

Özet

Modülerlik, çizgelerden bilgi çıkarmak için, çok kullanılan bir makine öğrenimi algoritmasıdır. Modülerlik, özünde, ele alınan ağı daha küçük kümelere böler. Oluşturulan kümeler, aynı kümedeki düğümler arasındaki paylaşılan özellikleri vurgular. Bu çalışmada 6×6 at çizgesini modülerlik yöntemiyle analiz ederek 6 At Kaplama Probleminin (6-AKP) çözümlerini elde ettik. Araştırmamız 0,1 ile 2,0 arasındaki çözünürlükler için değişmektedir. Çözünürlük 1,2 için bulunan maksimum modülerlik puanı 0,318'dir. 0,3 ve 0,4 olmak üzere çözünürlükler, tüm çözümleri 8 at ile tanımladı. Ayrıca, 0,2 çözünürlükler için 8 at ve 0,2, 0,3 ve 0,4 çözünürlükler için 9, 10, 11, 12, 13 at ile bazı çözümler elde edilmektedir. Ayrıca, çözünürlük 0,3, 6-AKP çözümlerini bulmak için en verimli çözünürlüktür. Ayrıca, analizlerimiz gösterdi ki 0,2 çözünürlüğü, 6-AKP'nin 195 çözümünü daha fazla çözüm bulmak için en iyi çözünürlüktür. Son olarak, modülerlik yöntemi, 2253 çözüm arasından 0,5 çözünürlük için 61'den, 0,2 çözünürlük için 195'e kadar olan çözümleri çıkarıyor.

🔖

Cite This Article

Güldal, S. (2022). UNSUPERVISED MACHINE LEARNING ALGORITHM TO SOLVE KNIGHT COVERING PROBLEM FOR 6 BY 6 BOARD. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi, Cilt: 8 - Sayı: 15, 414–426. https://ajindex.com/articles/428582

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (14)

  1. S. Bai, G. Zhu, and J. Huang, "An Intelligent Algorithm for the (1,2,2)-Generalized Knight's Tour Problem," in 2013 Ninth International Conference on Computational Intelligence and Security, 14-15 Dec. 2013 2013, pp. 583-588, doi: 10.1109/CIS.2013.129
  2. H. Jian and B. Sen, "An Efficient Algorithm for the Generalized (1,k)-Knight's Tours Problem," in 2009 First International Workshop on Education Technology and Computer Science, 7-8 March 2009 2009, vol. 1, pp. 697-701, doi: 10.1109/ETCS.2009.161
  3. P. Hingston and G. Kendall, Ant Colonies Discover Knight's Tours. 2004, pp. 1213-1218
  4. S. Bai, X. Liao, X. Qu, and Y. Liu, "Generalized Knight's Tour Problem and Its Solutions Algorithm," in 2006 International Conference on Computational Intelligence and Security, 3- 6 Nov. 2006 2006, vol. 1, pp. 570-573, doi: 10.1109/ICCIAS.2006.294200
  5. I. Parberry, "An Efficient Algorithm for the Knight's Tour Problem," Discrete Applied Mathematics, vol. 73, pp. 251-260, 03/01 1997, doi: 10.1016/S0166-218X(96)00010-8
  6. J. Demaio and B. Mathew, "Which Chessboards have a Closed Knight's Tour within the Rectangular Prism?," Electr. J. Comb., vol. 18, 01/05 2011, doi: 10.37236/495
  7. A. Kumar, "Non-crossing Knight's Tour in 3-Dimension," 03/29 2008
  8. P. Aliquippa and Pennsylvania, "Thematic Knight's Tour Quotes " 06/29 2020
  9. A. Philip, "A Generalized Pseudo-Knight?s Tour Algorithm for Encryption of an Image," IEEE Potentials, vol. 32, no. 6, pp. 10-16, 2013, doi: 10.1109/MPOT.2012.2219651
  10. J. Kumar and S. Nirmala, "Securing the contents of document images using knight moves and genetic approach," in 2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 10-13 Aug. 2015 2015, pp. 1091-1095, doi: 10.1109/ICACCI.2015.7275755
  11. J. Delei, B. Sen, and D. Wenming, "An Image Encryption Algorithm Based on Knight's Tour and Slip Encryption-Filter," in 2008 International Conference on Computer Science and Software Engineering, 12-14 Dec. 2008 2008, vol. 1, pp. 251-255, doi: 10.1109/CSSE.2008.1142
  12. M. Singh, A. Kakkar, and M. Singh, "Image Encryption Scheme Based on Knight's Tour Problem," Procedia Computer Science, vol. 70, pp. 245-250, 12/31 2015, doi: 10.1016/j.procs.2015.10.081
  13. Q. B. Hou, X. F. Yang, Y. S. Wang, and X. S. Huang, "An image scrambling algorithm based on wavelet transform and Knight's tour," vol. 41, pp. 369-375, 02/01 2004
  14. D. C. Fisher, "On the n x n Knight Cover Problem," Ars C