Is anybody working on solving Eternity II ?
Anyone caring to discuss the best approach to solve it?
Seba
Loading User Information from Channel 9
Something went wrong getting user information from Channel 9
Loading User Information from MSDN
Something went wrong getting user information from MSDN
Loading Visual Studio Achievements
Something went wrong getting the Visual Studio Achievements
Is anybody working on solving Eternity II ?
Anyone caring to discuss the best approach to solve it?
Seba
What stops someone from making a computer program that tries all combinations?
(256 P 256) * 4 orientations per peice = 256!*4 = 3.43127e+507 possible combinations.
Nothing stops someone from trying all possible combinations, but you're not
going to try all possible combinations in one lifetime.
CannotResolveSymbol wrote:Nothing stops someone from trying all possible combinations, but you're not going to try all possible combinations in one lifetime.
ZippyV wrote:
CannotResolveSymbol wrote:
Nothing stops someone from trying all possible combinations, but you're not going to try all possible combinations in one lifetime.
If you have only 1 processor. I'm sure the Channel 9 community has more than 1 of it. This would be an excellent C9 community project/contest.
Who's going to buy the puzzle?
CannotResolveSymbol wrote:I'm sure there would be a way to solve this problem by computer, but brute-forcing it as you suggest is impossible.
CannotResolveSymbol, I think you're wrong. 256!*4 means that all the possible positions are used and for each combination ALL the pieces are rotated. Each position should be combined with an orientation => 256*4 possibilities per piece => (256*4)! = 5.418528796E+2639 total possibilities.
TommyCarlier wrote:CannotResolveSymbol, I think you're wrong. 256!*4 means that all the possible positions are used and for each combination ALL the pieces are rotated. Each position should be combined with an orientation => 256*4 possibilities per piece => (256*4)! = 5.418528796E+2639 total possibilities.
You guys forgot that there are border and corner blocks, also there is a starter piece and 2 clue pieces . Wikipedia said:
A tighter upper bound to the possible number of configurations can be achieved by taking into account the fixed piece in the center and the restrictions set on the pieces on the edge: 1 × 4! × 56! × 195! × 4195, roughly 1.115 × 10557
CannotResolveSymbol wrote:I'm sure there would be a way to solve this problem by computer, but brute-forcing it as you suggest is impossible.
sgomez wrote:
CannotResolveSymbol wrote:
I'm sure there would be a way to solve this problem by computer, but brute-forcing it as you suggest is impossible.
I know, but still, my programm is running... go knows, I might get lucky
Seba
Thread Closed
This thread is kinda stale and has been closed but if you'd like to continue the conversation, please create a new thread in our Forums,
or Contact Us and let us know.