DocumentCode
2294411
Title
An AI problem: knot-unknotting Chinese puzzle ring by the counting law of Gray code
Author
Li, Zhengsheng ; Ma, Wenyan
Author_Institution
Xi´´an High-Tech. Res. Inst., China
Volume
1
fYear
2000
fDate
2000
Firstpage
304
Abstract
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
Keywords
Gray codes; artificial intelligence; topology; AI problem; Baguenaudier; Gray code; counting law; knot-unknotting Chinese puzzle ring; Artificial intelligence; Counting circuits; Reflective binary codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on
Conference_Location
Hefei
Print_ISBN
0-7803-5995-X
Type
conf
DOI
10.1109/WCICA.2000.859971
Filename
859971
Link To Document