We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
treesToCut(tier) = Math.ceiling(treesToCut(tier-1) * LOG16(18-tier)) with treesToCut(1) = 1
treesToCut(tier) = Math.ceiling(treesToCut(tier-1) * LOG16(18-tier))
treesToCut(1) = 1
costToCut(tier) = costToCut(tier-1) * 2 with costToCut(1) = 64
costToCut(tier) = costToCut(tier-1) * 2
costToCut(1) = 64
Functions are recursive so suggest implementing as a precalculated array to avoid unnecessary logarithm calculations
Also change the recipe time from 20 ticks to 50 ticks for more balanced output at low energy tiers.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
treesToCut(tier) = Math.ceiling(treesToCut(tier-1) * LOG16(18-tier))
withtreesToCut(1) = 1
costToCut(tier) = costToCut(tier-1) * 2
withcostToCut(1) = 64
Functions are recursive so suggest implementing as a precalculated array to avoid unnecessary logarithm calculations
Also change the recipe time from 20 ticks to 50 ticks for more balanced output at low energy tiers.
The text was updated successfully, but these errors were encountered: