prove that you can't select all four aces in the deck of cards with only three selections.It's been proven to be at least 33 (according to multiple sites), but as far as I know we don't even have an upper bound. What I want to know is how they got the lower bound
We seem to have a lot of computing power now. I think it should be calculable.
Link.rokicki said:Will the diameter of the 4x4x4 be known in my lifetime? I suspect it will be, despite the fact that just solving a single random 4x4x4 position optimally probably requires more CPU time using current techniques than were used to determine the diameter of the 3x3x3
How do we actually know that Kociemba generates optimal solutions? I'm guessing some (probably confusing) group theory stuff.Indeed... and there are about 10^26 million times as many 4x4 positions as there are 3x3 positions (that's a hundred million million million million). So even if it was as easy to solve a 4x4 scramble optimally as it is to solve a 3x3 scramble optimally, we'd still need a hundred million million million million times as long to get God's Algorithm as we took to do it for the 3x3...
Considering we're only a few orders of magnitude from the atomic computing limit, I feel like I can predict that this computation cannot be done using our current knowledge of optimal-solving techniques.
Kociemba isn't used for generating optimal solutions - that is done by brute force. Simple to understand why they must be optimal.How do we actually know that Kociemba generates optimal solutions? I'm guessing some (probably confusing) group theory stuff.
oh ok.Kociemba isn't used for generating optimal solutions - that is done by brute force. Simple to understand why they must be optimal.
yeah, I read this on cube20.org. It says the computers they used could solve 0.36 positions/sec optimally, but 3900 positions/sec in <=20 moves.IIRC when proving god's alg they didn't optimally solve every position, 20 moves is all they needed.
Is it because you are only taking 3 cards total?prove that you can't select all four aces in the deck of cards with only three selections.
now imagine that after you have selected one card from deck you return it and remove few non-aces cards from the deck depnding on last selected card... all the way to be left with only 4 cards, which are, of course 4 aces.
waiting to super-uber-computers to calculate all the states of 4x4 and fewest move solve for each one.
one can't simply calculate the 4God's number, but dozens can.
|Thread starter||Similar threads||Forum||Replies||Date|
|X||Loopover god's number upper bounds: 4×4 (25 STM), asymptotics (O(N log^2 N)), etc.||Puzzle Theory||8|
|X||Master pyraminx God's number bounds||Puzzle Theory||1|
|X||Kilominx God's number bounds||Puzzle Theory||15|
|4x4x4 God's Number Position Hunt||Puzzle Theory||50|
|S||God's Number for 4x4 Found!||General Speedcubing Discussion||93|