Recent content by Cubemir

  1. C

    [Unofficial] Maxim Chechnev on "Ukraine's Got Talent" show. Final.

    I wonder what would happen if you broke the contract and made your own way. How much is the penalty? In other words, how much is your honesty?
  2. C

    [Unofficial] Megaminx BLD 17:50.07 UWR

    Mike, http://www.speedsolving.com/forum/showthread.php?42170-Maxim-Chechnev-on-quot-Ukraine-s-Got-Talent-quot-show-Final
  3. C

    [Unofficial] Megaminx BLD 17:50.07 UWR

    pfffff, it's easy. I saw on TV, the guy solved megaminx blindfolded in about 2 minutes. http://www.youtube.com/watch?feature=player_detailpage&v=Rk2bczaGcaU#t=206s )))
  4. C

    [Unofficial] Maxim Chechnev on "Ukraine's Got Talent" show. Final.

    His double-sided mosaic. Facepalm, it is impossible without a physical rearrangement of pieces.
  5. C

    [Unofficial] Maxim Chechnev on "Ukraine's Got Talent" show. Final.

    First part: Second part: http://www.youtube.com/watch?v=qN46KsjUUa8 Unfortunately, Maxim continued cheating. There is big controversy in the Russian-speaking communities about if it had brought benefits or harm to the community. I think that despite the advantages, it is a great...
  6. C

    Inaccuracy of scrambling using a random sequence of moves

    What happens, if we allow repeating sides:
  7. C

    Inaccuracy of scrambling using a random sequence of moves

    Using dynamic algorithm, suggested by Stefan, I recalculated the histograms for 1-19 moves. Now they are complete and absolutely exact. 11 moves: 14 moves: 19 moves: 1 move: :) 5 moves: 7 moves: 8 moves: 9 moves:
  8. C

    Inaccuracy of scrambling using a random sequence of moves

    Thank you, I understand the idea. The number of possible scrambles, that have length 11, is relatively small. 9*6^10=544195584. So we need't use Monte Carlo method. OK, I'll try to do complete calculation for number of moves <=15.
  9. C

    Inaccuracy of scrambling using a random sequence of moves

    Scrambles are in FTM (moves U2, R2, F2 are included) and do not allowed to repeat the face in next move. BTW, if we allow such a repetition (for example U U', R2 R sequences), the distribution becomes much worse. If i'm not mistaken, the peak of the histogram increases 100 times or something...
  10. C

    Inaccuracy of scrambling using a random sequence of moves

    I think we will get some kind of average histogram for histograms for 10-14 moves. Because in all cases the same positions have more probability to appear, with slight differences. The most common position for any length of scramble - solved state. Further there are positions that can be solved...
  11. C

    Inaccuracy of scrambling using a random sequence of moves

    Hello! Recently I got interested in such a question: if we scramble a puzzle using random sequence of moves, do we really get an "absolutely random" position? How many moves should we perform, before we scramble puzzle really well? Obviously, the ideal scramble should give the discrete...
  12. C

    [Unofficial] "Solve of the Year". Happy New Year from Russian Speedcubing community!

    "Feliks, what's your secret?" :) Great video! Happy New Year!
  13. C

    Speedcubing Meetings in Moscow (Russia)!

    149th Speedcubing Meeting in Moscow by Evgeny Sharov: Happy New Year!
  14. C

    Devil Algorithm for 2x2x2 (R U moves)

    I have developed a program that on my home computer is able to find one Devil algorithm for the RU subgroup in ~5 minutes. I have not used too much theory, mainly used Warnsdorff's rule, in conjunction with Euler's method, plus a variety of optimizations under this specific problem. I did not...
  15. C

    Hamiltonian circuit for the entire 2x2x2 cube group

    Great! This is Hamiltonian cycle or path?
Top