ForumsGamesGemcraft CS: Psorek's 64-combine formula

28 9025
thunderrider
offline
thunderrider
641 posts
Peasant

His formula was a jumble of numbers output from his epic computer. Here's the parentheses version. If it's too complicated, I'll try to simplify it. But not much I can do - it's naturally complicated...combining 64 gems in intricate ways, after all.

Create 20 duplicates.
A = (g+g) + (g+g) + (g+g) + (g+g)
B = (g+g) + (g+g) + ((g+g) + (((((g+g) +g) +g) +g) +g))
C = A + B
Create 36 duplicates.
D = (g+g) + (g+g) + ((g+g) + (((((g+g) +g) +g) +g) +g))
E = ((g+g) + (((((g+g) +g) +g) +g) +g))
Duplicate E( E value = G * 8)
F = ((((E + (g+g)) + (g+g)) + ((g+g) +g)) + (((g+g) +g) +g)) + ((((g+g) +g) +g) +g)
G = E + F
H = D + G
I = D + H

= a gem 5 grades higher, 64x cost(6 grade gem cost) with ~6% more specials than a 16-combined gem at Grade 18Equivalent.

  • 28 Replies
Showing 31-30 of 28