N Queen Problem 1.0

Submitted By: Pradeep
Rating:

(Rate It)

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.In screenshot we
show a solution on a standard 8 by 8 chessboard.

File Details

ZIP File Browser

NOTE: Some downloads must be obtained through publishers´s site.
Do you want to get your software listed on this site? Go to our submissions area.

Screenshot

Report Broken Link

Details

File Name:

27981.zip

Product homepage:

Unknown

Order page:

Unknown

Languages:

Unknown

Platforms:

Cell

Release date:

6/8/2003

License:

Unknown

Size:

81 KB

Price/Fee (US$):

Unknown

Number of downloads:

5497

Comments (2)

Fine Work Posted on Saturday, July 19, 2003

Not for everybody's use.

very helpful Posted on Wednesday, June 16, 2004

it helped me a lot

Add Your Rating

Name

(Not published)

Location

Subject

Comment

Home About PH Privacy Statement Contact Us Advertise Here

© 1996-2008 CommunityHeaven LLC. All rights reserved. Reproduction in whole or in part, in any form or medium without express written permission is prohibited.
Violators of this policy may be subject to legal action. Please read our Terms Of Use and Privacy Statement for more information.
North American business development: Nicolai Wadstrom. Publisher: Lars Hagelin.