SOLUTION OF THE KNIGHTS HAMILTONIAN PATH PROBLEM ON CHESSBOARDS

被引：21

作者：

CONRAD, A ^{[1
]}

HINDRICHS, T ^{[1
]}

MORSY, H ^{[1
]}

WEGENER, I ^{[1
]}

机构：

[1] UNIV DORTMUND,FACHBEREICH INFORMAT,LS 2,POSTFACH 500500,W-4600 DORTMUND 50,GERMANY

来源：

DISCRETE APPLIED MATHEMATICS | 1994年 / 50卷 / 02期

关键词：

D O I：

10.1016/0166-218X(92)00170-Q

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Is it possible for a knight to visit all squares of an n x n chessboard on an admissible path exactly once? The answer is yes ff and only if n greater-than-or-equal-to 5. The kth position in such a path can be computed with a constant number of arithmetic operations. A Hamiltonian path from a given source s to a given terminal t exists for n greater-than-or-equal-to 6 if and only if some easily testable color criterion is fulfilled. Hamiltonian circuits exist if and only if n greater-than-or-equal-to 6 and n is even.

引用

页码：125 / 134

页数：10

共 50 条

[31] Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
Prohaska, Sonja J.
Berkemer, Sarah J.
Gaertner, Fabian
Gatter, Thomas
Retzlaff, Nancy
zu Siederdissen, Christian Hoener
Stadler, Peter F.
JOURNAL OF MATHEMATICAL BIOLOGY, 2018, 77 (02) : 313 - 341
[32] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE FOR BIPARTITE GRAPHS
LAI, TH
WEI, SS
INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 21 - 26
[33] Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
Monnot, J
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (03) : 721 - 735
[34] Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
Sonja J. Prohaska
Sarah J. Berkemer
Fabian Gärtner
Thomas Gatter
Nancy Retzlaff
Christian Höner zu Siederdissen
Peter F. Stadler
Journal of Mathematical Biology, 2018, 77 : 313 - 341
[35] PATH INTEGRAL FOR A WEYL QUANTIZED RELATIVISTIC HAMILTONIAN AND THE NONRELATIVISTIC LIMIT PROBLEM
ICHINOSE, T
LECTURE NOTES IN MATHEMATICS, 1987, 1285 : 205 - 210
[36] A METHOD FOR THE SOLUTION OF THE NTH BEST PATH PROBLEM
HOFFMAN, W
PAVLEY, R
JOURNAL OF THE ACM, 1959, 6 (04) : 506 - 514
[37] On the Solution of the Path Following Problem for the PVTOL Aircraft
Consolini, L.
Maggiore, M.
Tosques, M.
Nielsen, C.
2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, : 3051 - +
[38] THE PROBLEM OF STRUCTURE IN THE KNIGHTS OF LABOR
Birdsall, William C.
INDUSTRIAL & LABOR RELATIONS REVIEW, 1953, 6 (04): : 532 - 546
[39] Balanced Black and White Coloring Problem on Knight's Chessboards
Urban-Rivero, Luis E.
Ramirez-Rodriguez, Javier
Lopez-Bracho, Rafael
2018 15TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE), 2018,
[40] ON THE MINIMAL PERIOD FOR PERIODIC SOLUTION PROBLEM OF NONLINEAR HAMILTONIAN SYSTEMS
LONG YIMING 
ChineseAnnalsofMathematics, 1997, (04) : 77 - 80

← 1 2 3 4 5 →