KnightsTourGraph
Combinatorica`
Combinatorica`
KnightsTourGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
KnightsTourGraph[m,n]
returns a graph with m n vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight from one square to another.
Details and Options
- KnightsTourGraph functionality is now available in the built-in Wolfram Language function KnightTourGraph.
- To use KnightsTourGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012), KnightsTourGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html.
Text
Wolfram Research (2012), KnightsTourGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html.
CMS
Wolfram Language. 2012. "KnightsTourGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html.
APA
Wolfram Language. (2012). KnightsTourGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html