- freely available
How to Solve the Torus Puzzle
AbstractIn this paper, we consider the following sliding puzzle called torus puzzle. In an m by n board, there are mn pieces numbered from 1 to mn. Initially, the pieces are placed in ascending order. Then they are scrambled by rotating the rows and columns without the player’s knowledge. The objective of the torus puzzle is to rearrange the pieces in ascending order by rotating the rows and columns. We provide a solution to this puzzle. In addition, we provide lower and upper bounds on the number of steps for solving the puzzle. Moreover, we consider a variant of the torus puzzle in which each piece is colored either black or white, and we present a hardness result for solving it.
Share & Cite This Article
Export to BibTeX | EndNote
MDPI and ACS Style
Amano, K.; Kojima, Y.; Kurabayashi, T.; Kurihara, K.; Nakamura, M.; Omi, A.; Tanaka, T.; Yamazaki, K. How to Solve the Torus Puzzle. Algorithms 2012, 5, 18-29.View more citation formats
Amano K, Kojima Y, Kurabayashi T, Kurihara K, Nakamura M, Omi A, Tanaka T, Yamazaki K. How to Solve the Torus Puzzle. Algorithms. 2012; 5(1):18-29.Chicago/Turabian Style
Amano, Kazuyuki; Kojima, Yuta; Kurabayashi, Toshiya; Kurihara, Keita; Nakamura, Masahiro; Omi, Ayaka; Tanaka, Toshiyuki; Yamazaki, Koichi. 2012. "How to Solve the Torus Puzzle." Algorithms 5, no. 1: 18-29.