N-Queens problem

Visualization of solving the N-Queens puzzle using recursive algorithm. The N-Queens puzzle is the problem of placing N chess queens on an N×N chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal.

Fill in the N in the input box (using alphanumeric keys) and run the algorithm.

Average rating: –

Please REGISTER or LOG IN, it's totally free! Registered users can
rate animations, add them among their favorites, and mark them as not working.

Source: https://www.cs.usfca.edu/~galles/visualization/RecQueens.html

<div style="padding:1px;background-color:#000;display:inline-block;"><iframe src="https://aa.ide.sk/DSV_en/RecQueens.html" scrolling="no" style="overflow:hidden; border:0px; width:1000px; height:640px;"></iframe><div style="background: #000;color:#999;font-size:12px;padding:3px;text-align:right;font-family:Arial,Helvetica,sans-serif">Source: <a href="https://www.cs.usfca.edu/~galles/visualization/RecQueens.html" target="_blank" style="color:#999;text-decoration:none">https://www.cs.usfca.edu/~galles/visualization/RecQueens.html</a></div></div>

Category:Backtracking

Technology:JavaScript animation

Programming language:Pseudocode

Interactivity:Medium

Please REGISTER or LOG IN, it's totally free! Only registered users can write reviews!

Algorithm Animations and Visualizations

N-Queens problem