Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Longest_uncrossed_knight's_path> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Longest_uncrossed_knight's_path abstract "The longest uncrossed (or nonintersecting) knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally, on a square n×n board. The problem is to find the longest path the knight can take on the given board, such that the path does not intersect itself. A further distinction can be made between a closed path, which ends on the same field as where it begins, and an open path, which ends on a different field from where it begins.".
- Longest_uncrossed_knight's_path thumbnail UncrossedKnightsPath7x7.svg?width=300.
- Longest_uncrossed_knight's_path wikiPageExternalLink index.htm.
- Longest_uncrossed_knight's_path wikiPageExternalLink ukt.alex-black.ru.
- Longest_uncrossed_knight's_path wikiPageExternalLink gn.htm.
- Longest_uncrossed_knight's_path wikiPageID "2438400".
- Longest_uncrossed_knight's_path wikiPageRevisionID "547590350".
- Longest_uncrossed_knight's_path hasPhotoCollection Longest_uncrossed_knight's_path.
- Longest_uncrossed_knight's_path subject Category:Chess_problems.
- Longest_uncrossed_knight's_path subject Category:Computational_problems_in_graph_theory.
- Longest_uncrossed_knight's_path subject Category:Mathematical_chess_problems.
- Longest_uncrossed_knight's_path subject Category:Recreational_mathematics.
- Longest_uncrossed_knight's_path type Abstraction100002137.
- Longest_uncrossed_knight's_path type Attribute100024264.
- Longest_uncrossed_knight's_path type ChessProblems.
- Longest_uncrossed_knight's_path type ComputationalProblemsInGraphTheory.
- Longest_uncrossed_knight's_path type Condition113920835.
- Longest_uncrossed_knight's_path type Difficulty114408086.
- Longest_uncrossed_knight's_path type MathematicalChessProblems.
- Longest_uncrossed_knight's_path type Problem114410605.
- Longest_uncrossed_knight's_path type State100024720.
- Longest_uncrossed_knight's_path comment "The longest uncrossed (or nonintersecting) knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally, on a square n×n board. The problem is to find the longest path the knight can take on the given board, such that the path does not intersect itself. A further distinction can be made between a closed path, which ends on the same field as where it begins, and an open path, which ends on a different field from where it begins.".
- Longest_uncrossed_knight's_path label "Longest uncrossed knight's path".
- Longest_uncrossed_knight's_path label "Längster kreuzungsfreier Springerpfad".
- Longest_uncrossed_knight's_path sameAs Längster_kreuzungsfreier_Springerpfad.
- Longest_uncrossed_knight's_path sameAs m.07d19d.
- Longest_uncrossed_knight's_path sameAs Q1634949.
- Longest_uncrossed_knight's_path sameAs Q1634949.
- Longest_uncrossed_knight's_path sameAs Longest_uncrossed_knight's_path.
- Longest_uncrossed_knight's_path wasDerivedFrom Longest_uncrossed_knight's_path?oldid=547590350.
- Longest_uncrossed_knight's_path depiction UncrossedKnightsPath7x7.svg.
- Longest_uncrossed_knight's_path isPrimaryTopicOf Longest_uncrossed_knight's_path.