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

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