Malatya Centrality Algorithm and Graph Colouring Based Effective and Efficient Eight Queen Problem Solution Method

Basit Öğe Kaydı
dc.contributor.authorKaragöz, Erkan
dc.contributor.authorYakut, Selman
dc.date.accessioned2026-04-04T13:18:59Z
dc.date.available2026-04-04T13:18:59Z
dc.date.issued2025
dc.departmentİnönü Üniversitesi
dc.description9th International Artificial Intelligence and Data Processing Symposium, IDAP 2025 -- 6 September 2025 through 7 September 2025 -- Malatya -- 215321
dc.description.abstractThe eight queens problem, a classic constraint satisfaction problem in computer science, is a combinatorial problem that has been studied since the 19th century with applications to algorithm development, mathematical thinking and artificial intelligence. Briefly, the problem is to place eight queens on a chessboard in such a way that they do not threaten each other. Until today, the problem has been addressed with heuristic or brute force algorithms and now with artificial intelligence applications. Since the NP-Hard nature of the problem requires a large number of combinations to be tried, it is important to produce efficient algorithms. In this paper, we propose a method that solves the problem based on graph theory and centrality calculus. Firstly, each box on the chessboard is defined as a node. Considering the constraints of the problem, edge connections are established between these nodes and modelled as a graph. On this graph structure, the centrality calculations of the nodes were made with the Malatya Centrality algorithm. Then, starting from the node with the highest centrality value. The queens (colours) were placed in a regular way. As an alternative to classical methods, this method offers a perspective based on graph theory and graph colouring and creates a more systematic approach to queen placement. © 2025 IEEE.
dc.identifier.doi10.1109/IDAP68205.2025.11222204
dc.identifier.isbn979-833158990-5
dc.identifier.scopus2-s2.0-105025013836
dc.identifier.scopusqualityN/A
dc.identifier.urihttps://doi.org/10.1109/IDAP68205.2025.11222204
dc.identifier.urihttps://hdl.handle.net/11616/108068
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.ispartof9th International Artificial Intelligence and Data Processing Symposium, IDAP 2025
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_Scopus_20250329
dc.subjectEight queen problem
dc.subjectGraph colouring
dc.subjectMalatya centrality algorithm
dc.subjectNP-Hard problems
dc.titleMalatya Centrality Algorithm and Graph Colouring Based Effective and Efficient Eight Queen Problem Solution Method
dc.typeConference Object

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu