Proving the existence of Euclidean knight's tours on n×n×...×n chessboards for n<4
The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present, we provide a 5-dimensional alternative to the well-known statement that it is not ever possible for a...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
"Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences
2024-02-01
|
| Серии: | Notes on Number Theory and Discrete Mathematics |
| Предметы: | |
| Online-ссылка: | https://nntdm.net/papers/nntdm-30/NNTDM-30-1-020-033.pdf |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|