Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

How to solve the torus puzzle

From MaRDI portal
Publication:1736499
Jump to:navigation, search

DOI10.3390/A5010018zbMATH Open1461.91082OpenAlexW2114241734MaRDI QIDQ1736499FDOQ1736499


Authors: Kazuyuki Amano, Yuta Kojima, Toshiya Kurabayashi, Keita Kurihara, Masahiro Nakamura, Ayaka Omi, Toshiyuki Tanaka, Koichi Yamazaki Edit this on Wikidata


Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a5010018




Recommendations

  • Sliding puzzles and rotating puzzles on graphs
  • A mathematical analysis of the generalized oval track puzzle
  • A graph-theoretical approach to solving scramble squares puzzles
  • A simple proof that the \((n^{2} - 1)\)-puzzle is hard
  • TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable


zbMATH Keywords

15 puzzletorus puzzle


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Game theory (91A99)



Cited In (3)

  • A “simple” rectangular puzzle
  • Two remarks on torus Lights Out puzzle
  • Token shifting on graphs





This page was built for publication: How to solve the torus puzzle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736499)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1736499&oldid=14071925"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 06:44. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki