X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~yarrgweb/git?a=blobdiff_plain;f=yarrg%2Fweb%2Fdocs;h=e1269706dbba7e38a98cb84069140c6bf827293f;hb=5d41f4f9fd6a3f188bba831a1a8902f7890cef8f;hp=6f754bff46e258472de8c5d413723ab7fa8eb117;hpb=555b3391b3cd9967a29b219fff242b583137d2b8;p=ypp-sc-tools.web-live.git diff --git a/yarrg/web/docs b/yarrg/web/docs index 6f754bf..e126970 100755 --- a/yarrg/web/docs +++ b/yarrg/web/docs @@ -33,7 +33,7 @@ %doc> -
-Formally, the capacity is a list of terms, all but the first preceded -by one of -, minus, +, -plus. Each term may specify a mass and/or a volume -(separated by a space), as a number followed (without an intervening -space) by a unit (t, kg, kl or -l). Alternatively each term except the first may specify a -percentage, which is applied as a percentage change to the answer from -all the preceding terms. The first term may be a ship name or -abbrevation instead. If the first term specifies only one of mass or -volume, all the subsequent terms may only adjust that same value. +More formally: +
+ capacity-string := [ first-term term* ] + term := ('+' | '-' | 'plus' | 'minus') (value+ | number'%') + value := mass | volume + | integer commodity-name-or-abbreviation + mass := number ('t' | 'kg') + volume := number ('kl' | 'l') + first-term := mass | volume | mass volume | volume mass + | ship-name-or-abbreviation ++ +If the first term specifies only one of mass or volume, all the +subsequent terms may only adjust that same value.
+ +The trading plan does not take into account accumulated profits from +each leg of the journey when applying the available capital +constraint. For example, if you specify a journey from A to B to C +and a capital limit of 10000 PoE, the trading plan will not tell you +to buy 1000 peas at A for 10 PoE each, sail them to B and sell all of +them for 20 PoE each, and then buy 2000 beans at B for 10 PoE each and +sail them to C to sell for 20 PoE each even if such a trade would in +fact be possible. In practice this is unlikely to be a problem! + <& footer &>