This paper is concerned with connectivity of graphs associated with generalized knight's moves. The minimal connected generalized knight's graphs are shown to be planar or toroidal, which was unexpected in view of the complex nature of the graph generated by knight's moves on a chess-board. Each move of a knight in chess takes the knight two steps parallel to one side of the board and one step parallel to the other side. Using moves of this kind a knight can move between any two positions on a standard 8 by 8 chess-board. Indeed it can move between any two positions on a 3 by 4 board, but not on any smaller board. A metrical geometry on the digital plane determined by standard knight's moves has been studied recently [1,6], and further metrics associated with generalized knight's moves have been noted [2]. The first step is to determine which knight's moves are transitive on an unbounded board. It is then natural to try to determine for each of these the smallest board on which it is transitive. It is convenient to express the problem in terms of knight's graphs in which the vertices are points in the plane with integer coefficients and the edges correspond to the knight's moves. An edge in the graph of a {p, ^}-knight joins two vertices where the difference between one of their coordinates is p and the difference between the other is q. Transitivity of a knight's moves on a board corresponds to connectivity of a knight's graph. The problem on the unrestricted set of vertices is easily solved. It is shown in §2 that the {p, ^}-knight's graph on 2 is connected if and only if p and q are mutually prime and their sum is odd. This is a special case of more general results on knight's graphs on Z which have been studied by G. A. Jones [3]. The problem on restricted sets of vertices is more difficult. In this paper it is shown that if the {p, q)-knight's graph is connected on 2 and p<q then the {p, q)-knight's graph is connected on a board of size X by Y if and only if minfA', Y}^p + q and max{X, Y} 5= 2 max{/?, q). The necessity of the condition is established in § 3. For {1, 2n}- and {n, n + l}-knight's graphs the sufficiency of the condition follows from an analysis of the connected components of these graphs on 2n + 1 by 2n + 1 blocks of vertices. This is established in § 4. In order to deal with the other cases we introduce in § 5 a cyclic ordering of the lines, and cyclic orderings of the odd and even vertices within each line. It is easily seen that most vertices on a line are connected in the graph to the next vertex in order on that line. The sufficiency of the condition is proved in § 6 for the case where q 5= 2p — 1 and in § 7 for the case wherep + Kq <2p - 1. The proofs depend on showing that on certain lines the other vertices are also connected in the graph to the next vertex in order on that line, and that this implies that the whole graph is connected. The cyclic orderings of the lines and of vertices within each line are valid when p = 1 and when q = p + 1, but the calculations in § 6 and § 7 break