proof that the towers of hanoi problem is solvable using the lean prover
mostly an exercise in wrangling with vectors lol. it is absolutely possible to do this way more elegantly. possibly using arrays instead of vectors.
-
Notifications
You must be signed in to change notification settings - Fork 1
marcusklaas/tower-of-hanoi
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
proof using the lean prover that the towers of hanoi problem is solvable
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published