jayeshchoudhari / N-queens

N-queens backtracking problem

N-Queens Problem

This work shows a demo of N-queens problem, which is an example of Backtracking problem.

Problem Statement

Given a N x N chess board, place N queens such that they do not attack each other.

This work implements the backtracking algorithm using javascript. The solutions for the particluar value of N can be seen on the chess board, displayed after every 3 seconds. The array of solutions can also be seen in the console.

Thanks