What question did this study set out to answer?

This research aims to improve the efficiency of the N-Queens problem by integrating knight-move avoidance as a constraint.

March 2, 20260 citationsOpen Access

A Modified N-Queens Algorithm Using Knight-Move Constraints

View Full Paper

PDPrakhar Dwivedi

Key Points

This research aims to improve the efficiency of the N-Queens problem by integrating knight-move avoidance as a constraint.
Developed a hybrid backtracking algorithm with knight-move constraints.
Incorporated selective relaxation of these constraints.
Compared performance against classical and bitmask backtracking methods.
Achieved significant runtime improvements over traditional approaches.
Demonstrated effectiveness particularly for larger board sizes.

Abstract

This paper presents a hybrid backtracking algorithm for the N-Queens problem that incorporates knight-move avoidance as a soft constraint with selective relaxation. The proposed method achieves significant runtime improvements over classical and bitmask backtracking approaches, particularly for larger board sizes.

Demander à l'IA

Bookmark

View Full Paper

Cite This Study

Prakhar Dwivedi (Sat,) studied this question.

synapsesocial.com/papers/69a52e04f1e85e5c73bf1576 https://doi.org/https://doi.org/10.5281/zenodo.18814739

Demander à l'IA

Bookmark

View Full Paper

A Modified N-Queens Algorithm Using Knight-Move Constraints

Key Points

Abstract

Cite This Study

Also Consider

Also Consider