Challenge dashboard
Find the split that reduces uncertainty most.
Challenge settings
Dataset
Inspect features and class labels.
Split workspace
Feedback
Information Gain = Parent Entropy − Weighted Child EntropyAnimated split canvas
Records move from the parent into child nodes.
Candidate comparison
Plotly analytics
Learning guide
Calculate entropy or Gini impurity before splitting.
Apply one feature condition to create left and right groups.
Multiply each child impurity by its record proportion.
The strongest split removes the most uncertainty.
Entropy(S) = −Σ pᵢ log₂(pᵢ)
Gini(S) = 1 − Σ pᵢ²
Gain = I(parent) − Σ (|child| / |parent|) × I(child)Achievements
Results and data tools
Frequently asked questions
Why is the highest information gain preferred?
It creates the largest reduction in class uncertainty. The resulting child nodes are usually purer.
Can information gain favour many-valued features?
Yes. Gain ratio can reduce that preference by dividing gain by split information.
How are numerical thresholds generated?
The game tests midpoints between sorted unique values. Invalid small leaves are removed.
What happens when gains are tied?
The game accepts values within a small tolerance. Simpler balanced splits receive explanatory preference.
Does the game support multiple classes?
Advanced datasets may contain three classes. Entropy and Gini work for every class count.
Where is progress stored?
Scores, achievements, and history use local browser storage. No account is required.