Every project, explained
All 21 Remix Library projects: how each one works, the settings worth changing, and challenges from easy to hard. Great for planning lessons, or for figuring out where to start poking.
Games
Castle Escape A text adventure: explore the castle, find the crown, and get out. Type commands to play.
Flappy Square Tap to flap through the pipes. Gravity is not your friend.
Rock Paper Scissors AI Play against a computer that learns your habits and tries to predict your next move.
Snake The classic: eat the food, grow longer, don't bite yourself.
Space Miner Clicker Click the asteroid, buy drills and robots, and watch the crystals pile up.
Brick Breaker Bounce the ball, smash every brick. Aim with where it hits the paddle.
Pixel Jumper A platformer with 3 levels: run, jump, grab coins, dodge spikes, reach the flag.
Art & Animation
ASCII Art Studio Turn words into giant banners, draw the Mandelbrot fractal, and make patterns, all out of text.
Fireworks Click anywhere to launch a firework. Hundreds of glowing particles, a few lines of physics.
Warp Speed Fly through a 3D starfield. Move the mouse to steer, hold to go to lightspeed.
Music & Sound
Synth Keys Play a synthesizer with your keyboard. Pick a waveform and watch the sound wave live.
Beat Maker A 16-step drum machine. Every sound is synthesized from scratch with code.
Techy
ChatBot Buddy Build a chatbot from rules: it remembers your name, does math, tells jokes and talks back.
Matrix Rain The famous falling green code. Type a message and watch it hide in the rain.
Secret Codes Encrypt messages with a Caesar cipher, then crack codes without the key, like a real codebreaker.
Game of Life Conway's famous simulation: four simple rules, and patterns that seem alive.
Probability Lab Roll dice 10,000 times, estimate π by throwing random darts, and see math turn into pictures.
Sorting Visualizer Watch bubble, insertion, selection, merge and quick sort race. Count every compare and swap.
Maze Maker & Solver Generate a random maze with depth-first search, then solve it with breadth-first search.