codrut51 / eightqueens Goto Github PK

A while back I heard of a problem about chess and it intrigued me. The problem states:

On a chess board (8 x 8) place 8 queens so that no two queens can attack each other. As a result, the computed solutions will require that any queen added on the board should not share a row, column, or diagonals with any other queen already positioned.

Additionally this problem can be scaled to any Natural Number n ( n != 2 && n != 3) where n (non-attacking) queens are placed on an n x n chessboard. (Optionally: A visual representation can be given of the possible arrangements )

I think someone out there can find an even better way to do this but I will choose a very popular approach to this problem.

In the command line/terminal run: ./gradlew build

In the command line/terminal run: java -jar build/libs/EightQueens-0.0.1.jar By playing with the program and inputting all kinds of numbers it will be noticed that a StackOverflow message will appear for any number (n > 9). To see all result for a number n > 9 the following command needs to be ran: java -jar -Xss1024m build/libs/EightQueens-0.0.1.jar <= This command increases the stack of the current java program to 1024mb. The -Xss attribute can have multiple values e.g.:
java -jar -Xss4m <path_to_jar>
java -jar -Xss8m <path_to_jar>
java -jar -Xss16m <path_to_jar>
java -jar -Xss32m <path_to_jar>
java -jar -Xss64m <path_to_jar>
java -jar -Xss128m <path_to_jar>
java -jar -Xss256m <path_to_jar>
java -jar -Xss512m <path_to_jar>
java -jar -Xss1024m <path_to_jar>

• Add main class
• Add backtracking class
• Add simple logic of backtracking class (all possible permutation for a number n)
• Improving logic for the problem at hand
• Create visual representation
• Build program and add documentation
  ** Optionally **:
  • Create API to compute visual representation of the created boards on a front-end.