A Proof on Conjecture of Knight-tour Problem

Home > Archive>Volume 21, Issue 5, 1998 >85-89

PDF HTML XML Export Cite reminder

A Proof on Conjecture of Knight-tour Problem
DOI:
                        
CSTR:
                        [cstr]
                    
Author:
                        
Affiliation:
Clc Number:O157.5
Fund Project:

Article

|

Figures

|

Metrics

|

Reference

|

Related

|

Cited by

|

Materials

|

Comments

Abstract:

对n×n棋盘上的骑士旅游问题进行了研究，证明了猜想：当n≥5且为偶数时，以任意点作为初始点都有解。

Reference

Related

Cited by

Get Citation

柏森,杨晓帆,柏林.骑士旅游问题一个猜想的证明[J].重庆大学学报,1998,21(5):85~89

Copy

Related Videos

Share

Article Metrics

Abstract:
PDF:
HTML:
Cited by:

History

Received:
Revised:
Adopted:
Online:
Published:

Article QR Code