You cannot teach beginners top-down programming, because they do not know which end is up. C.A.R. Hoare

N-Queen Problem

Language Java | Level Intermediate | Category Algorithms | August 3, 2015 9:59 pm


Algorithm Problem Description

The eight queen’s puzzle is the problem of placing eight chess queens on an 8 x 8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal.

Backtracking eliminates or avoids the partial candidate solutions as soon as it finds that that path cannot lead to a solution. We are given 4 x 4 chessboard and we need to place 4 queens in non-attacking places on this board.

Output

          	        
          	        

Solution for 4 Queen Problem
* Q * * 
* * * Q 
Q * * * 
* * Q * 

* * Q * 
Q * * * 
* * * Q 
* Q * * 

          	        
          	        				    


Comments



Please login to add comments.