New methods for using Cayley graphs in interconnection networks
Discrete Applied Mathematics - Special double volume: interconnection networks
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Reachability Programming in HOL98 Using BDDs
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
What the small Rubik’s cube taught me about data structures, information theory, and randomisation
International Journal on Software Tools for Technology Transfer (STTT)
Twenty-six moves suffice for Rubik's cube
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Primality proving with elliptic curves
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Extending coq with imperative features and its application to SAT verification
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Full reduction at full throttle
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
| Hi-index | 0.00 |
The Mini-Rubik is the 2x2x2 version of the famous Rubik's cube. How many moves are required to solve the 3x3x3 cube is still unknown. The Mini-Rubik, being simpler, is always solvable in a maximum of 11 moves. This is the result that is formalised in this paper. From this formalisation, a solver is also derived inside the Coqprover. This rather simple example illustrates how safe computation can be used to do state exploration in order to derive non-trivial properties inside a prover.