Skip to main content

Algorithm Playground

Interactive demonstrations of classic algorithms and problem-solving techniques. Each game showcases different algorithmic approaches and computational thinking.

🎯
LiveHard

Tic-Tac-Toe AI

Play against an AI with 3 difficulty levels: Easy (random), Medium (heuristic), and Hard (unbeatable Minimax algorithm).

Algorithm: Minimax Algorithm
🗺️
LiveHard

Pathfinding Visualizer

Visualize A* and Dijkstra algorithms finding the shortest path through obstacles in real-time.

Algorithm: A* & Dijkstra

Why These Games?

These aren't just games—they're demonstrations of fundamental computer science concepts. From game theory (Minimax) to graph traversal (A*), each showcases different problem-solving paradigms used in real-world software engineering.