🤖 アルゴリズムとAI

3D Boids — Flocking人気500 agents in 3D space following Reynolds' rules: separation, alignment, cohesion. Emergent… Ant ColonyStigmergic simulation: ants find food via pheromone trails. Self-organisation from simple rules. Pathfinding — A*, Dijkstra, BFS人気Draw walls, generate mazes and watch A*, Dijkstra, Greedy Best-First and BFS explore the… Genetic AlgorithmPopulation evolves via tournament selection, crossover and mutation. Two modes: classic… Travelling Salesman — TSPThree algorithms compete on the same city set: Nearest Neighbour greedy, 2-opt local search,… Maze GeneratorFour algorithms — DFS Backtracker, Prim's, Kruskal's and Wilson's loop-erased random walk —… Sorting Algorithms — Visual & Audio12 sorting algorithms animated as bar charts with Web Audio tones. Compare speed,… Langton's AntLangton's Ant: a two-dimensional Turing machine that creates complex emergent patterns from… N-Queens ProblemPlace N queens on a chessboard with no shared row, column or diagonal, and watch… Langton's Ant — Cellular Automaton that Builds HighwaysWatch Langton's ant, a simple Turing-complete automaton, spontaneously build a 'highway'… Maze Generator — Recursive Backtracker, Prim, Wilson's AlgorithmWatch 4 maze algorithms build live: Recursive Backtracker, Randomized Prim, Wilson's… Sorting Algorithms Visualizer — Bubble, Quick, Merge, HeapInteractive visualizer for 6 classic sorting algorithms: Bubble, Quick, Merge, Heap,… Wolfram 1D Cellular Automata — Elementary Rules & Complex BehaviourExplore all 256 Wolfram elementary cellular automaton rules. See how simple rules on a 1D… Hamming CodesFlip a bit in a Hamming-encoded word and watch the parity checks produce a syndrome that… Turing MachineStep-by-step Turing machine simulator with animated scrolling tape, highlighted state… Compiler PipelineNewWatch source code become machine code: lexing to tokens, recursive-descent parsing to an… Binary Search Tree — Insert, Search & BalanceNewAnimated BST operations: insert, search, delete and in-order traversal. Switch to AVL mode… Data StructuresNewInteractive visualisations of stacks, queues, linked lists and hash tables — insert, delete… Stable MatchingNewRun the Gale–Shapley deferred-acceptance algorithm step by step: proposals, tentative… A* PathfindingNewWatch A* find the shortest path on a grid using f = g + h. Paint walls, drag start/goal,… 0/1 KnapsackNewMaximize value without exceeding capacity. Watch dynamic programming fill the dp table cell… Huffman CodingNewBuild an optimal prefix-free code by merging the two rarest symbols again and again. Watch… QuadtreeNewA quadtree recursively subdivides the plane into four children. Watch it adapt to your point… Barnes–Hut N-bodyNewThe Barnes–Hut algorithm approximates an N-body gravity simulation in O(n log n) using a… Marching SquaresNewExtract contour lines from a 2D scalar field with the 16-case marching-squares lookup. Drag… Convex HullNewCompute the smallest convex polygon enclosing a point set with Graham scan, Jarvis march or… Minimax & Alpha-BetaNewDFS the game tree assuming the opponent plays optimally; alpha-beta pruning skips branches… Kalman FilterNewOptimally fuse noisy measurements with a motion model. The covariance ellipse grows on… Reed-Muller CodesNewChoose a Reed-Muller code variant, toggle message bits, then flip an encoded bit to inject… CRC ChecksumNewPick a CRC-8/16/32 preset, type a message, then inject an error and watch the checksum catch… LZ77 CompressionNewWatch the LZ77 sliding-window compression algorithm encode data by finding repeated patterns. Tower of Hanoi — Recursive Solver & 2ⁿ−1 MovesNewWatch the Tower of Hanoi solve itself with optimal recursion on 1–10 disks, animated… Gray Code — Reflected Binary & Hypercube PathNewExplore Gray code (g = b XOR b>>1), where each consecutive value flips one bit. Step the 2ⁿ… Red-Black Tree — Self-Balancing BSTNewInsert and delete keys in a red-black tree and watch recolouring and rotations keep it… B-Tree — Multi-Way Search TreeNewBuild a B-tree of order m by inserting keys: nodes fill, split at the median and push a key… Skip List — Probabilistic Balanced SearchNewA skip list stacks express lanes over a sorted linked list: each node is promoted with… Edit Distance — Levenshtein DP TableNewFill the Levenshtein dynamic-programming table cell by cell, then backtrack the cheapest… Longest Common Subsequence — DP AlignmentNewCompute the longest common subsequence of two strings with a DP grid, then trace the… KMP String Matching — Failure FunctionNewKnuth-Morris-Pratt searches text in O(n+m): a prefix failure function lets the pattern slide… Union-Find — Disjoint Sets & Path CompressionNewMerge elements into disjoint sets and find their roots in near-constant time. Union by rank… Simulated Annealing — Escaping Local MinimaNewSolve a travelling-salesman tour with simulated annealing: accept worse moves with… Particle Swarm Optimization — Swarm IntelligenceNewA swarm of particles searches a 2D cost landscape, each pulled toward its personal best and… Boolean Network — Kauffman NK ModelNewExplore Kauffman NK Boolean networks: N binary nodes with K random inputs. K controls… DCT Image Compression (JPEG Principle)NewDiscrete Cosine Transform compresses an 8×8 pixel block like JPEG. DCT-II: X_k =… Polar Codes — Channel CapacityNewPolar codes (Arıkan 2009) achieve Shannon capacity for binary-input symmetric channels.… Differential Evolution OptimizerNewDifferential Evolution (DE/rand/1/bin): mutant v = x_r1 + F(x_r2 - x_r3), crossover at rate… Aho–Corasick — Multi-Pattern String SearchNewBuild a trie of several patterns plus failure links, then scan text in a single O(n) pass,… AVL Tree — Self-Balancing RotationsNewInsert and delete keys in an AVL tree and watch balance factors update after every change.… Bellman-Ford Algorithm — Shortest Paths with Negative WeightsNewWatch Bellman-Ford relax every edge V−1 times to find shortest paths from a source, even… Binary Heap — Priority QueueNewInsert and extract values from a binary min-heap stored as an array. Watch sift-up and… Rabin–Karp — Rolling Hash String SearchNewSlide a window across the text, updating a polynomial rolling hash in O(1) per shift, and… Segment Tree — Range Sum & Range Minimum QueriesNewBuild a segment tree over an array in O(n) and answer range-sum or range-min queries and… Treap — Randomized Balanced BSTNewEach key in a treap gets a random priority; the tree stays a max-heap on priorities while…