Wolfram Research

Mathematica MathWorld Wolfram Science More »

An Infinite Knight's Tour


	A classic chess problem is to find a sequence of moves for a knight to land on every square exactly once. With a knight initially positioned at the center of an infinite chess board, drag the slider to see a portion of an infinite knight's tour, either as a broken line path or by numbering the squares in order. You can change the size of the displayed portion of the board.


	Contributed by: Jay Warendorff

Inspired by the "Open Knight's Tour–'To Infinity & Beyond!'" at Knight's Tour Art.

Knight's Tour (Wolfram MathWorld)

The Knight's Tour (The Wolfram Demonstrations Project)

"An Infinite Knight's Tour" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/AnInfiniteKnightsTour/

Contributed by: Jay Warendorff

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Browse all topics

Browse all education topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+