knight's tour
0 sources
knight's tour
Summary
knight's tour is a mathematical chess problem[1]. It draws 3,957 Wikipedia views per month (mathematical_chess_problem category, ranking #1 of 6).[2]
Key Facts
- knight's tour's instance of is recorded as mathematical chess problem[3].
- knight's tour is a type of Hamiltonian path problem[4].
- knight's tour is a type of chess puzzle[5].
- knight's tour is a type of mathematical chess problem[6].
- knight's tour's Commons category is recorded as Knight's Tours[7].
- knight's tour's different from is recorded as Knight's tour[8].
- knight's tour's uses is recorded as knight's graph[9].
- knight's tour's studied by is recorded as graph theory[10].
- knight's tour's maintained by WikiProject is recorded as WikiProject Mathematics[11].
- knight's tour's maintained by WikiProject is recorded as WikiProject Chess[12].
Body
Definition and Type
knight's tour's instance of is recorded as mathematical chess problem[3]. Recorded subclass of include Hamiltonian path problem[4], chess puzzle[5], and mathematical chess problem[6].
Why It Matters
knight's tour draws 3,957 Wikipedia views per month (mathematical_chess_problem category, ranking #1 of 6).[2] It has Wikipedia articles in 25 language editions, a strong signal of global cultural recognition.[13] It is known by 27 alternative names across languages and contexts.[14]