walkerMath\coliseum\algebraic-step-finder

// algebraicStepFinder [algebra]

<- [coliseum]

// algebraicStepFinder

pick the right move, one step at a time, until x is alone.

// SYSTEM_RULES:

* choose an operation, then choose the number to apply to both sides.

* optimal step: +3 pts | messy step: -2 pts | solved: +5 pts.

* points are scaled by the difficulty multiplier. penalties are not.

* [undo step] reverts the equation and the points it earned. penalties stand.

* undoing an even power splits the equation in two: solve both branches.

* the clock pauses between equations.

// equation types (at least one)

linear e.g. 3(x - 2) + 4 = 2x + 7 square & cube roots e.g. 2√(x + 3) - 1 = 7 integer exponents e.g. (x - 2)² + 5 = 54 rational exponents e.g. x^(2/3) = 16

// difficulty level LVL 3 | 1.4×

// mix: 1-step 40% | 2-step 55% | 3-step 5%

type my own answers no number bank. +1.2× points, and race times go on the typed-answers board.