رویکردی نوین برای حل مسئله N-Queen با استفاده از الگوریتم حل تعارض غیرترتیبی

Sure! Here’s the description of the N-Queens problem using the Non-Sequential Conflict Resolution (NSCR) algorithm reyhanekornokar ۱, Ali Dehghanchaharabi ۲ ۱,۲- Computer Engineering, University Professor, Khorramabad National College of Skills for Women rk.it۱۳۹۰@gmail.com The N-Queens problem is a prominent challenge in combinatorial optimization and artificial intelligence, often used as a benchmark for evaluating the performance of problem-solving algorithms. Traditional methods, such as Backtracking with Forward Checking (BFC), Constraint Satisfaction Techniques (CSP), look-ahead algorithms, and heuristic-based approaches, face limitations in solving large-scale instances due to exponential time complexity, restricting their practical applications. In this paper, a novel algorithm called Non-Sequential Conflict Resolution

کلیدواژه ها:

مسئله N-Queens ، حل تعارض غیرترتیبی ، بهینه سازی ترکیبی ، الگوریتم های عقب گرد ، پیچیدگی فضایی بهینه ، حل تعارض پویا