Interest in a BH method website?

[puzzlemaster]

for the edges naturally there will be a lot less

Try again.

Alright, alright. More constructive...
Explain the 378 for corners.

Wait, will there be the same amount of edge cases as all the edges can be solved using the same algorithms but on big cubes one would just turn the layer that it is in? Wouldn't the number of cases for the corners also remain the same as the number of stickers on a given corner doesn't change. The pieces will have the same number of cases. If this isn't the case, can someone please explain why not?

 

[Stefan]

I repeat: Explain the 378 for corners. It's really easy. And then you'll have your answer and a better understanding.

 

[blah]

I had some time and mirrored the corner algs (new buffer: UBL). I attached the list to my post.
And here's the ugly code which did the job.

thanks, Tim

can you make it a html page? (txt can look UGLY sometimes )

C'mon I used Notepad to mirror everything to my UFL buffer a looong time ago. I'm not saying Tim's work is useless; I'm just saying people should try putting in some effort to do their own work rather than making "kind requests" to others to do the work for them.

 

[tim]

I had some time and mirrored the corner algs (new buffer: UBL). I attached the list to my post.
And here's the ugly code which did the job.

thanks, Tim

can you make it a html page? (txt can look UGLY sometimes )

C'mon I used Notepad to mirror everything to my UFL buffer a looong time ago. I'm not saying Tim's work is useless; I'm just saying people should try putting in some effort to do their own work rather than making "kind requests" to others to do the work for them.

