- Aumann, R.J. (1989) Lectures on Game Theory. Boulder, Westview Press.
- Ball, W.W.R. (1939) Mathematical Recreations & Essays, Eleventh Edition, Revised by H.S.M. Coxeter. London, Macmillan and Co.
- Binmore, K. (1992) Fun and Games: A Text on Game Theory. Lexington, Mass., D.C. Heath.
- Cull, P. and De Curtins, J. (1978) Knight's tour revisited. Fibonacci Quarterly, 16(3), 276-286.
- Dimand, M.A. and Dimand, R.W. (1996) A History of Game Theory, Volume 1: From the Beginnings to 1945. London, Routledge. Quoted in Schwalbe and Walker (1997), 124
- Eales, R. (1985) Chess: The History of a Game. London, B.T. Batsford.
- FIDE (2001) Laws of Chess. http://www.fide.com/official/handbook.asp?level=EE101 [Accessed 12/12/04].
- König, D. (1927) Über Eine Schlussweise aus dem Endlichen ins Unendliche. Acta Scientiarum Mathematicarum (Szeged) 3, 121-130. Quoted in Schwalbe and Walker (1997), 128
- Kuhn, H (2004) Introduction. In: von Neumann, J. and Morgenstern, O. (2004) Theory of Games and Economic Behaviour (Commemorative Edition). Princeton, Princeton University Press.
- Löbbing, M. and Wegener, I. (1996) The Number of Knight's Tours Equals 33,439,123,484,294-Counting with Binary Decision Diagrams. The Electronic Journal of Combinatorics 3(5), http://www.combinatorics.org/Volume_3/Abstracts/v3i1r5.html [Accessed 8/12/04].
- Morse, M. and Hedlund, G.A. (1944) Unending Chess, Symbolic Dynamics and a Problem in Semigroups. Duke Mathematical Journal, 11, 1-7.
- Murray, H.J.R. (1913) A History of Chess. Oxford, Clarendon Press.
- Reider, N. (1959) Chess, Oedipus, and the Mater Dolorosa. International Journal of Psychoanalysis, 40, 320-333. Reprinted in Avedon, E.M. and Sutton-Smith, B. (1971) The Study of Games. New York, John Wiley & Sons.
- Roth, A. (n.d.) The Problem of the Knight: A Fast and Simple Algorithm. http://library.wolfram.com/infocenter/MathSource/909/ Quoted in: Weisstein, nd [Accessed 5/12/04].
- Schnoebelen, P. (n.d.) The Retrograde Analysis Corner: A Collection of Coloring Problems. http://janko.at/Retros/ColoringCollection.htm [Accessed 2/12/04].
- Schwalbe, U. and Walker, P. (1997) Zermelo and the Early History of Game Theory. Games and Economic Behaviour 34, 123-137.
- Schwenk, A. J. (1991). Which rectangular chessboards have a knight's tour? Mathematics Magazine, 64(5) (December), 325-332.
- Wegener, I. (2000) Branching Programs and Binary Decision Diagrams. Philadelphia, Society for Industrial and Applied Mathematics (SIAM). Quoted in: Weisstein, n.d. [Accessed 5/12/04].
- Weisstein, E.W. (nd) Knight's Tour. From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/KnightsTour.html [Accessed 5/12/04].
- White, A.C. (1911) First Steps in the Classification of Two-Movers. Leeds, Whitehead and Miller.
- Zermelo, E. (1913) On an Application of Set Theory to the Theory of the Game of Chess, Translated in Schwalbe and Walker (1997), 133-136.