How Mansori teaches
Mansori is a free path of 50 short, interactive animations that take a child from noticing patterns at age 3 to training neural networks at 18. Here is how it works, what it covers, and how we keep children safe.
The approach
One idea per lesson, and no repeats. Every lesson teaches exactly one concept with its own animation, and each one names the earlier idea it builds on. A child who finishes the path has met the core ideas of computer science and machine learning in the order engineers would teach them.
Doing, not watching. Children tap, drag, wire circuits, train models and break things. The animation reacts instantly, which turns abstract ideas (a loop, a logic gate, a gradient) into something a child can see and feel.
Honest about AI. We show how AI actually works, including where it fails: a model that memorizes instead of learning, and a model trained on lopsided data that treats people unfairly.
No promises we can't keep. We don't claim to raise IQ or test scores. What the lessons give is steady practice with the habits engineers use: spotting patterns, breaking problems into steps, testing ideas, and fixing mistakes.
Built for children, private by design
- No accounts, sign-ups or email addresses. A child can never be asked for personal information.
- No ads, no analytics, no tracking pixels, no third-party scripts or cookies.
- Progress is stored only in the browser on your device (localStorage). Clear your browser data and it is gone.
- The read-aloud voice uses your device's built-in speech, so nothing is sent anywhere.
Read the full privacy policy.
Using Mansori in a classroom
Each lesson takes 4 to 10 minutes and ends with discussion questions and a screen-free activity you can run with paper, cups or string. Lessons work on Chromebooks, iPads and phones with no installation and no student logins, which makes them easy to use in schools.
The full curriculum
| # | Lesson | Ages | Learning goal | Builds on |
|---|---|---|---|---|
| 1 | What Comes Next? Color Patterns | 3–5 | Spot a repeating pattern (red, blue, red, blue) and pick what comes next. | — |
| 2 | Big to Small: Putting Things in Order | 3–5 | Put objects in order from biggest to smallest, the first idea behind sorting. | What Comes Next? Color Patterns |
| 3 | Count the Lights | 3–5 | Count from 1 to 10 by turning on one light for each number. | — |
| 4 | Light On, Light Off | 3–5 | Learn that a switch can be only on or off, the tiny idea every computer is built from. | Count the Lights |
| 5 | Spot the Odd One Out | 3–5 | Find the one thing that is different from the rest. | What Comes Next? Color Patterns |
| 6 | Shape Sorting Bins | 3–5 | Sort circles, squares and triangles into the right bins, the start of classification. | Spot the Odd One Out |
| 7 | Robot Steps to the Apple | 3–5 | Give a robot a short list of arrow steps to reach the apple. | Big to Small: Putting Things in Order |
| 8 | If It Rains, Take an Umbrella | 3–5 | Match each kind of weather to what we need, learning simple if-this-then-that rules. | Light On, Light Off |
| 9 | Find the Way Through the Maze | 3–5 | Trace a path from start to finish and learn that some paths are dead ends. | Robot Steps to the Apple |
| 10 | Teach the Robot: Apple or Banana? | 3–5 | Show a robot examples until it learns to tell apples from bananas: the very first idea of AI. | Shape Sorting Bins |
| 11 | Algorithms Are Recipes | 6–8 | Put the steps of making a sandwich in order and learn what an algorithm is. | Robot Steps to the Apple |
| 12 | Loops Make a Dance | 6–8 | Use a repeat block so a dancer repeats moves without writing them again and again. | Algorithms Are Recipes |
| 13 | Find the Bug! | 6–8 | Run a robot's program, watch where it goes wrong, and fix the one bad step. | Loops Make a Dance |
| 14 | Counting With Light Bulbs: Binary | 6–8 | Use five light bulbs worth 16, 8, 4, 2 and 1 to make any number up to 31. | Light On, Light Off |
| 15 | Pictures Are Made of Pixels | 6–8 | Paint a picture square by square and see how screens show images with tiny pixels. | Counting With Light Bulbs: Binary |
| 16 | Sorting Animals by Swapping | 6–8 | Line animals up by height by only swapping neighbours, a real sorting algorithm. | Big to Small: Putting Things in Order |
| 17 | When Clicked: Events | 6–8 | Connect buttons to actions and learn that programs wait for events like a click. | Loops Make a Dance |
| 18 | Guess the Animal in Yes/No Questions | 6–8 | Follow yes/no questions down a tree to guess an animal, the way many computer decisions work. | Shape Sorting Bins |
| 19 | Secret Codes With a Cipher Wheel | 6–8 | Spin a cipher wheel to send and crack secret messages. | Algorithms Are Recipes |
| 20 | How AI Learns From Examples | 6–8 | Give a computer more and better examples and watch its guesses get more accurate. | Teach the Robot: Apple or Banana? |
| 21 | Variables Are Labeled Boxes | 9–11 | Store, change and read values in labeled boxes, and trace what a short program does. | Algorithms Are Recipes |
| 22 | If/Else: Run the Traffic Lights | 9–11 | Write if/else rules that run a traffic light safely, and see what happens when a rule is wrong. | Variables Are Labeled Boxes |
| 23 | Guess My Number in 7 Tries | 9–11 | Find a number from 1 to 100 in at most 7 guesses by cutting the range in half each time. | Counting With Light Bulbs: Binary |
| 24 | Logic Gates: AND, OR, NOT | 9–11 | Flip switches into AND, OR and NOT gates and predict when the lamp lights up. | If/Else: Run the Traffic Lights |
| 25 | Shortest Path on a Map | 9–11 | Watch a search spread out like a ripple to find the shortest route, the idea behind map apps. | Find the Way Through the Maze |
| 26 | Shrinking Pictures: Compression | 9–11 | Squeeze a picture into fewer numbers by counting runs of the same color. | Pictures Are Made of Pixels |
| 27 | How the Internet Sends Messages | 9–11 | Split a message into packets, watch them take different routes, and put them back in order. | Shortest Path on a Map |
| 28 | Letters Are Numbers Inside a Computer | 9–11 | Type a word and see each letter turn into a number and then into binary. | Counting With Light Bulbs: Binary |
| 29 | AI Guesses by Looking at Neighbours | 9–11 | Drop a new point on a chart and let its nearest neighbours vote on what it is. | How AI Learns From Examples |
| 30 | Coin Flips and Chance | 9–11 | Flip thousands of virtual coins and dice and watch randomness turn into a predictable shape. | Count the Lights |
| 31 | Functions Are Input-Output Machines | 12–14 | Feed numbers into mystery machines, guess the rule, and chain functions together. | Variables Are Labeled Boxes |
| 32 | Recursion Grows a Tree | 12–14 | Use a function that calls itself to grow a fractal tree, and see the base case stop it. | Functions Are Input-Output Machines |
| 33 | The Sorting Race: Why Speed Matters | 12–14 | Race bubble sort against merge sort and see why some algorithms scale and others crawl. | Sorting Animals by Swapping |
| 34 | Build an Adder From Logic Gates | 12–14 | Wire XOR and AND gates into a circuit that adds binary numbers, just like a real chip. | Logic Gates: AND, OR, NOT |
| 35 | Inside a CPU: Fetch, Decode, Execute | 12–14 | Step a tiny CPU through a program and watch memory, registers and the program counter change. | Build an Adder From Logic Gates |
| 36 | Hashing: How Passwords Stay Secret | 12–14 | See how a hash turns any text into a fingerprint, and why one tiny change scrambles it. | Secret Codes With a Cipher Wheel |
| 37 | The Game of Life: Simple Rules, Complex Worlds | 12–14 | Draw cells, press play, and watch four simple rules create gliders, oscillators and chaos. | If/Else: Run the Traffic Lights |
| 38 | A Perceptron Learns to Draw a Line | 12–14 | Watch the simplest artificial neuron adjust its weights until it separates two groups. | AI Guesses by Looking at Neighbours |
| 39 | Gradient Descent: Rolling Downhill to Learn | 12–14 | Tune the learning rate and watch a ball roll down an error curve to the best answer. | A Perceptron Learns to Draw a Line |
| 40 | How Image Filters Find Edges | 12–14 | Slide a 3x3 kernel over a picture to blur it, sharpen it, or find its edges. | Pictures Are Made of Pixels |
| 41 | Inside a Neural Network | 15–18 | Change inputs and weights and watch signals flow through layers of neurons to an output. | A Perceptron Learns to Draw a Line |
| 42 | Backpropagation: Training a Network Live | 15–18 | Train a small network on XOR in your browser and watch the decision boundary bend. | Gradient Descent: Rolling Downhill to Learn |
| 43 | Overfitting: When a Model Memorizes | 15–18 | Fit curves of rising complexity and see training error fall while test error climbs. | Backpropagation: Training a Network Live |
| 44 | Words as Points: Embeddings | 15–18 | Explore a map where similar words sit close together, and do word arithmetic like king - man + woman. | Inside a Neural Network |
| 45 | How Chatbots Pick the Next Word | 15–18 | Build a tiny language model from text and change the temperature to see creative versus safe choices. | Coin Flips and Chance |
| 46 | Attention: How Transformers Focus | 15–18 | Click a word and see which other words it pays attention to, the core trick inside ChatGPT and Claude. | Words as Points: Embeddings |
| 47 | K-Means: Finding Groups Without Labels | 15–18 | Drop centroids, step the algorithm, and watch unlabeled points organize into clusters. | AI Guesses by Looking at Neighbours |
| 48 | Reinforcement Learning: An Agent Learns a Maze | 15–18 | Reward an agent for reaching the goal and watch Q-values spread until it finds the best path. | Shortest Path on a Map |
| 49 | Public-Key Secrets With Paint Mixing | 15–18 | Agree on a shared secret in public using the paint-mixing picture of Diffie-Hellman. | Hashing: How Passwords Stay Secret |
| 50 | Biased Data, Biased AI | 15–18 | Train a model on lopsided data, see who it fails, and fix it by fixing the data. | Overfitting: When a Model Memorizes |
Contact
Questions, ideas for lessons, or found a bug? Email support@mansori.ai.