https://github.com/pythonnut/mate_in_1_solver.py
:gem: A simple hacked-together python script to find chess positions with many simultaneous mates in 1
https://github.com/pythonnut/mate_in_1_solver.py
Last synced: about 1 month ago
JSON representation
:gem: A simple hacked-together python script to find chess positions with many simultaneous mates in 1
- Host: GitHub
- URL: https://github.com/pythonnut/mate_in_1_solver.py
- Owner: PythonNut
- Created: 2016-06-26T21:58:18.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2016-09-02T22:28:25.000Z (over 8 years ago)
- Last Synced: 2025-02-07T08:48:59.242Z (3 months ago)
- Language: Python
- Homepage:
- Size: 19.5 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Python Mate in 1 Solver
A algorithms written in python to solve [this question on chess.SE](https://chess.stackexchange.com/questions/14610/what-is-the-highest-number-of-different-mates-in-1-you-can-have-in-one-legal-p).
Two algorithms have been implemented:
* Genetic Algorithm
* Simulated Annealing
In this case, the Simulated Annealing program produced significantly better results than the Genetic Algorithm, but took weeks to run.
Depends on:
* [`python-chess`](https://pypi.python.org/pypi/python-chess)
* `matplotlib`
* `numpy`