Code Pumpkin

Tag Archives: Chess

N Queen Problem Using Recursive Backtracking

April 1, 2017
Posted by Abhi Andhariya

N Queen Problem is the problem of placing N chess queens on an NxN chessboard so that no two queens attack each other, for which solutions exist for all natural numbers n except n=2 and n=3. A solution requires that no two queens share the same row, column, or diagonal. It is more general form of inital Eight queens problem, where we need to […]

Total Posts : 124
follow us in feedly

Like Us On Facebook