A simple proof that the $(n^{2} - 1)$-puzzle is hard (Q1637231): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2018.04.031
@@ Property / DOI: 10.1016/j.tcs.2018.04.031 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2735814871
@@ Property / OpenAlex ID: W2735814871 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03146
@@ Property / arXiv ID: 1707.03146 / rank @@
+Normal rank
@@ Property / cites work @@
+The \((n^ 2-1)\)-puzzle and related relocation problems
+Normal rank
@@ Property / cites work @@
+The parallel search bench ZRAM and its applications
+Normal rank
@@ Property / cites work @@
+A Modern Treatment of the 15 Puzzle
@@ Property / cites work: A Modern Treatment of the 15 Puzzle / rank @@
+Normal rank
@@ Property / cites work @@
+Q4827118
@@ Property / cites work: Q4827118 / rank @@
+Normal rank
@@ Property / cites work @@
+Swapping labeled tokens on graphs
@@ Property / cites work: Swapping labeled tokens on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+On Steiner’s Problem with Rectilinear Distance
@@ Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank @@
+Normal rank
@@ Property / cites work @@
+A real-time algorithm for the \((n^{2}-1)\)-puzzle
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2018.04.031
@@ Property / DOI: 10.1016/J.TCS.2018.04.031 / rank @@
+Normal rank

A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231): Difference between revisions

Latest revision as of 23:56, 10 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)