perplexus.info :: General : Problematic Pathways

Problematic Pathways (Posted on 2004-06-08)

There is a 2 inch grid cube made up of 8 wire-frame cubes, each with wire where their edges should be and space in their middle and faces.

The quickest way to get from one vertex to the opposite vertex is 6 inches. How many such paths are there?

See The Solution Submitted by Gamer

Rating: 2.6667 (3 votes)

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
Answer	K Sengupta	2009-01-13 13:11:47
Nothing new but want to add 2 cents	Jer	2004-06-08 12:18:29
re(2): Full Solution	Erik O.	2004-06-08 09:01:06
solution	Charlie	2004-06-08 08:55:16
re: Full Solution - oops!	Danny	2004-06-08 08:44:07
re: Full Solution	Federico Kereki	2004-06-08 08:43:25
Full Solution	Erik O.	2004-06-08 08:22:02
Solution	e.g.	2004-06-08 07:50:43

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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info