Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Knight's_tour> ?p ?o }
Showing triples 1 to 63 of
63
with 100 triples per page.
- Knight's_tour abstract "A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open. The exact number of open tours on an 8x8 chessboard is still unknown.The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer science students. Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards.".
- Knight's_tour thumbnail Knight's_tour_anim_2.gif?width=300.
- Knight's_tour wikiPageID "38501".
- Knight's_tour wikiPageRevisionID "603787477".
- Knight's_tour hasPhotoCollection Knight's_tour.
- Knight's_tour subject Category:Chess_problems.
- Knight's_tour subject Category:Graph_algorithms.
- Knight's_tour subject Category:Hamiltonian_paths_and_cycles.
- Knight's_tour subject Category:Mathematical_chess_problems.
- Knight's_tour subject Category:Mathematical_problems.
- Knight's_tour type Abstraction100002137.
- Knight's_tour type Act100030358.
- Knight's_tour type Action100037396.
- Knight's_tour type Activity100407535.
- Knight's_tour type Algorithm105847438.
- Knight's_tour type Attribute100024264.
- Knight's_tour type ChessProblems.
- Knight's_tour type Condition113920835.
- Knight's_tour type Course100038262.
- Knight's_tour type Difficulty114408086.
- Knight's_tour type Event100029378.
- Knight's_tour type GraphAlgorithms.
- Knight's_tour type HamiltonianPathsAndCycles.
- Knight's_tour type MathematicalChessProblems.
- Knight's_tour type MathematicalProblems.
- Knight's_tour type Problem114410605.
- Knight's_tour type Procedure101023820.
- Knight's_tour type PsychologicalFeature100023100.
- Knight's_tour type Rule105846932.
- Knight's_tour type State100024720.
- Knight's_tour type Way100415676.
- Knight's_tour type YagoPermanentlyLocatedEntity.
- Knight's_tour comment "A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open. The exact number of open tours on an 8x8 chessboard is still unknown.The knight's tour problem is the mathematical problem of finding a knight's tour.".
- Knight's_tour label "Knight's tour".
- Knight's_tour label "Paardensprong".
- Knight's_tour label "Percorso del cavallo".
- Knight's_tour label "Problem skoczka szachowego".
- Knight's_tour label "Problema del caballo".
- Knight's_tour label "Problema do cavalo".
- Knight's_tour label "Problème du cavalier".
- Knight's_tour label "Springerproblem".
- Knight's_tour label "Задача о ходе коня".
- Knight's_tour label "مسألة الحصان".
- Knight's_tour label "ナイト・ツアー".
- Knight's_tour label "騎士巡邏".
- Knight's_tour sameAs Jezdcova_procházka.
- Knight's_tour sameAs Springerproblem.
- Knight's_tour sameAs Problema_del_caballo.
- Knight's_tour sameAs Problème_du_cavalier.
- Knight's_tour sameAs Perjalanan_kuda.
- Knight's_tour sameAs Percorso_del_cavallo.
- Knight's_tour sameAs ナイト・ツアー.
- Knight's_tour sameAs 기사의_여행.
- Knight's_tour sameAs Paardensprong.
- Knight's_tour sameAs Problem_skoczka_szachowego.
- Knight's_tour sameAs Problema_do_cavalo.
- Knight's_tour sameAs m.09lf2.
- Knight's_tour sameAs Q12524.
- Knight's_tour sameAs Q12524.
- Knight's_tour sameAs Knight's_tour.
- Knight's_tour wasDerivedFrom Knight's_tour?oldid=603787477.
- Knight's_tour depiction Knight's_tour_anim_2.gif.
- Knight's_tour isPrimaryTopicOf Knight's_tour.