Search & Replace? And how did you avoid cyclic replacement (R => L' => R)?

 

[blah]

I had some time and mirrored the corner algs (new buffer: UBL). I attached the list to my post.
And here's the ugly code which did the job.

thanks, Tim

can you make it a html page? (txt can look UGLY sometimes )

C'mon I used Notepad to mirror everything to my UFL buffer a looong time ago. I'm not saying Tim's work is useless; I'm just saying people should try putting in some effort to do their own work rather than making "kind requests" to others to do the work for them.

Search & Replace? And how did you avoid cyclic replacement (R => L' => R)?

First replace with random stuff like XYZ. Couldn't have took me more than 10 minutes, really.

 

[puzzlemaster]

I repeat: Explain the 378 for corners. It's really easy. And then you'll have your answer and a better understanding.

Well the number of corners doesn't change and neither does the number of possible positions as all cubes have the same number of possibilities for corners.

 

[deadalnix]

Try calculation now instead of useless considerations

 

[puzzlemaster]

then i guess i can't explain it then.

 

[Ellis]

oh cmonnnn, it's so easy that even I could figure it out. Think about all the possible cycles with a fixed buffer.

 

[Stefan]

then i guess i can't explain it then.

Way to show your puzzlemaster skills. Spoiler:

Spoiler

378 = 21 * 18
I'm *not* going to explain any further.

 

[cmhardw]

Update: Ok everyone, I have this Thursday off from work so I will be working on getting the 3x3 edges page up. Barring any weird unforseen circumstances the edges page will be up on the site by the end of the night Thursday (EST). After that I might take a couple days to put together the site explaining the 3x3x3 method. After that the bigger cubes pages will take longer. I had been working on the alg lists for the larger cubes, but the hard drive I was working on died. This means I have to make those pages and algs lists from scratch. Daniel might still have some of the files he started working on, so I'll get those from him first and try to post what I can as I can.

For the bigger cubes (wings and centers) do people want partial lists posted, which Daniel and I update a little bit from time to time? Or would you rather just have full pages posted when they're completed?

Chris

 

[Lucas Garron]

I like applets.

(Also, I recommend CSS)

 

[cmhardw]

I like applets.

(Also, I recommend CSS)

Wow! Lucas, if you can send me a copy of the HTML code that links to all those applets I'll make that the main page on my site (with due credit to you of course). Those applets are great! Let me know if you don't mind me doing this and I'll update the page to be your version, that looks great!

Chris

--edit--

If there a way to setup the applets so that they already have the inverse of the algorithm applied as the starting state? This way, upon completing the execution of the algorithm the cube will be solved. Even knowing the algorithms already, it takes a second of recognition to watch the alg being played and track what it's doing.

 

[Mike Hughey]

I like applets.

(Also, I recommend CSS)

I recently suggested to Chris that he have an option to choose a buffer sticker, and then reorient the algorithms based on the buffer sticker. And also it would be nice to have the ability to assign a label to each piece, so instead of seeing (URB UBL ULF), you could see (B A D) or whatever your lettering scheme is.

I was offering to try to do it someday, but Lucas, I bet you could throw that together in a matter of minutes. Might you be willing to do that for Chris? I know he'd appreciate it.

 

[cmhardw]

I like applets.

(Also, I recommend CSS)

Wow! Lucas, if you can send me a copy of the HTML code that links to all those applets I'll make that the main page on my site (with due credit to you of course).

Oh the dangers of posting messages at work when I should be working.

[Paraphrase]
Hey Lucas, you know that HTML file you just posted online? Yeah, if you can get me a copy of that file, the one you already posted online, then I can update my page with it!
[/Paraphrase]

I'll update my site soon to show the links to the applets. Thanks again Lucas!

--edit--

@Mike and anyone interested
Anyone who knows how to do this, if you can provide the code I will certainly add it to my page. I think the ability to do this would be amazing for those trying to learn a personalized version of BH, rather than using the standard buffers we have chosen.

 

[Lucas Garron]

If there a way to setup the applets so that they already have the inverse of the algorithm applied as the starting state?

Oh yes, duh. Not sure why I didn't do that:
http://archive.garron.us/html/2009/bhlinked.html
(Feel free to use that HTML. Note that the link at the end needs to be fixed.)

I was offering to try to do it someday, but Lucas, I bet you could throw that together in a matter of minutes.

Sorry, but I think I need to restrain myself before I completely rewrite Chris's page instead of doing my homework.
(I would want to rewrite everything into something database/script-based. If you just want simple manipulation tools, ask Johannes for now.)

 

[deadalnix]

Maybe the A9 cases should be splitted in sub cases (like A, Sarah, Czeslaw)

EDIT: Hey, you have updated the page to add applets ! Great ! Why have you changed solver mode to générator mode ? I find this less intuitive this way . . .

PS: Someone can explain me toss up ? I can't understand this (I'm not a native english speaker). I mean the meaning of the word, not the alg.

 

[cmhardw]

@Lucas I updated the page with your new bhlinked.html, thanks again!

@deadalnix I hadn't thought to break the A9's into sub-cases, but I suppose you certainly could. Every A9 algorithm is a setup into an 8 move commutator. The only difference is that the setup move has a cancellation with the A part of the commutator at one of the points. Remember that we standardize to mean that the A part of the commutator is the placing algorithm (3 moves or more) and the B part of the commutator is the interchange move (1 turn only). This definition doesn't work as well with commutators like M U2 M' U2 but you get the idea.

For example, the first A9 on the list is: (URB UBL ULF) / L F' L B2 L' F L B2 L2 (9 HTM) / A9

This algorithm is actually the algorithm: (URB DFL DLB) / L' F' L B2 L' F L B2 (8 HTM) / Direct Insert

The only difference with the A9 is that it has a setup move. For the A9 version we are going to use the same commutator as the "Direct Insert" Algorithm, but use a setup turn of L2.

So you get:
(L2) (L' F' L) (B2) (L' F L) (B2) (L2)'

The setup move has a cancellation with the A part of the commutator giving:
L F' L B2 L' F L B2 L2

For edges you will also have lots of 9 move cases (STM) called "B9" because the cancellation of the setup is with the B part of the commutator.

As for breaking them into sub-cases they will break down into the same names as all the possible 8 move commutator cases. I don't think I will be putting the sub-cases just yet, as I am hard at work on formatting Daniel's edges .txt file to add case names and some alternate algorithms here and there too.

If enough people are interested in sub-case names for the A9's and B9's I can add them, otherwise I will just make a note that the sub-cases will be the same case names as the 8 move algs, and to try to discover on your own which sub-case your alg break down into. You do have to learn to visualize this to apply the algorithms for the A9's and B'9s so I guess it would be helpful to have sub-case names. What do people think?

Chris

 

[dbeyer]

Its really a recognition of cases.
Just like OLL, or PLL, or F2L.

I'd say its like F2L, you recognize a case of the cycle, and how the pieces are around the cube relative to the others being cycled.

about 50% of them are actually optimally solved in 8 moves,
30% are like 9 moves, a commutator, with which the setup and the insertion (part A) have a cancelation. Sorta like in FMC.

The rest are really easy and they are longer to solve, they are even easier to recognize because there are so few of the rest of the cases.

I can show you how to recognize whether its an

8, 9, 10, 11, or 12 mover.

You can't just learn algs for the corner system, just like you shouldn't learn algs for F2L, it should be intuitive.

Later,
DB

 

[dbeyer]

Ok
There are 5 types of cases, ranging from 8-12 moves.
Pure (8)
A9s (9)
Orthogonals (10)
Cyclic Shifts (10)
Columns (11)
Per Specials (12)

We called them this just for the sake of terminology, and having defined vocabulary.

As you can see, the Pures are 8 moves, using
dbeyer.110mb.com/BHcorners.txt as a reference
198 of the 378 cases are optimally 8 moves.

That means there is a 3 move part A, and then an interchanging. Then A'B'

ABA'B' or BAB'A' to solve the cube.

You've cubed enough that you should be able to see most of these pure cases.

----------
A9s
The concept of all of these cases there isn't an insertion that provides interchangeability. Yet the setup to give interchangeability actually leads to a cancelation with the insertion.

SABA'B'S'
The 1 turn setup and the insertion cancel a move creating a double turn for the first or last move.


URB -> DLB -> BRD
I see that L2 creates interchangeability with the DLB and URB. I also see that doing L' creates interchangeabilitity with the DLB and BRD.

So perhaps a setup of
L', then an insertion of L'U2L, and interchange with D2

S: L'
A: L'U2L
B: D2
SABA'B'S'
L2U2L D2 L'U2L D2 L


The A-perm is a commutator with a cancelation

S: R
A: R F2 R'
B: B'

R2 F2 R' B' R F2 R' B R'

Now the worst and smallest set of cases are the per specials. They are optimally 12 moves. The recognition thereof is Simple. The three stickers interchangeable by double turns with the buffer.

So the URBs 3 double turns are, U2 R2 and B2.

Giving you the ULF, DRF, and DLB The buffer permute to any combination of the other 3 pieces is a per special.

Orthogonals are a varitation of the per specials.
Same pieces, but different sticker permutations.

Buffer and two of the pieces, but all three stickers must be on orthogonal planes.

L/R are parallel,
U/D are parallel,
F/B are parallel,

So you need each sticker to be on a different set of planes.

One for the U/D (buffer)
One for the L/R, and one for the F/B.

The simple solution is do a quarter turn setup to create interchangeability then a commutator and unset. There are no cancelations.

Examples.

UBR -> LFU -> FDR
Do say F as the setup, or perhaps U'

Really there are only 54 cases over 9 moves.

Now the next concept are cyclic shifts.

You are actually getting a 10 mover that looks really wierd.

You're doing something along the lines of taking a 4 move insertion, and double turn interchange. Then you write the alg out but you start on 3 third move of the ABA'B' commutator and loop around to get a weird effect on the cube.

Heres the setup.
All three cubies are on 1 plane.
Say the R face.
That means there is a middle piece.
The target sticker of the middle piece isn't interchangeable with either of the other two target stickers on the other pieces.

But look.

URB -> DBR -> RUF

URB is the middle cubie. Its not interchangeable with anything but look ...
If you do,
F you see that URB and RUF are interchangeable by R2
if you do D' you see that URB and DBR are interchangeable by R2

Now

R2 is the interchanging
FD' R2 DF'D'F R2 F'D
or its inverse cycles the pieces.