The towers of Hanoi problem with parallel moves

1992 ◽  
Vol 44 (5) ◽  
pp. 241-243 ◽  
Author(s):  
Jer-Shyan Wu ◽  
Rong-Jaye Chen
Keyword(s):  
1998 ◽  
Vol 57 (3) ◽  
pp. 367-376 ◽  
Author(s):  
Chi-Kwong Li ◽  
Ingrid Nelson

We characterise all the perfect k-error correcting codes that can be defined on the graph associated with the Towers of Hanoi puzzle. In particular, a short proof for the existence of 1-error correcting code on such a graph is given.


Author(s):  
G. C. Morris
Keyword(s):  

2011 ◽  
Vol E94-D (2) ◽  
pp. 240-242
Author(s):  
Yu-Kumg CHEN ◽  
Chen-An FANG ◽  
Fan-Chieh CHENG

1989 ◽  
Vol 10 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Steven Minsker
Keyword(s):  

2012 ◽  
Vol 33 (7) ◽  
pp. 1691-1707 ◽  
Author(s):  
Zoran Šunić
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document