Computing Magic Knight Tours
Edit Page
Report
Scan day: 19 February 2014 UTC
64
Virus safety - good
Description: Description of how a group of machines solved the problem of how many ways exist to visit each field on a chess board exactly once with a knight.
I'm no longer interested in magic knight's tours and don't want to encourage others to waste time on it. This page is being maintained just for historical reasons, so the links remain working and in responsibility
Size: 228 chars
Contact Information
Email:Send Message
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Computing Magic Knight Tours |
| Keywords: | magic, knight, tour, semi-magic,semimagic,knight's tour. |
| Description: | Computing semimagic knight tours |
| IP-address: | 212.27.63.129 |
WHOIS Info
| NS | |
| WHOIS | status: ACTIVE status: ok |
| Date | created: 15/03/1999 last-update: 23/12/2008 changed: 04/04/2013 [email protected] changed: 17/02/2004 [email protected] changed: 17/02/2004 [email protected] |