Octachron/Rubik_gadts
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
The art of computing lower bound on the god number of the rubik's cube with OCaml typechecker.
6 commits 1 branch 0 tags 33 KiB
  • OCaml 99.4%
  • Makefile 0.6%
Find a file
Exact
octachron 5906e6e369 comments and names
2018-06-05 00:28:16 +02:00
gen comments and names 2018-06-05 00:28:16 +02:00
src comments and names 2018-06-05 00:28:16 +02:00
.gitignore Rubik's God number proof 2018-06-02 13:23:07 +02:00
Makefile Readme and increased computation time 2018-06-02 13:55:39 +02:00
README.md Readme and increased computation time 2018-06-02 13:55:39 +02:00

README.md

A naive computation of the lower bound of the God number of the rubik's cube, using GADTs and the OCaml typecheker. Or how to write a three lines function that takes hours to type-check.