Potions
A calculator for potions
What's this?
This is a calculator which takes as input the raw text of your Stats.
It then calculates the cheapest way for you to be fully potioned.
If there is more than one "cheapest way", it will chose the one
with the fewest potions in it.
It has a lot of options, and you can modify the intermediate results freely.
And really, that's all you need to know :)
(Except maybe for the buglist at the bottom of the page.)
It has a lot of options, and you can modify the intermediate results freely.
And really, that's all you need to know :)
(Except maybe for the buglist at the bottom of the page.)
For those interested...
Internal features:
- Recursive, checked traversing of a predefined list of potions.
- Calculation of needed Damage Reduction using the best guesses from a lot of players.
- A mixture of javascript (speed) and jQuery (ease).
- More than 600 lines of slightly increasingly messed up js code - most written in only 1 day :)
Input - Your Stats
Paste the raw text of
your Stats
below, then click
Don't worry :)Absolutely nothing is saved of this - not even in a cookie.All calculations are done 'client-side' (i.e. in javascript) in your browser. |
Various options
- Cut Vision at 4 x Speed?
Assumptions about opponent
- Training:
- Use Tim the Enchanter's formula?
- Could the attacker be chaotic?
|
Intermediate
Translation of raw text
These are translated from the <textarea> field above.
But you may also enter or edit values directly here. When you leave the edited field, the result will be automatically updated.
But you may also enter or edit values directly here. When you leave the edited field, the result will be automatically updated.
| Stat | You | Attacker | |||||||
|---|---|---|---|---|---|---|---|---|---|
| Weight: | Max hit | incl P&A | Max chaos | ||||||
| Strength: | |||||||||
| Toughness: | |||||||||
| Speed: | |||||||||
| Vision: |
What You Need
|
(Results will appear here) |
Output - Your Potions
|
(Results will appear here) Click to display all potions (for debugging). |
Known bugs (incl. fixed)
| #) | Found | What? | Fixed | How? |
|---|---|---|---|---|
| 11) | 2012-08-31 | BUG: This slot is ready for *your* bug :) | - | - |
| 10) | 2012-08-31 | BUG: "Avoid DR" will sometimes offer higher DR (and price) than "Ignore DR. | - | - |
| 9) | 2012-08-31 | BUG: An extremely high vision need combined with high strength may still list Greens, even if they're not necessary. | - | - |
| 8) | 2012-08-30 | BUG: Simply doesn't work for some people. | 2012-08-31 | *blush* Fixed a typo ("4" instead of "5")! - it basically meant I had a line like this: "if speed boost is numerically lower than DR boost, then mark this set as the best so far" - utter rubbish... |
| 7) | 2012-08-30 | BUG: Introduced with fix 1) + 6) a very high vision stat can still give you unnecessary DR in spite of "avoid DR". | 2012-08-31 | On "avoid DR" it will now first try to ban all DR's; if that gives too low vision, it will try with Pirates allowed; if that gives too low strength it will allow it all, and just aim for as good a vision boost as possible. |
| 6) | 2012-08-30 | BUG: After fix 1) a very high vision stat can still break traversing. | 2012-08-30 | Have forced traversing to exhaust all combos of Greens. |
| 5) | 2012-08-30 | Cosmetic: The "Options" section is all over the place. | 2012-08-30 | Tables and margins ;-) |
| 4) | 2012-08-30 | Cosmetic: After fix 1) list is no longer sorted after size. | 2012-08-30 | Resorted (copy of) list in original order after done traversing. |
| 3) | 2012-08-29 | Bug? Even with "Avoid DR" it may give you DR if your stats are high enough. | 2012-08-30 | Not really a bug... but I have now introduced an option for "prohibit DR". |
| 2) | 2012-08-29 | BUG: A very high stat (e.g. vision) will give you all potions. | 2012-08-31 | Will downsize very high needs before traversing. Then displays what you lack. |
| 1) | 2012-08-29 | BUG: Sometimes won't find the cheapest set (traversing bug). | 2012-08-30 | Sorted array for price. Have forced traversing to exhaust all combos of Pirates. |
2012-08-31