lnq 👨🏿‍🦱: play
👨🏿‍🦱

/play

Per some ludology, a play :== a legal move(ment) within a game.

As a fold progression (eg. a scribble variant when stewcing Egglepple), each play [a finite step towards some goal] is an expression of some strategy (mathemusically, the duration of a coverage). (see game, gameplay, token, pink poem)

The number of unique plays (p) can be computed from the superalgebraic resultant: p:≡Sg, where S is some integer value between 1 - 676, and g equals the amount of supersymmetric generators circuiting* twistorspace (ie. degrees of freedom [base] to the power [exponent] of residue bond angles).** Asymptotic tempo values completing the loop➰.
/// +The formula is in direct correlation to spin-statistics. So, for example, when b is odd, say b=11, then c(=32) is an integer-spin (egg). When b is even, say b=20, then c(=724.0+) is a half-integer-spin (epp). The rational portion (floating point) of half-integer statistics contributes to seigniorage. Obviously, any negative value for b will yield an epp. (see stewc tax)
+Yes, there are twenty-six (26) integer values here; we denote "0" as (0-,0+) → having both negative(-) and positive(+) polarity in twistorspace. For instance, -12 ... (0-,0+) ... +12 = [26]. p is an upperbound for points on a curve (ie. patches), and so its number line must include 0 (hence 0 through 25). The minima (patch.a) is 0.0001220703125 and the maxima (patch.z) is 4,096.


Plays (fugue protocols) are implemented as stewcs (written in stewc notation). They are executed [run] by the call action, and will typically end once the strategy is exhausted. There are three (3) possible outcomes of a play: loss (of advantage), futility (no advancement), or gain (advantage). (see player, playoff)