shubhambatra / chess-solution Public

Notifications You must be signed in to change notification settings
Fork 1
Star 0

The problem is to find all unique configurations of a set of normal chess pieces on a chess board with dimensions M×N where none of the pieces is in a position to take any of the others. Providing the number of results is useful, but not enough to complete the assignment. Assume the colour of the piece does not matter, and that there are no pawn…

0 stars 1 fork Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
src		src
.gitignore		.gitignore
README.md		README.md
index.js		index.js
package-lock.json		package-lock.json
package.json		package.json

Repository files navigation

chess-solution

dependency:

 node v7.10.0

####command:

    $ node --stack-size=50000 index.js

Output for

dimensions of the board: Width X Height
- Please Enter Width of chess board = 7
- Please Enter Height of chess board = 7
- Please Enter Numbers of kings = 2
- Please Enter Numbers of Queens = 2
- Please Enter Numbers of Bishops = 2
- Please Enter Numbers of Knight = 1
- Please Enter Numbers of Rook = 0
calculating time: 56607.328ms
all unique configuration is: 162092

About

The problem is to find all unique configurations of a set of normal chess pieces on a chess board with dimensions M×N where none of the pieces is in a position to take any of the others. Providing the number of results is useful, but not enough to complete the assignment. Assume the colour of the piece does not matter, and that there are no pawn…

Report repository

Releases

No releases published

Packages

No packages published

Languages

JavaScript 100.0%