PBCS

PBCS method Information about the method Proposer(s): Daylen Hall , Kristopher Tibbetts , Ethan Hayes Proposed: 2023 Alt Names: none Variants: PB2G No. Steps: 5 No. Algs: 224 Avg Moves: 45-50 Purpose(s): Speedsolving

The PBCS method was made for Method Development Competition 2023. It won the categories Best for 2 Handed and Best for One Handed. It was made as a low movecount method with good ergonomics while keeping a manageable algorithm count(Most methods nowadays have about 400 algorithms)

Steps

• 1. 2x2x3 on Left - Solve a 2x2x3 block on the left. First make a 1x2x3 like in Roux. Then solve the DF and DB edges.

• 2. Bar Creation - Combine the remaining pieces from the first layer so the D color is in a strip it can be oriented or misoriented and the corners can be swapped. Place it in ether UL or DR.

• 3. EOBar - Use an algorithm to solve the bar into DR while orienting the remaining edges. There are 46 algorithms split up into 4 sets.

• 4. CERLL/LEG-1 - Solve the remaining corners. If the bar is solved you use one of 42 CERLL algorithms. If the bar’s corners are swapped you use one of 43 LEG-1 algorithms.

• 5. L6EP - Solve the remaining edges with an algorithm. There are 93 algorithms.

PB2G

This was the original idea proposed by Daylen Hall but turned down in favor of PBCS (idea proposed by Kristopher Tibbetts ). However it could be viable in One Handed solving.

Steps

• The first 3 step are the same as PBCS except you must make the bar a solved 1x1x3.

• 4. CPEE- In this step you solve the 2 middle edges while permuting the top layer corners.

• 5. 2GLL - Solve the last layer in 1 look using one of 84 algorithms. These are entirely 2-Gen (R and U moves).

External Links

• PBCS Google Document
• PBCS Algorithm Sheet