🏆

OPTIMAL FOUND!

You minimized the triplet difference!

BACK TO HUB

TRIPLET TRIALS: THREE-PATH OPTIMIZATION

MOVES
0
TRIALS
0
CURRENT DIFF
0
◆ CALCULATION ◆
max(A, B, C) ?
min(A, B, C) ?
diff = max - min ?
BEST DIFF
🔴 A is MIN → Move A++
🟢 B is MIN → Move B++
🟡 C is MIN → Move C++
◆ THREE-PATH ARENA ◆
PATH A
PATH B
PATH C
A[i]
?
B[j]
?
C[k]
?
Move the pointer at the MINIMUM value!
A/1: Move A | B/2: Move B | C/3: Move C | Space: Auto
◆ MOVE HISTORY ◆
◆ SCOREBOARD ◆
Optimal Diff ?
Your Best
Efficiency --%