Hidden spatial ordinal entry
Hidden spatial ordinal entry asks the player to combine the tokenized spatial or ordinal clues without exposing the full hidden arrangement and enter the uniquely entailed ordinal or difference value.
ActionCombine the tokenized spatial or ordinal clues without exposing the full hidden arrangement and enter the uniquely entailed ordinal or difference value.
CheckComplete the hidden spatial ordinal entry action.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Layered-path consistency proof
Layered-path consistency proof asks the player to submit either a complete first-to-last topological witness order or a shortest directed contradiction-cycle certificate for declared layered-path constraints.
ActionSubmit either a complete first-to-last topological witness order or a shortest directed contradiction-cycle certificate for declared layered-path constraints.
CheckComplete the layered-path consistency proof action.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Map-scene clue relation choice
Map-scene clue relation choice asks the player to use one exact route map plus named clues to choose the uniquely forced categorical location for the queried person.
ActionUse one exact route map plus named clues to choose the uniquely forced categorical location for the queried person.
CheckChoose the answer that matches the visible prompt.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Geometry, shapes, and measurement
Order-slot deduction board
Order-slot deduction board asks the player to place cards into ordered slots using relation clues.
ActionPlace cards into ordered slots using relation clues.
CheckComplete the order-slot deduction board action.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Relation-chain next-step choice
Relation-chain next-step choice asks the player to choose the relation or state that must follow from a visible relation chain.
ActionChoose the relation or state that must follow from a visible relation chain.
CheckChoose the answer that matches the visible prompt.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Relative-position grid arrangement choice
Relative-position grid arrangement choice asks the player to use fixed-position and directed relative-position clues to choose exactly one complete arrangement from a finite bank.
ActionUse fixed-position and directed relative-position clues to choose exactly one complete arrangement from a finite bank.
CheckComplete the relative-position grid arrangement choice action.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Sequential epistemic ordered-value choice
Sequential epistemic ordered-value choice asks the player to use ordered public utterances about hidden ordered values to choose the uniquely forced target value.
ActionUse ordered public utterances about hidden ordered values to choose the uniquely forced target value.
CheckChoose the answer that matches the visible prompt.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Symbol-strip deletion middle token
Symbol-strip deletion middle token asks the player to apply the ordered deletion rule to the symbol strip and enter the uniquely determined remaining middle token.
ActionApply the ordered deletion rule to the symbol strip and enter the uniquely determined remaining middle token.
CheckComplete the symbol-strip deletion middle token action.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Transport-crossing sequence proof
Transport-crossing sequence proof asks the player to construct and order a legal crossing sequence, then complete a bounded optimality-and-uniqueness certificate.
ActionConstruct and order a legal crossing sequence, then complete a bounded optimality-and-uniqueness certificate.
CheckComplete the transport-crossing sequence proof action.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
Word-ladder path or no-path proof
Word-ladder path or no-path proof asks the player to submit a valid finite word-ladder path under the declared mutation rule or a complete no-path certificate.
ActionSubmit a valid finite word-ladder path under the declared mutation rule or a complete no-path certificate.
CheckPick the path or next move that satisfies the rule.
UseSupport / Core / Transfer
ShowsCheck only
PresentationCompact / Standard / Extended
Practice focus
Word problems are confusing
