https://github.com/catap/scalac-chess-problem
https://github.com/catap/scalac-chess-problem
Last synced: about 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/catap/scalac-chess-problem
- Owner: catap
- Created: 2014-12-24T05:36:18.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2015-01-16T12:04:49.000Z (over 11 years ago)
- Last Synced: 2025-01-17T12:56:57.226Z (over 1 year ago)
- Language: Scala
- Size: 242 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# scalac-chess-problem
This prue functional scala application found all unique chess board where no one piece don't threaten to any another peaces.
For run use `sbt run`
Example output:
```
Solving the problem: 7×7 board with 2 Kings, 2 Queens, 2 Bishops and 1 Knight
Ok, done.
Elapsed time 0 min, 1 sec, 697 millis (total 1697 millis)
I have 3063828 solutions. No more 3 of them follow:
♘**-***
--*--**
-*****♗
*-*****
*****♕*
**♕****
♗***♔*♔
-**♘***
-**--**
--****♗
*-*****
*****♕*
**♕****
♗***♔*♔
-**-***
♘-*--**
--****♗
*******
*****♕*
**♕****
♗***♔*♔
```