Home▸Categories▸Algorithms & AI

🤖 Algorithms & AI

Computational algorithms made visual: sorting, pathfinding, search and optimisation.

487 simulations60 fps real-time0 install steps
SVM Interactive VisualizerNew📱This simulation offers an interactive visualization of Support Vector Machines (SVMs),… Swarm Intelligence - Comprehensive GuideNew📱This simulation illustrates the principles of swarm intelligence, where decentralized… Swarm Intelligence SimulationNew📱Explore the fascinating world of swarm intelligence by controlling a group of virtual agents… Swarm Intelligence SimulatorNew📱This simulation explores swarm intelligence principles by allowing users to control a… Technology Api Design SimulationNew📱This simulation focuses on the design of Application Programming Interfaces (APIs),… Terrain GenNew📱This simulation illustrates the process of generating terrain using procedural algorithms.… Theater Playwriting SimulationNew📱This simulation offers an interactive environment for crafting theatrical scripts. It allows… Theater Theater Direction SimulationNew📱Explore the nuances of directorial choices within a theater setting. This simulation focuses… Transcendent Information Transcendence SimulationNew📱This simulation explores the potential for a biological system to process and manipulate… Traveling Salesperson Problem Visual RouteNew📱This simulation visually demonstrates the Traveling Salesperson Problem (TSP) by allowing… Tsp GeneticNew📱This simulation uses genetic algorithms to solve the Traveling Salesperson Problem (TSP). It… Tsp Solver VisualizerNew📱This simulation demonstrates the visual process of solving the Traveling Salesperson Problem… Model Tuning ChallengeNew📱This simulation demonstrates the principles of optimization and iterative improvement. Users… Model Tuning Challenge - Interactive ML Training GameNew📱Adjust hyperparameters to reach 95% accuracy in this ML training simulation. 🧩 Wave Function Collapse (WFC)New📱This simulation demonstrates the Wave Function Collapse algorithm, showcasing how patterns… Wireframe MorphingNew📱This simulation demonstrates the visual transformation of wireframes through morphing… Wolfram CaNew📱This interactive exploration demonstrates the core concepts of Wolfram CA (Cellular… Boids Flock Dynamics SimulationNew📱An interactive 2D simulation demonstrating the principles of flocking behavior using the… Cellular Automaton 3DNew📱This simulation visually represents a cellular automaton in three dimensions. It… City Skyline GeneratorNew📱This simulation demonstrates a procedural city generation algorithm, creating a dynamic… Algorithms SimulationNew📱This simulation explores the fundamental concepts of algorithms – step-by-step procedures… Data Structures SimulationNew📱This simulation explores the concept of data structures – methods for organizing and storing… Parallel Computing SimulationNew📱This simulation demonstrates the concept of parallel computing and its benefits for solving… Flocking BoidsNew📱This simulation is a variation of the Boids Flocking Simulation. It demonstrates how… Learning Learning Styles SimulationNew📱This simulation explores the concept of learning styles (e.g., visual, auditory,… Maze Generator 3DNew📱This simulation demonstrates a 3D maze generation algorithm, creating complex labyrinths… Maze PathfindingNew📱This simulation illustrates the problem of pathfinding through a maze. It demonstrates… Rubiks CubeNew📱Solve the Rubik's Cube using an interactive algorithm. This simulation demonstrates various… Rubik's Cube Algorithm SolverNew📱This simulation provides a visual representation of solving a Rubik's Cube. It allows users… Voxel WorldNew📱This simulation explores a world constructed entirely of voxels, showcasing how 3D space can… Ant colony pathfindingNew📱This simulation allows you to observe and manipulate ant colony pathfinding in a dynamic 3D… Ant Colony RoutesNew📱This simulation models the complex navigation strategies employed by ant colonies. Users can… Ant Colony Pathfinding SimulationNew📱Explore the fascinating world of ant colonies with this simulation! Observe how individual… Elevator Traffic ControlNew📱This simulation models the traffic control system within an elevator shaft. It demonstrates… Flocking SystemNew📱This simulation demonstrates the mesmerizing behavior of flocks – like birds or fish – by… Rail Yard DispatchNew📱This simulation demonstrates a simplified model of train dispatching operations at a railway… Factory Production Line SimulatorNew📱This simulation models a factory production line, demonstrating concepts like throughput,… Resource Kriging CloudNew📱This simulation demonstrates the application of kriging – a geostatistical technique – to… Sensor Fusion SorterNew📱This simulation explores the concept of sensor fusion by allowing users to combine data from… Supply NetworkNew📱An interactive 3D simulation visualizing the optimization of supply chains, considering… Synaptic Network LabNew📱This simulation explores the dynamics of artificial neural networks. Users can modify… K-D Trees: Fast Nearest-Neighbor Search in Multidimensional SpaceNew📱Watch a k-d tree's recursive splits partition a point set, then follow a nearest-neighbor… LRU Cache: Evicting the Least Recently Used ItemNew📱Explore how a fixed-capacity cache decides what to throw away when it's full, using the… Count-Min Sketch: Estimating Frequencies Without Storing EverythingNew📱Learn how the Count-Min Sketch estimates item frequencies in massive data streams using a… HyperLogLog: Counting Billions of Unique Items in a Few KilobytesNew📱Explore how HyperLogLog estimates the number of distinct items in massive datasets using… Splay Trees: The Self-Adjusting Binary Search TreeNew📱Explore how a splay tree reshapes itself with every access, using zig, zig-zig, and zig-zag… Fenwick Trees (Binary Indexed Trees): Fast Running TotalsNew📱Explore how a Fenwick tree (binary indexed tree) keeps prefix sums of an array both easy to… Tries: The Prefix Tree Behind AutocompleteNew📱Explore how a trie (prefix tree) stores strings so that words sharing a prefix share a path,… The Closest Pair of Points Problem: A Classic Divide-and-Conquer AlgorithmNew📱Explore how the closest pair of points problem in computational geometry is solved… The Line Sweep Algorithm: Solving Geometry Problems by Sweeping a Line Across the PlaneNew📱Explore the line sweep (plane sweep) technique in computational geometry, where a moving… R-Trees: The Data Structure That Makes Map Queries FastNew📱Learn how the R-tree data structure indexes points, rectangles, and shapes on a map using… Interval Trees: Finding Every Overlapping Time Range InstantlyNew📱Explore how interval trees use an augmented binary search tree to find every stored range… Suffix Array: Fast Substring Search Made SimpleNew📱Explore the suffix array, a sorted index of all suffixes of a string that enables fast… Rope: The Data Structure Behind Big Text EditorsNew📱Explore the rope data structure, a binary tree of string chunks that lets text editors… Cuckoo Hashing: Evicting Your Way to Fast LookupsNew📱Explore cuckoo hashing, a hash table scheme where colliding keys evict each other between… Van Emde Boas Tree: Beating Log N With Log Log NNew📱Explore the van Emde Boas tree, a recursive cluster-and-summary data structure that answers… Locality-Sensitive Hashing: Making Similar Things CollideNew📱Explore locality-sensitive hashing, a technique that deliberately makes similar… Roaring Bitmap: Compressed Sets for Fast DatabasesNew📱Explore roaring bitmaps, a compressed bitmap structure that adaptively picks array, bitset,… B+ Tree Database IndexNew📱Explore how a B+ tree index stores all records in linked leaf nodes, letting databases scan… LSM Tree: How Cassandra, RocksDB, and LevelDB Write FastNew📱Explore the Log-Structured Merge Tree, the write-optimized storage engine behind Cassandra,… Cuckoo FilterNew📱Explore the cuckoo filter, a compact probabilistic structure that answers set-membership… Suffix Automaton: The Compressed Map of Every SubstringNew📱Explore the suffix automaton, the smallest deterministic finite automaton that recognizes… The Z-Algorithm for String MatchingNew📱Explore how the Z-algorithm builds the Z-array in linear time and uses it to find every… Burrows-Wheeler Transform: The Reversible Shuffle Behind bzip2 and Genome SearchNew📱Explore the Burrows-Wheeler Transform, a reversible rearrangement of a string that clusters… The Michael-Scott Lock-Free QueueNew📱Explore how the Michael-Scott algorithm builds a thread-safe FIFO queue from a singly linked… Sliding Window Minimum via Monotonic DequeNew📱Explore how a monotonic deque tracks the minimum (or maximum) of the last K elements in a… HAMT: Hash Array Mapped TrieNew📱Explore how Hash Array Mapped Tries let languages like Clojure and Scala implement immutable… Link-Cut TreeNew📱Explore the link-cut tree, an advanced data structure that maintains a dynamic forest of… Wavelet TreeNew📱Explore the wavelet tree, a succinct data structure that answers access, rank, and select… Succinct Rank/Select BitvectorNew📱Explore how a bit array can be augmented with a tiny superblock/block index so that rank and… Order-Statistics TreeNew📱Explore how augmenting a balanced binary search tree with subtree-size counters unlocks… Skip Graph: Decentralized Ordered Search for Peer-to-Peer NetworksNew📱Explore how skip graphs generalize skip lists into a fully decentralized structure that… Judy Array: The Cache-Conscious Adaptive TrieNew📱Explore the Judy array, a sparse associative array and sorted-integer-set structure that… Bitboard Techniques: Encoding a Chessboard in 64 BitsNew📱Explore how chess engines represent an 8x8 board as 64-bit integers, using bitwise… AMS Sketch: Estimating Stream Skew in a Sliver of MemoryNew📱Explore the AMS (Alon-Matias-Szegedy) Sketch, a randomized streaming algorithm that… Karger's Randomized Min-Cut AlgorithmNew📱Explore how Karger's algorithm finds the global minimum cut of a graph by repeatedly… Dinic's Algorithm for Maximum FlowNew📱Explore how Dinic's algorithm speeds up maximum flow computation by alternating BFS-built… Fountain Codes and LT Codes: Rateless Erasure CodingNew📱Watch an LT fountain code turn a file into an endless stream of XOR-combined droplets, and… Reed-Solomon Erasure Coding for Distributed StorageNew📱See how Reed-Solomon codes shard data into data and parity blocks across storage nodes, then… Fractional Cascading: One Binary Search Through Many ListsNew📱Discover how fractional cascading searches the same key across a chain of sorted arrays by… T-Digest: Streaming Quantile EstimationNew📱Stream a large data distribution through the t-digest algorithm's adaptive centroid merging… Piece Table: The Text Editor's Secret Edit BufferNew📱Type and delete text in a simulated editor and watch its piece table track original and add… Aho–Corasick Algorithm ExplainedNew📱Interactive automaton visualization matching multiple pattern strings against a scrolling… AVL Tree Rotations ExplainedNew📱Interactive self-balancing binary search tree rendered in 3D that rotates nodes as values… Bellman–Ford Algorithm ExplainedNew📱3D weighted graph, including negative-weight edges, where the sim animates edge relaxation… Aho–Corasick — Multi-Pattern String SearchNew📱Build a trie of several patterns plus failure links, then scan text in a single O(n) pass,… AVL Tree — Self-Balancing RotationsNew📱Insert and delete keys in an AVL tree and watch balance factors update after every change.… Bellman-Ford Algorithm — Shortest Paths with Negative WeightsNew📱Watch Bellman-Ford relax every edge V−1 times to find shortest paths from a source, even… Binary Heap — Priority QueueNew📱Insert and extract values from a binary min-heap stored as an array. Watch sift-up and… Rabin–Karp — Rolling Hash String SearchNew📱Slide a window across the text, updating a polynomial rolling hash in O(1) per shift, and… Segment Tree — Range Sum & Range Minimum QueriesNew📱Build a segment tree over an array in O(n) and answer range-sum or range-min queries and… Treap — Randomized Balanced BSTNew📱Each key in a treap gets a random priority; the tree stays a max-heap on priorities while… Boolean Network — Kauffman NK ModelNew📱Explore Kauffman NK Boolean networks: N binary nodes with K random inputs. K controls… DCT Image Compression (JPEG Principle)New📱Discrete Cosine Transform compresses an 8×8 pixel block like JPEG. DCT-II: X_k =… Polar Codes — Channel CapacityNew📱Polar codes (Arıkan 2009) achieve Shannon capacity for binary-input symmetric channels.… Differential Evolution OptimizerNew📱Differential Evolution (DE/rand/1/bin): mutant v = x_r1 + F(x_r2 - x_r3), crossover at rate… Tower of Hanoi — Recursive Solver & 2ⁿ−1 MovesNew📱Watch the Tower of Hanoi solve itself with optimal recursion on 1–10 disks, animated… Gray Code — Reflected Binary & Hypercube PathNew📱Explore Gray code (g = b XOR b>>1), where each consecutive value flips one bit. Step the 2ⁿ… Red-Black Tree — Self-Balancing BSTNew📱Insert and delete keys in a red-black tree and watch recolouring and rotations keep it… B-Tree — Multi-Way Search TreeNew📱Build a B-tree of order m by inserting keys: nodes fill, split at the median and push a key… Skip List — Probabilistic Balanced SearchNew📱A skip list stacks express lanes over a sorted linked list: each node is promoted with… Edit Distance — Levenshtein DP TableNew📱Fill the Levenshtein dynamic-programming table cell by cell, then backtrack the cheapest… Longest Common Subsequence — DP AlignmentNew📱Compute the longest common subsequence of two strings with a DP grid, then trace the… KMP String Matching — Failure FunctionNew📱Knuth-Morris-Pratt searches text in O(n+m): a prefix failure function lets the pattern slide… Union-Find — Disjoint Sets & Path CompressionNew📱Merge elements into disjoint sets and find their roots in near-constant time. Union by rank… Simulated Annealing — Escaping Local MinimaNew📱Solve a travelling-salesman tour with simulated annealing: accept worse moves with… Particle Swarm Optimization — Swarm IntelligenceNew📱A swarm of particles searches a 2D cost landscape, each pulled toward its personal best and… Reed-Muller CodesNew📱Choose a Reed-Muller code variant, toggle message bits, then flip an encoded bit to inject… CRC ChecksumNew📱Pick a CRC-8/16/32 preset, type a message, then inject an error and watch the checksum catch… LZ77 CompressionNew📱Watch the LZ77 sliding-window compression algorithm encode data by finding repeated patterns. Binary Search Tree — Insert, Search & BalanceNew📱Animated BST operations: insert, search, delete and in-order traversal. Switch to AVL mode… Data StructuresNew📱Interactive visualisations of stacks, queues, linked lists and hash tables — insert, delete… Compiler PipelineNew📱Watch source code become machine code: lexing to tokens, recursive-descent parsing to an… Stable MatchingNew📱Run the Gale–Shapley deferred-acceptance algorithm step by step: proposals, tentative… A* Pathfinding on a Gridded EnvironmentNew📱Explore the A* algorithm as it dynamically calculates the shortest path across a grid,… 0/1 KnapsackNew📱Maximize value without exceeding capacity. Watch dynamic programming fill the dp table cell… Huffman CodingNew📱Build an optimal prefix-free code by merging the two rarest symbols again and again. Watch… Quadtree Spatial IndexNew📱Explore how a quadtree recursively divides space into quadrants, allowing you to manage and… Barnes–Hut N-bodyNew📱The Barnes–Hut algorithm approximates an N-body gravity simulation in O(n log n) using a… Marching Squares Algorithm VisualizationNew📱Explore the marching squares algorithm in 2D, manipulating a scalar field to generate… Convex HullNew📱Compute the smallest convex polygon enclosing a point set with Graham scan, Jarvis march or… Minimax & Alpha-BetaNew📱DFS the game tree assuming the opponent plays optimally; alpha-beta pruning skips branches… Kalman FilterNew📱Optimally fuse noisy measurements with a motion model. The covariance ellipse grows on… Hamming Codes📱Flip a bit in a Hamming-encoded word and watch the parity checks produce a syndrome that… Turing Machine📱Step-by-step Turing machine simulator with animated scrolling tape, highlighted state… N-Queens Problem📱Place N queens on a chessboard with no shared row, column or diagonal, and watch… Langton's Ant — Cellular Automaton that Builds Highways📱Watch Langton's ant, a simple Turing-complete automaton, spontaneously build a 'highway'… Maze Generator — Recursive Backtracker, Prim, Wilson's Algorithm📱Watch 4 maze algorithms build live: Recursive Backtracker, Randomized Prim, Wilson's… Sorting Algorithms Visualizer — Bubble, Quick, Merge, Heap📱Interactive visualizer for 6 classic sorting algorithms: Bubble, Quick, Merge, Heap,… Wolfram 1D Cellular Automata — Elementary Rules & Complex Behaviour📱Explore all 256 Wolfram elementary cellular automaton rules. See how simple rules on a 1D… Langton's Ant📱Langton's Ant: a two-dimensional Turing machine that creates complex emergent patterns from… Ant Colony Pheromone Trails Simulation📱Explore the fascinating world of ant colonies as you observe how they use pheromone trails… Genetic Algorithm📱Population evolves via tournament selection, crossover and mutation. Two modes: classic… Travelling Salesman — TSP📱Three algorithms compete on the same city set: Nearest Neighbour greedy, 2-opt local search,… Maze Generator📱This simulation demonstrates the principles of maze generation algorithms. It visually shows… Sorting Algorithms — Visual & Audio📱12 sorting algorithms animated as bar charts with Web Audio tones. Compare speed,… Hash Table and Collisions (2D)📱Insert keys into a 2D hash table and watch a real hash function map them into buckets,…
About the category

Algorithms & AI

Computational algorithms made visual: sorting, pathfinding, search and optimisation.

Three.js · WebGL 60 FPS CC BY 4.0
Quick facts
487interactive simulations in this category
⚡runs at 60 FPS in any modern browser
🌐English, Ukrainian, Polish, Spanish, German, Japanese, Italian, Portuguese (Brazil), French, Arabic, Dutch, Chinese, Korean, Hindi, Turkish, Vietnamese, Russian, Indonesian, Persian, Bengali, Thai, Filipino, Swahili, Urdu, Malay, Tamil, Hebrew, Greek, Punjabi, Amharic, Burmese, Khmer, Georgian, Nepali, Mongolian, Armenian, Sinhala, Lao, Czech, Romanian, Hungarian, Bulgarian, Swedish, Danish, Finnish, Norwegian, Slovak, Croatian, Serbian, Slovenian, Lithuanian, Latvian, Estonian, Icelandic, Albanian, Macedonian, Bosnian, and Maltese
🎓CC BY 4.0 — free for classrooms and LMS embeds

Frequently asked questions

Do I need to install anything to run Algorithms & AI simulations?▾

No. Everything runs entirely in your browser — no downloads, plugins or accounts. Works in Chrome, Firefox, Edge and Safari; most simulations also work on mobile.

Can I use these simulations for teaching?▾

Yes — all content is free for educational use under CC BY 4.0. Link to any simulation directly or embed it in your LMS with an iframe; no API key required.

Are the models scientifically accurate?▾

They use the same mathematical formulations as professional software, integrated numerically in real time. Each simulation lists its algorithms, and many link to an article explaining the mathematics.

Related categories

What did you find?

Add reproduction steps (optional)