Proving the existence of Euclidean knight's tours on $n \times n \times \cdots \times n$ chessboards for $n < 4$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Description not available. |