Algorithms 2012, 5(1), 18-29; doi:10.3390/a5010018
Article

How to Solve the Torus Puzzle

Received: 27 December 2011; in revised form: 30 December 2011 / Accepted: 30 December 2011 / Published: 13 January 2012
(This article belongs to the Special Issue Puzzle/Game Algorithms)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: In 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.
Keywords: torus puzzle; 15 puzzle
PDF Full-text Download PDF Full-Text [191 KB, uploaded 13 January 2012 09:58 CET]

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.

AMA 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(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.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert