www.cbc.ca/radio/asitha... Fun intersection of math and RPGs.
cbc.ca
This new type of dice guarantees no tie when deciding who goes first | CBC Radio
A group of mathematicians and computer scientists has cracked the code to create dice that can determine a winner in single roll with no chance of a tie.
![table with two columns, name of skill and description (too much text to fully list here):
physics-formula-tree Meta skill. Building a curated, dependency-ordered physics knowledge package for one bounded domain — a DAG of primitives, conventions, first-class assumptions, laws, derivations, and canonical formulas linearized with tsort. Orchestrates the tsort, bc, lean, ptx, csplit, and ed skills. Package layout, schemas, relation types, cycle handling, skill hand-offs, and a full worked slice in references/.
physics-newtonian Knowledge capsule (built with physics-formula-tree). Newtonian point-particle mechanics as a 58-node dependency graph: kinematics, Newton's laws, work/energy, momentum, SHM, gravitation — each formula with symbols, SI units, [M L T] dimensions, exactness label, first-class assumptions, a limiting-case check, failure modes, and a source. Graph/formulas/indexes and a full verification run in the skill directory.
physics-thermoacoustics Knowledge capsule (built with physics-formula-tree). Linear thermoacoustics as a 104-node graph: ideal-gas + thermodynamic + transport prerequisites, linear acoustics, thermal/viscous penetration depths, Rott's wave equation with the complex f-functions, Swift's short-stack results, standing-wave vs traveling-wave (Stirling) device analysis, the Carnot limit. [M L T Θ] basis, complex phasor fields; 10 nodes at draft pending source reconciliation.
math-theorem-tree Meta skill (adapted from physics-formula-tree — first cross-field adaptation). Building a curated, dependency-ordered pure- or applied-mathematics knowledge package for one bounded domain — a DAG of primitives, notation conventions, definitions, axioms, structures, first-class hypotheses, theorems, constructions, and counterexamples linearized with tsort. Dimensions become types, exactness labels become epistemic/proof status, assumptions become hypotheses, limiting cases become specializations, failure modes become hypothesis-dropped counterexamples, …](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:us5uau3bkmccu57zuou6wx4f/bafkreid5wbowto4qq2sfccxjywjxthvzz2u7fa6biaszlramvfqsdxbbeq)
