A universal brute-force tower of hanoi solver
Project description
PyHanoi
This is a universal tower of hanoi solver, which can "theorotically" solve the problem for any number of rings and any number of towers.
This doesn't use k-peg or any other algorithm. this program just brute-forces until it finds smallest solution (that's why this is universal) and other than normal tower of hanoi problems, it works for a problem going from ANY state A to state B.
While the solution given should be correct - the time required to solve it increases exponentially, with more towers and rings.
Installation
soon will write a setup.py
.
for now just git clone this repo:
git clone https://github.com/pranavtaysheti/PyHanoi
cd PyHanoi
python -m pyhanoi
License
GNU General Public License v3.0 or later
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for pyhanoi_pt-0.2-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0e936608db03a0bd12b6a98053024dfb7c8f1a0cf1ffe8e656d143ac76f962d3 |
|
MD5 | 7ca19441f823abc2e1dc037fc35a08e9 |
|
BLAKE2b-256 | 6bbcab67bbf6a1054c2b24ec8e2ccb52bb9491ae7b7ded40568bc10f6bc0248b |