Hostname: page-component-77c89778f8-m8s7h Total loading time: 0 Render date: 2024-07-18T18:59:35.287Z Has data issue: false hasContentIssue false

The Chinese Ring puzzle, the Crazy Elephant Dance puzzle, the b-Spinout puzzle, and Gray codes

Published online by Cambridge University Press:  21 October 2019

Curtis Cooper*
School of CS & Math., University of Central Missouri, Warrensburg, MO 64093USA e-mail:


The Chinese Ring puzzle consists of a long loop with a handle on one end and nine rings entwined on the loop (see Figure 1).

© Mathematical Association 2019 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)


Saqiurila, Jenny, How to solve the Chinese ring puzzle (2016), available at Scholar
Knuth, D. E., Generating all n-tuples, The art of computer programming, Volume 4A: Enumeration and Backtracking, prefascicle 2a, Google Scholar
Sloane, N. J. A., The on-line encyclopedia of integer sequences (2018), available at Google Scholar
John the Geometer, Spin Out solution (2010), available at Google Scholar
Lamphere, R. L., A recurrence relation in the Spinout puzzle, College Mathematics Journal 27 (4) (1996) pp. 286289.CrossRefGoogle Scholar
Merrill, L., Van, T. and Cull, P., A tale of two puzzles, Proceedings of REU in Mathematics at Oregon State (2010) pp. 101147.Google Scholar, Crazy Elephant Dance, accessed April 2019 at Google Scholar
Kastellorizo, Crazy Elephant Dance puzzle (2015), available at Google Scholar
Götz, H., Crazy Elephant Dance in Homage to a Pied Puzzler, (eds. E. Pegg Jr., A. H. Schoen and T. Todgers), A. K. Peters (2008) pp. 165174.Google Scholar
Gray, F., Pulse Code Communication, United States Patent Number 2632058, March 17, 1953.Google Scholar
Nijenhuis, A. and Wilf, H., Combinatorial Algorithms for Computers and Calculators (2nd edn.), Academic Press, New York (1978).Google Scholar