N-Queens. Algorithm Analyses & Implementations. Vlad Furash & Steven Wine. Background. Problem surfaced in 1848 by chess player Max Bezzel as 8 queens (regulation board size) Premise is to place N queens on N x N board so that they are non-attacking
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Algorithm Analyses &
Vlad Furash & Steven Wine
*example of when to backtrack
due to looking ahead (row 7)
All possible solutions for N=5
Only 2 unique solutions for N=5
(notice transformations & reflections)
There are n(rows) + n(columns) + 4n – 2(diagonals) = 6n – 2 lines on N×N board.
Examples of lines