Skip to content

Program 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. The colour of the piece does not matter, and there are no pawns among the pieces.

Notifications You must be signed in to change notification settings

narayana-glassbeam/scalac-chess-problem

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

scalac-chess-problem

Program 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. Assume the colour of the piece does not matter, and that there are no pawns among the pieces.

To build and run the code:

$ sbt run

If run as is, program will provide solution for 7×7 board with 2 Kings, 2 Queens, 2 Bishops and 1 Knight.

If you want provide your own board size and composition of pieces, then it is required to redefine board size here and composition of pieces here

About

Program 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. The colour of the piece does not matter, and there are no pawns among the pieces.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Scala 100.0%