An AI problem: knot-unknotting Chinese puzzle ring by the counting law of Gray code

摘要

This paper analyzes the knot-unknotting steps of Baguenaudier and its movement. With the law of the increase and decrease of the Gray code, the solution of Baguenaudier starting from any states was figured out.