A Novel Approach for Solving the N-Queen Problem Using a Non-Sequential Conflict Resolution Algorithm

The N-Queens problem is a fundamental challenge in combinatorial optimization, commonly used as a benchmark for assessing the efficiency of algorithms. Traditional algorithms, such as Backtracking with Forward Checking (BFC), constraint satisfaction problem (CSP) techniques, Lookahead algorithms, an...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Electronics (Basel) 2024-10, Vol.13 (20), p.4065
Hauptverfasser:	Moghimi, Omid, Amini, Amin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorial analysis Complexity Conflict management Conflict resolution Efficiency Heuristic methods Performance enhancement Performance evaluation Resource management Run time (computers)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!