Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

8 queen problem

  • Difficulty Level : Medium
  • Last Updated : 03 Oct, 2018

The eight queens problem is the problem of placing eight queens on an 8×8 chessboard such that none of them attack one another (no two are in the same row, column, or diagonal). More generally, the n queens problem places n queens on an n×n chessboard.

There are different solutions for the problem.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Backtracking | Set 3 (N Queen Problem)

Branch and Bound | Set 5 (N Queen Problem)

You can find detailed solutions at http://en.literateprograms.org/Eight_queens_puzzle_(C)

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!