N Queen

The problem is to find all ways of placing n non-taking queens on a n by n board. A queen attacks all cells in its same row, column, and either diagonal. Therefore, the objective is to place n queens on an n by n board in such a way that no two queens are on the same row, column or diagonal. really i sloved this proplem using AI and i did the project in VB.net and C++ ..

meabed

Junior Poster

Team Colleague

139 posts since May 2004

Reputation Points: 55

Solved Threads: 3

This article has been dead for over three months