Search results

Yes, I always use the old website (I didnt know it was considered old), because I dont like that the forum-version is so crammed from all the forum tabs around it.

Now it works again, I dont understand. But I did get the error you mentioned like 2 hours ago and couldnt find a way to get onto the website. I can always use the competition tab here in the forum tho, just not the dedicated website most of the time.

It does not work at all anymore now for me. I can still compete in the forum version tho.

It really depends on the path I take as well. When I google speedsolving weekly comp and click on the link that goes to the rules, I can access it and then navigate to the weekly view. But I cant directly go to it.

I am also not sure how many inofficials he does (i have retired from grinding solves in the weekly :D)

Okay it seems to be working very inconsistently. It worked earlier today when i didnt use a bookmark, but now it doesnt even work when I google it. I get an "HTTP Error 500" everytime

It seems to be an issue on my end. I have the login page bookmarked but it gave me a 500 error everytime I clicked it. Now that I opened the website by googling it, it seems to be fixed.

I will look into it, but I am a bit busy right now with finding a job :D Different scrambles gave the same results in terms of of how difficult they were to solve for my solver, but its unclear what that can say about human-solvers or optimal solutions. Wouldnt you just need a random state...

Website seems not to be working for me since yesterday, is that just me?

I mean, my solver is a blockbuilder, which is what I recall being a good method for human solvers, so it might be rather human-like.

I just did a test with the basic solver and a sample size of 100 scrambles, which gave 93,02 moves for random state. 93,04 moves for random moves (which I assume is old WCA-style). 93.14 moves for WCA-style. 92.91 moves for WCA-style 100 moves. So far it seems to be pretty insignificant...

Judging the antipodes of the 3Gen states my guess would be that it is a state that involves moving around some pieces to their antipodal positions. Since that requires a lot more moves on the megaminx than on the 3x3, i would not be surprised if its an inherent property of such a state.

Nice article, i am always happy about reading my name somewhere (in a positive context ofc). I have one question: "Current algorithms guarantee solutions of no more than 116 moves. Using modern search techniques could reduce this to 90–120 moves on average.", I assume the 116 moves is taken from...

The solutions seems to average 100+, I wonder what you are doing different?

Which solver is it using? Also can I see the scrambles somewhere? (I cant see it on cstimer yet)

But thats where its starting to get really interesting!

My thesis is now public at: https://tudatalib.ulb.tu-darmstadt.de/items/df505085-2ccb-43e2-9679-9bbf1dbf192f/full The zipfile contains the thesis pdf, a gap implementation of the Megaminx and the project code, which is already on git.

Hey, yeah sorry, I didnt update here for the finale, as you were the last one left and autowon the battle for 3rd. I also ran into issues in the facebook group with announcements, so decided not to make an announcement post for the winner Matheo, who is probably not even on here. I will not do...

That does not add anything of value.

I finally got around to do the QTM tables. I have not verified this data with the solver, so take it with a grain of salt (The number seem reasonable tho). In total we obtain for the original subgroup chain a total bound of 13+14+14+19+12+18+17+21=128 moves, which gives us a total bound of...