knight's tour
0 sources
knight's tour
Summary
knight's tour is a mathematical chess problem[1]. It draws 416 Wikipedia views per month (mathematical_chess_problem category, ranking #1 of 6).[2]
Key Facts
- knight's tour's video is recorded as Knight's tour anim 2.gif[3].
- knight's tour's image is recorded as Thomasson symmetric closed knights tour.svg[4].
- knight's tour's instance of is recorded as mathematical chess problem[5].
- knight's tour's subclass of is recorded as Hamiltonian path problem[6].
- knight's tour's subclass of is recorded as chess puzzle[7].
- knight's tour's subclass of is recorded as mathematical chess problem[8].
- knight's tour's Commons category is recorded as Knight's Tours[9].
- knight's tour's Freebase ID is recorded as /m/09lf2[10].
- knight's tour's OEIS ID is recorded as A001230[11].
- knight's tour's different from is recorded as Knight's tour[12].
- knight's tour's uses is recorded as knight's graph[13].
- knight's tour's studied by is recorded as graph theory[14].
- knight's tour's MathWorld ID is recorded as KnightsTour[15].
- knight's tour's Rosetta Code page ID is recorded as Knight's_tour[16].
- knight's tour's Dictionary of Algorithms and Data Structures ID is recorded as knightstour[17].
- knight's tour's maintained by WikiProject is recorded as WikiProject Mathematics[18].
- knight's tour's maintained by WikiProject is recorded as WikiProject Chess[19].
- knight's tour's Microsoft Academic ID is recorded as 76178041[20].
- knight's tour's ProofWiki ID is recorded as Definition:Knight's_Tour[21].
Why It Matters
knight's tour draws 416 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.[22]