Random Cubing Discussion

38 completed, 2 DNFs.

First DNF was because the timer didn't start, second one was for FMC because I messed up cancelling moves in an insertion. Also had one +2 for "exceeding inspection", which was really "didn't notice timer didn't start, picked up cube, placed it back down, started the timer properly, oops you took too long to notice".
 
how many official solves and DNFs do you have?
I have 209 solves and 1 dnf yay.The dnf was becouse I didnt start the timer lol :p
581 solves, 8 DNFs, 1 DNS.
Of the DNFs, 5 were unsuccessful 3BLD attempts, 2 were MBLD attempts, both of which were 0/2, and the last was a feet solve that I kept messing up and gave up on. The DNS was a 3BLD attempt that I chose not to do because I was too tired.
 
Qiyi's releasing the Wuhua v2 in about a week. Supposedly has a sturdier design and faster inner layers.

Also on their Twitter feed, two more non-WCA puzzles: the Clover Cube and the Pentacle Cube. Kinda excited about the Pentacle because of how cool it looks, but there's no release date announced yet.

(inb4 "what about clock?")
What about clock?

No, seriously the Qiyi Wuhua v2 is NOT particularly nice out of the box, it's really slow and bumpy and just annoying to solves on. I did 5 solves and they were about 40 seconds over my official mean of 3:13
 
What's the largest possible difference between # of oriented edges on 3x3 you can get just by choosing a different cube orientation? Is 0-12 possible?
Nope, maximum is eight (e.g. this). If you take the difference between the orientation with the most flipped edges and the orientation with the least flipped edges, the probability distribution of that value is like this:

0: 9520020/70963200 ~ 13.42%
2: 35338752/70963200 ~ 49.80%
4: 21719448/70963200 ~ 30.61%
6: 4159488/70963200 ~ 5.86%
8: 225492/70963200 ~ 0.32%

Code:
from itertools import product
from collections import Counter

combs = Counter(tuple(sorted(a[:4]) + sorted(a[4:8]) + sorted(a[8:])) for a in product(range(3), repeat=12) if 4 == a.count(0) == a.count(1))
orients = [a for a in product(range(2), repeat=12) if sum(a) % 2 == 0]

difference_counter = Counter()

for comb in combs:
  for orient in orients:
  flip_counts = [0, 0, 0]
  for i in range(3):
  flip_counts[ i] = sum((orient[j] + (j // 4 == i) + (comb[j] == i)) % 2 for j in range(12))
  difference_counter[max(flip_counts) - min(flip_counts)] += combs[comb]

print(difference_counter)

Modified from https://www.speedsolving.com/forum/threads/probability-thread.20384/page-63#post-1218637
 
How hard would it be to write a program like JARCS/HARCS, except it can use NISS to find blocks too?

Related, I wonder if God's Number for 2x2x2 blocks is still 8 when NISS can be used.
 
I remember a week or so ago I saw thread on Antonie breaking the 2x2 WR average with a 1.37, but then it disappeared, and it turned out it was like a 2 average. Can someone tell me what was up with that? I'm assuming someone was spreading a false rumor, or I'm just crazy.
 
Back
Top