View source for Brekreney's Fun Time

{{Method Infobox
|name=Brekreney's Fun Time
|image=QJ_pattern1.png
|proposers=Brekreney
|year=2023
|anames=BFT, Quadrilateral J-permutation Jamboree
|variants Blake Anderson, Unfun Variant
|steps=6
|algs=13-?
|moves=100+
|purpose=<sup></sup>
* [[Entertainment ]]
* [[Speedsolving]]
}}

==Overview==
The goal of '''Brekreney's Fun Time''' is to reduce the [[cube]] to a state wherein four [[PLL#J_Permutation_:_b|J-permutations]] separated by z [[Rotation|rotations]] will [[solve]] the cube. This desired state is referred to by the method as the '''QJ pattern'''

[[File:QJ_pattern1.png]] 
[[File:Bft2.png]]
'''QJ Pattern'''

==Steps==

1. '''[[Edge Orientation]]'''

2. '''First 2 Brek-Blocks'''

This intuitive step involves [[block building]] a green Brek-Block on the D [[layer]], and then a blue Brek-Block on the U layer. Brek-Blocks are a type of [[pseudoblocks]] used specifically for the BFT [[method]].

[[File:Green_block.png]]
[[File:Blue_block.png]]
[[File:Brekblocks.png]]
'''Arrangement of blocks'''

3. '''[[Permute]] the BL edge'''

This step solves the BL edge while preserving the two blocks built in the previous step. If you have done EO and F2BB correctly, the BL edge (orange-yellow edge) can always be solved by using D2, U2, R(2), and L(2) moves.

4. '''Last 4 [[Corners]]'''

L4C solves the UFL, UBL, DFR, and DBR corners. <br>
- Move the DFR and DBR corners to the U layer with R2, temporarily breaking the block. <br>
- Cycle the corners using [[Niklas]] to permute. If two parallel corners need to be swapped, use the T-perm algorithm. <br>
- Orient each corner using (R' D' R D) <br>
- Restore the U layer block with R2 <br>

5. '''Last 5 [[Edges]]'''

Solve the last 5 edges using [[commutators]].

6. '''The Jamboree'''

Now that the cube has been reduced to the '''QJ pattern''', performing Jb-Perm on the green, blue, red, and orange [[faces]] will solve the cube. Alternatively, the repetition and high [[move count]] of this step can be avoided by performing '''D' L' U L2 D R F2 L2 U2 L U F2 U R' U''''

==Pros==
*Easy to solve rotation-less. The cube rotations in the last step are completely optional.
*Ends with 3 algorithmic steps, allowing for high [[TPS]].

==Cons==
*Has an extremely high average [[move count]].
*Lots of steps.

==External Links==

[https://docs.google.com/document/d/1AFNF9CpfNzDvOFZICUGwJ8qUFto3rQjtgfcSLD28hcM/edit?usp=sharing| Official BFT Tutorial]


[[Category:Experimental methods]]
[[Category:3x3x3 methods]]