m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarcin Chrzanowski <marcin.j.chrzanowski@gmail.com>2017-08-22 17:07:11 -0400
committerMarcin Chrzanowski <marcin.j.chrzanowski@gmail.com>2017-08-22 17:07:11 -0400
commit12a632d2772da84043d4335eeabbca505efd760f (patch)
tree5f0658b0ec4165031fbcd3eae7ad5382b10bdcf6
parent594f3b0c20c5b12f0d1ef11705187c22c1e40faf (diff)
Update README
-rw-r--r--README.md7
1 files changed, 6 insertions, 1 deletions
diff --git a/README.md b/README.md
index 8c273ec..86db32b 100644
--- a/README.md
+++ b/README.md
@@ -64,6 +64,8 @@ games are supported. You can do things like:
* `number K dice`: rolls the dice and keeps the `number` highest results. For
example, `1K2d20` is the "rolling with advantage" mechanic from 5th Edition
Dungeons and Dragons (roll two d20's, keep the highest).
+* `number k dice`: like `K` but keeps the `number` lowest results. `1k2d20` is
+ D&D5E's "disadvantage" mechanic.
### Full syntax and semantics
@@ -82,6 +84,7 @@ The parser recognizes the following grammar:
| '-' Die
| Die 'E' Die
| Die 'K' Die
+ | Die 'k' Die
Semantics are defined in terms of the `pool` function.
@@ -109,11 +112,13 @@ Semantics are defined in terms of the `pool` function.
dice pool generated by `E` is rolled, and the resulting dice pool is composed
of those dice that rolled highest, taking up to as many dice as the result of
rolling `D`.
+* `DkE` is the "keep lowest" mechanic. Like `K`, but selects the lowest rolling
+ dice.
Additionally:
* The binary arithmetic operations (` + `, ` - `) are left associative.
-* The die operations (`d`, `E`, `K`) are right associative (`1d2d3` is
+* The die operations (`d`, `E`, `K`, `k`) are right associative (`1d2d3` is
equivalent to `1d(2d3)`, use explicit parentheses if you need `(1d2)d3`).
* Die operations bind stronger than the binary arithmetic operations (`1d6+1d4`
is equivalent to `(1d6) + (1d4)`).