God's number for the FTO

[BadDisplayName]

I haven't really seen much development in this area. If there is a thread for this already, please let me know.
I believe I have improved the upper bound from 48 to 46 (see more details here). It'd be nice for someone to check my work.
The steps are:
1. F2HC -> two half centers (two edges + one triangle) (8 moves)
note: this is fixed (i use the U and BR half centers closest to each other), not color neutral. also, the triangles used in the half centers are distinct from the other triangles from the same face (unlike normal solving, where the U centers are all indistinguishable)
2. L2CHC -> last two centers + half centers (14 moves)
note: 4gen, specifically the faces that don't break the first two half centers
3. Reduce to tetraminx (match up 12 triangles to the corners) (13 moves)
4. Solve tetraminx (11 moves)
note: the move counts for steps 3 and 4 come from here

 

[xyzzy]

Idk, it's kind of hard to check this:

 

[Renslay]

Idk, it's kind of hard to check this:

View attachment 50668

I see this as your post:

 

[acrystal]

I see this as your post:

View attachment 50671

its a screenshot showing that theres no text channels (on discord i think)

 

[xyzzy]

I see this as your post:

View attachment 50671

Yes, OP's link goes to a private Discord server, and specifically one that I'm not in, which rules out both the FTO Discord and the puzzle theory Discord, so I have no idea where they even posted that.

 

[BadDisplayName]

Yes, OP's link goes to a private Discord server, and specifically one that I'm not in, which rules out both the FTO Discord and the puzzle theory Discord, so I have no idea where they even posted that.

strange
it goes to the public cubers discord server
i'll see if i can get the information here

 

[BadDisplayName]

okay, here are the results
.tws files used can be found at the bottom

Spoiler: FTO_F2HC

Name PuzzleGeometryPuzzle

Set EDGE 12 1
Set CENTER 12 1

Solved
EDGE
2 3 1 1 1 1 1 1 1 4 5 1
CENTER
2 1 1 1 1 1 1 1 1 3 1 1
End

Move F
EDGE
1 2 3 6 4 5 7 8 9 10 11 12
CENTER
1 2 3 6 4 5 7 8 9 10 11 12
End

Move Fw
EDGE
1 8 9 6 4 5 7 12 10 3 11 2
CENTER
1 8 3 6 4 5 7 12 9 10 11 2
End

Move D
EDGE
1 2 3 4 5 9 7 8 12 10 11 6
CENTER
1 2 3 4 8 9 7 11 12 10 5 6
End

Move Dw
EDGE
1 2 3 7 8 9 10 11 12 4 5 6
CENTER
1 2 3 7 8 9 10 11 12 4 5 6
End

Move L
EDGE
1 2 8 3 5 6 7 4 9 10 11 12
CENTER
1 7 8 3 5 2 6 4 9 10 11 12
End

Move R
EDGE
1 5 3 4 10 6 7 8 9 2 11 12
CENTER
4 5 3 12 10 6 7 8 9 2 11 1
End

Move BL
EDGE
1 2 3 4 5 6 9 7 8 10 11 12
CENTER
1 2 3 4 5 6 9 7 8 10 11 12
End

Move BR
EDGE
1 2 3 4 5 6 7 8 9 12 10 11
CENTER
1 2 3 4 5 6 7 8 9 12 10 11
End

Spoiler: FTO_L2CHC

Name PuzzleGeometryPuzzle

Set EDGE 8 1
Set CENTER 10 1

Solved
EDGE
1 2 3 4 5 6 7 8
CENTER
1 1 2 2 2 3 3 3 4 4
End

Move F
EDGE
1 4 2 3 5 6 7 8
CENTER
1 2 5 3 4 6 7 8 9 10
End

Move D
EDGE
1 2 3 7 5 6 8 4
CENTER
1 2 3 7 8 6 9 10 4 5
End

Move L
EDGE
5 1 3 4 2 6 7 8
CENTER
7 6 1 4 2 5 3 8 9 10
End

Move BL
EDGE
1 2 3 4 7 5 6 8
CENTER
1 2 3 4 5 8 6 7 9 10
End

 

[Hazel]

Is there a known lower bound?

 

[BadDisplayName]

Is there a known lower bound?

according to someone i know, the lower bound is 23
on the wiki page it says 21

 

[abunickabhi]

How many types of brute force FTO computer solvers do we have?

 

[BadDisplayName]

How many types of brute force FTO computer solvers do we have?

currently i'm just using twsearch
batch solver could work for small things but it's really not built for this sort of thing
other than that idk