The n queen problem and backtracking algorithm to solve n queen problem.
To place n queens on a nXn chessboard so that no two “attack”, ie no two of them are on the same row, column or diagonal.
If you want to understand the basics see the following video
• Solving 4 queen problem using backtracking
To know more join my Udemy course on Design and Analysis of Algorithm
https://www.udemy.com/course/algorith...