Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2004.11.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2058686974
@@ Property / OpenAlex ID: W2058686974 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5784990
@@ Property / cites work: Q5784990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4055298
@@ Property / cites work: Q4055298 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of the knight's Hamiltonian path problem on chessboards
+Normal rank
@@ Property / cites work @@
+Q5724751
@@ Property / cites work: Q5724751 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knight's Tour on the 15-Puzzle
@@ Property / cites work: The Knight's Tour on the 15-Puzzle / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the Knight's tour problem
+Normal rank
@@ Property / cites work @@
+Q4881929
@@ Property / cites work: Q4881929 / rank @@
+Normal rank
@@ Property / cites work @@
+Which Rectangular Chessboards Have a Knight's Tour?
+Normal rank
@@ Property / cites work @@
+Q4297764
@@ Property / cites work: Q4297764 / rank @@
+Normal rank