Archive > Volume 21 Issue 5 > 1998,21(5):85-89 CSTR:[cstr] Prev Next

A Proof on Conjecture of Knight-tour Problem

Article
Figures
Metrics
Preview PDF
Reference
Related
Cited by
Materials

Abstract:

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

Keywords:

Project Supported:

Clc Number:

O157.5

More...

More...