All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Knight's Tour (Posted on 2003-08-21) Difficulty: 5 of 5
Taking a 4 by 5 grid, How many possible Knight's tours are there starting in the upper left corner and ending in the lower right? (Reflections and rotations don't count)

(A Knight's move is as in chess, an L shaped move, 2 squares in one direction and 1 square in the other direction.)

A Knight's tour is visiting every square once and only once (and the square you start on is considered "visited" for these problems)

See The Solution Submitted by Gamer    
Rating: 4.2500 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Without trial and error? | Comment 3 of 4 |
(In reply to Without trian and error? by Gamer)

If your program didn't use that, sorry! I don't know how to read basic, but it looked like that.
  Posted by Gamer on 2003-08-21 17:13:13

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (10)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information