knight-path 1.0

The knight-path program is used to find the shortest path of a knight chess piece between two chess board positions. This was given to me as a small programming puzzle (and there is also an annotated puzzle description, pointing into the source code).

Note that this is not the Knight's Tour problem, that problem involves finding the longest path.

The code is fully annoted with Doxygen comments. You can see the generated documentation pages here.

Download

There are several ways you can obtain the software, as either source code or pre-compiled binaries.

The Master Sources

The following files are available for download from this web site:

File Description

knight-path-1.0.README The README file from the tarball.

knight-path-1.0.tar.gz The complete source.

SourceForge Downloads

The best possible download speed for the source tarball will be from the project's SourceForge download pages,
and here is the most recent tarball from there.

Ubuntu Packages

If you use Ubuntu Linux, there are pre-built packages available for installation using the normal sudo apt-get install method, from this package archive (PPA).

Instructions are available there for how to manually add the PPA to your /etc/apt/sources.list file, but the following commands are sufficient on recent versions of Ubuntu:

sudo add-apt-repository ppa:pmiller-opensource/ppa
sudo apt-get update
sudo apt-get install knight-path

Debian Packages

This web site provides pre-built Debian packages for Ubuntu 11.04 natty amd64
The above PPA also has Debian packages, including the source packages.

Aegis DVCS

This project is developed using Aegis, a distributed version control system.

The Aegis repository for this project is available.
The project is available as a single change set in aedist(1) format.

Knight-path is written and owned by Peter Miller <pmiller@opensource.org.au> and is freely distributable under the terms and conditions of the GNU GPL.

There is more Software by Peter Miller at his home page.

This page has been accessed approximately number

times since 2-Aug-2011.