English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

8 answers

Is it possible? Yes (because anything based on logic and a finite number of moves from a given state, can be solved)

Could I do it? No (because I have better things to do with my time). I could write a Prolog program to solve it for me, but that wasn't the question :-)

2007-01-18 13:57:58 · answer #1 · answered by Extemporaneous 3 · 1 0

Well, the cube would no doubt be solvable by some algorithm, but I think the key question is how many turns it would take. If it required billions of turns, then you wouldn't live long enough to finish it.

2007-01-18 13:50:27 · answer #2 · answered by Anonymous · 1 0

There would still be only six different colors (because of a cube having six sides), so it may not be as hard as it sounds.

2007-01-18 13:49:10 · answer #3 · answered by The Maestro 4 · 1 0

Depends on 2 things
1. Can you hold one that big?
2. You'd have to be a super genius
Also, you mean 100x100, right?

2007-01-18 13:44:20 · answer #4 · answered by Maxie D 4 · 1 0

Yes.

2007-01-18 13:43:57 · answer #5 · answered by shawwdow 2 · 1 0

yes

2007-01-18 13:51:28 · answer #6 · answered by pb8874 1 · 1 0

No. Who do you think I am Chuck Norris!?!!?

2007-01-18 13:49:19 · answer #7 · answered by Trixstix 3 · 3 0

i would never be able to do that!

2007-01-18 13:46:17 · answer #8 · answered by Anonymous · 1 0

fedest.com, questions and answers