January 10, 2025 |250.1K Views

N Queen Problem

Name: N Queen Problem
Uploaded: 2025-01-10T00:00:00+00:00
Duration: T19M18S
Description: We have discussed Knight’s tour and Rat in a Maze problems in Set 1 and

C++, Algorithms, backtracking

Share 1 Like

Description

Discussion

We have discussed Knight’s tour and Rat in a Maze problems in Set 1 and Set 2 respectively. Let us discuss N Queen as another example problem that can be solved using backtracking.

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example, following is a solution for 4 Queen problem.

N Queen Problem : https://www.geeksforgeeks.org/n-queen-problem-backtracking-3/

Recommendations