Skip to content

NQueen problem solution in JAVA using MIN_CONFLICT algorithm

Notifications You must be signed in to change notification settings

theNeo39/NQueen-MinC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

To slove the N-Queen problem using MIN_CONFLICT algorithm.

The program will take input for n=4 (i.e. size of chess board is n*n) and the start state configuration (i.e., where each queen is located on each column) interactively from the user. Output of your program will be the location of n queenson the chess board (one per column) such that no two queens attack each other.

Programming

1.JAVA

Releases

No releases published

Packages

No packages published

Languages