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

Home > Games
A square question (Posted on 2010-10-12) Difficulty: 3 of 5
1. Given a 7*9 grid with distinguishable (e.g. numbered) tokens on each square.
2. Move each one of the tokens to a neighboring place (horizontally, vertically-but not diagonally).
3. Evaluate the number of possible distinct solutions.

Remember: each token has to arrive to a square occupied initially by its neighbor.

4. Please submit the final answer and the amount of time spent to get it.

No Solution Yet Submitted by Ady TZIDON    
Rating: 3.0000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some Thoughtsre: Fast solution (spoiler), ........fast indeedAdy TZIDON2010-10-13 04:57:30
SolutionFast solution (spoiler)Steve Herman2010-10-12 23:42:37
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 (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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