Statements (50)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Mathematics
|
| gptkbp:analyzes |
graph traversal
|
| gptkbp:can_be_approached_with |
heuristic methods
|
| gptkbp:challenges |
puzzle enthusiasts
recreational mathematics visualized graphically explored through simulations easily programmed explored through programming contests explored through recursion solved manually solved using brute force solved with graph traversal techniques solved with various strategies studied in discrete mathematics studied in graph algorithms visualized in 3 D |
| gptkbp:example |
algorithm design
pathfinding problems |
| gptkbp:has_historical_significance |
gptkb:Mathematics
|
| gptkbp:has_solutions_for |
8x8 chessboard
|
| gptkbp:has_variants |
Closed Knight's Tour
Open Knight's Tour |
| https://www.w3.org/2000/01/rdf-schema#label |
Knight's Tour
|
| gptkbp:involves |
gptkb:chess_match
|
| gptkbp:is_a |
combinatorial problem
|
| gptkbp:is_a_problem_in |
graph theory
|
| gptkbp:is_a_solution_for |
dynamic programming
iterative methods backtracking algorithm Warnsdorff's rule |
| gptkbp:is_a_subject_of |
gptkb:academic_research
combinatorial game theory mathematical puzzles |
| gptkbp:is_analyzed_in |
complexity
mathematical induction |
| gptkbp:is_explored_in |
gptkb:Artificial_Intelligence
|
| gptkbp:is_featured_in |
mathematical competitions
|
| gptkbp:is_implemented_in |
computer programming
|
| gptkbp:is_often_used_in_teaching |
algorithmic thinking
|
| gptkbp:is_popular_in |
gptkb:computer_science
|
| gptkbp:is_related_to |
Hamiltonian path
|
| gptkbp:is_represented_in |
chessboard
a matrix of moves a sequence of moves |
| gptkbp:is_studied_in |
gptkb:Leonhard_Euler
|
| gptkbp:performed_in |
different board sizes
|
| gptkbp:skills |
knight's movement in chess
|
| gptkbp:bfsParent |
gptkb:24_Knights
|
| gptkbp:bfsLayer |
6
|