This repository contains the visualiazation of popular algorithmic problems : N-Queens using backtracking.

The n-queens puzzle is the problem of placing n queens on an n_×_n chessboard such that no two queens attack each other.

Given an integer n, visualise all distinct solutions using backtracking to the n-queens puzzle.

• Draw board and queens,
• Implement backtracking algo,
• Mark attacking positions,
• Add command line functionality to control number of queens, animation speed,
• Code Refactoring
• Build standalone executable.

1. C++
2. OpenGL

• Setup Codeblocks for OpenGL and Glut.
• Open nqueens.cbp.
• Build and run the project.

The program generates all the solutions to N queens problem with visualisation.

• N = 4 The total solutions for N = 4 queen is 2 _ | |
• N = 5