An efficient algorithm for the Knight's tour problem

被引：33
作者：
Parberry, I
机构：
[1] Department of Computer Sciences, University of North Texas, Denton, TX 76203-6886
来源：
DISCRETE APPLIED MATHEMATICS | 1997年 / 73卷 / 03期
基金：
美国国家科学基金会;
关键词：
Number:; CCR-9302917; Acronym:; NSF; Sponsor: National Science Foundation; -; 9302917; CISE; Sponsor: Directorate for Computer and Information Science and Engineering; AFOSR; Sponsor: Air Force Office of Scientific Research; AFMC; Sponsor: Air Force Materiel Command; F49620-93-1~100; USAF; Sponsor: U.S. Air Force;
D O I：
10.1016/S0166-218X(96)00010-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
[No abstract available]
引用
收藏
页码：251 / 260
页数：10
相关论文
共 22 条
[1]  
[Anonymous], MATH GAMES PASTIMES
[2]   SOLUTION OF THE KNIGHTS HAMILTONIAN PATH PROBLEM ON CHESSBOARDS [J].
CONRAD, A ;
HINDRICHS, T ;
MORSY, H ;
WEGENER, I .
DISCRETE APPLIED MATHEMATICS, 1994, 50 (02) :125-134
[3]  
CONRAD A, 1992, SPEKTRUM WISSENSCHAF, P10
[4]  
CULL P, 1978, FIBONACCI QUART, V16, P276
[5]  
Dejter I.J., 1983, ARS COMBINATORIA, V16-B, P285
[6]  
Dudeney H.E, 1917, Amusements in Mathematics
[7]  
Dudeney HE., 1917, AMUSEMENTS MATH
[8]  
Euler L., 1959, MEM ACAD SCI BERLIN, P310
[9]  
GARDNER M, 1977, MATH MAGIC SHOW
[10]  
HURD SP, 1993, MATH MAG, V66, P159
123