Interactive visualizations of classical algorithms.
Click the maze to set start & end. Play against a minimax AI.
Watch a perceptron learn a decision boundary in real time.
Click to place start (green) → end (red) → walls. Then run. The algorithm explores weighted cells and finds the optimal route.
Classic 4 Gewinnt. You play against an AI using minimax search with alpha-beta pruning. Minimax is an approach in decision making and game theory. The core idea is trying to find an optimal strategy under the assumption that the opponent also plays optimal. This idea can be made more powerful by adding alpha beta pruning. It is a way for the algorithm to focus on promising parts of the gametree making it over all more powerful.
You are ■ Orange
AI is ■ Yellow
Minimax with alpha-beta pruning
You: 0 | AI: 0 | Draws: 0
The perceptron is the simplest neural network, a single neuron that learns a linear decision boundary. Click to place points of two classes, then watch it train. The boundary rotates and shifts in real time as the weights update.
Epoch: 0
Errors: 0 / 0
Accuracy: —