N-Queens Problem — Study Resources & PYQs

N-Queens problem

Estimated study time: 60 minutes

Study resources

N-Queens Problem (Article) — Classic N-Queens problem solved with backtracking: place N queens on NxN board with no conflicts.

N-Queens Problem previous year questions

(a) Define Travelling Salesman Problem (TSP). Explain the basic steps that are to be followed to solve TSP using branch and bound. Illustrate with an example.…

Taught in these subjects

Analysis & Design of Algorithms — CST-3501 · Government College of Engineering and Technology, Jammu

Open on CachedInfo